Ingrid Biehl, Sachar Paulus, Tsuyoshi Takagi  Home/Search
Context Related
| informatik.tudarm...10.abstract.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.tud...DME.year.author (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In 1989 Chaum... In this paper we present new undeniable signature schemes which are constructed over an imaginary quadratic field. The basic scheme contains zero-knowledge confirmation and disavowal protocols which require operations of cubic bit complexity by the signer. In case one omits the part of the protocols which is costly the confirmation and disavowal protocol are not zero-knowledge but honest-verifier zero-knowledge; the remaining operations for the signer have quadratic bit... (Update)
Similar documents based on text: More All
0.9: Efficient Undeniable Signature Schemes Based on Ideal.. - Biehl, Paulus, Takagi (1999) (Correct)
0.4: A New Public-Key Cryptosystem over Quadratic Orders with.. - Paulus, Takagi (1999) (Correct)
0.3: Algorithms for Quadratic Orders - Biehl, Buchmann (1993) (Correct)
BibTeX entry: (Update)
I. Biehl and S. Paulus and T. Takagi, "Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders," to be presented at Conference on The Mathematics of Public-Key Cryptography, Toronto, 1999. http://citeseer.ist.psu.edu/article/biehl99efficient.html More
@misc{ biehl99efficient,
author = "I. Biehl and S. Paulus and T. Takagi",
title = "Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic
Orders",
note = "to be presented at Conference on The Mathematics of Public-Key Cryptography,
Toronto, 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/article/biehl99efficient.html" }
Citations (may not include all citations):88 Undeniable signatures (context) - Chaum, van Antwerpen - 1990
80 Zero-Knowledge undeniable signatures (context) - Chaum - 1991
50 A key-exchange system based on imaginary quadratic fields (context) - Buchmann, Williams - 1988
37 Convertible undeniable signatures (context) - Boyar, Chaum et al. - 1991
33 Explicit bounds for primality testing and related problems (context) - Bach - 1990
24 LiDIA - A library for computational number theory - Biehl, Buchmann et al. - 1995
18 A world wide number field sieve factoring record: on to 512 .. (context) - Cowie, Dodson et al. - 1996
14 the complexity and efficiency of a new key exchange system - Buchmann, Dullmann et al. - 1990
9 Quadratic fields and cryptography (context) - Buchmann, Williams - 1990
9 Primes of the form x (context) - Cox
8 An analysis of the reduction algorithms for binary quadratic.. - Biehl, Buchmann - 1998
Documents on the same site (http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/reports/README.year.author.html): More
On the Security of a Modified Paillier Public-Key Primitive - Sakurai, Takagi (2002) (Correct)
On Some Computational Problems in Finite Abelian Groups - Buchmann, Jacobson, Jr.. (Correct)
Number Field Cryptography - Buchmann, Takagi, Vollmer (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC