Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? (English)
Free access
- New search for: Cramer, Ronald
- New search for: Damgård, Ivan
- New search for: Cramer, Ronald
- New search for: Damgård, Ivan
In:
Advances in Cryptology — CRYPTO '98
;
424-441
;
1998
- Article/Chapter (Book) / Electronic Resource
-
Title:Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
-
Contributors:Cramer, Ronald ( author ) / Damgård, Ivan ( author )
-
Published in:Advances in Cryptology — CRYPTO '98 ; 424-441Lecture Notes in Computer Science ; 1462 ; 424-441
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1998-01-01
-
Size:18 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1Bleichenbacher, Daniel et al. | 1998
- 13
-
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attackCramer, Ronald / Shoup, Victor et al. | 1998
- 26
-
Relations among notions of security for public-key encryption schemesBellare, Mihir / Desai, Anand / Pointcheval, David / Rogaway, Phillip et al. | 1998
- 46
-
Cryptography and the internetBellovin, Steven M. et al. | 1998
- 56
-
Differential collisions in SHA-0Chabaud, Florent / Joux, Antoine et al. | 1998
- 72
-
From differential cryptanalysis to ciphertext-only attacksBiryukov, Alex / Kushilevitz, Eyal et al. | 1998
- 89
-
A simplified approach to threshold and proactive RSARabin, Tal et al. | 1998
- 105
-
New efficient and secure protocols for verifiable signature sharing and other applicationsCatalano, Dario / Gennaro, Rosario et al. | 1998
- 121
-
Trading correctness for privacy in unconditional multi-party computationFitzi, Matthias / Hirt, Martin / Maurer, Ueli et al. | 1998
- 137
-
Fast digital identity revocationAiello, William / Lodha, Sachin / Ostrovsky, Rafail et al. | 1998
- 153
-
Self-delegation with controlled propagation — or — What if you lose your laptopGoldreich, Oded / Pfitzmann, Birgit / Rivest, Ronald L. et al. | 1998
- 169
-
Identity escrowKilian, Joe / Petrank, Erez et al. | 1998
- 186
-
Generalized birthday attacks on unbalanced Feistel networksJutla, Charanjit S. et al. | 1998
- 200
-
Quadratic relation of S-box and its application to the linear attack of full round DESShimoyama, Takeshi / Kaneko, Toshinobu et al. | 1998
- 212
-
Cryptanalysis of block ciphers with probabilistic non-linear relations of low degreeJakobsen, Thomas et al. | 1998
- 223
-
Cryptanalysis of the Ajtai-Dwork cryptosystemNguyen, Phong / Stern, Jacques et al. | 1998
- 243
-
Cryptanalysis of the Chor-Rivest cryptosystemVaudenay, Serge et al. | 1998
- 257
-
Cryptanalysis of the oil and vinegar signature schemeKipnis, Aviad / Shamir, Adi et al. | 1998
- 267
-
From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACsNaor, Moni / Reingold, Omer et al. | 1998
- 283
-
Many-to-one trapdoor functions and their relation to public-key cryptosystemsBellare, Mihir / Halevi, Shai / Sahai, Amit / Vadhan, Salil et al. | 1998
- 299
-
Authentication, enhanced security and error correcting codesAumann, Yonatan / Rabin, Michael O. et al. | 1998
- 304
-
An efficient discrete log pseudo random generatorPatel, Sarvar / Sundaram, Ganapathy S. et al. | 1998
- 318
-
Fast RSA-type cryptosystem modulo p k qTakagi, Tsuyoshi et al. | 1998
- 327
-
An elliptic curve implementation of the finite field digital signature algorithmKoblitz, Neal et al. | 1998
- 338
-
Quantum bit commitment from a physical assumptionSalvail, Louis et al. | 1998
- 354
-
On concrete security treatment of signatures derived from identificationOhta, Kazuo / Okamoto, Tatsuaki et al. | 1998
- 370
-
Building PRFs from PRPsHall, Chris / Wagner, David / Kelsey, John / Schneier, Bruce et al. | 1998
- 390
-
Security amplification by composition: The case of doubly-iterated, ideal ciphersAiello, W. / Bellare, M. / Crescenzo, G. / Venkatesan, R. et al. | 1998
- 408
-
On the existence of 3-round zero-knowledge protocolsHada, Satoshi / Tanaka, Toshiaki et al. | 1998
- 424
-
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?Cramer, Ronald / Damgård, Ivan et al. | 1998
- 442
-
Concurrent zero-knowledge: Reducing the need for timing constraintsDwork, Cynthia / Sahai, Amit et al. | 1998
- 458
-
The solution of McCurley's discrete log challengeWeber, Damian / Denny, Thomas et al. | 1998
- 472
-
Optimal extension fields for fast arithmetic in public-key algorithmsBailey, Daniel V. / Paar, Christof et al. | 1998
- 486
-
Time-stamping with binary linking schemesBuldas, Ahto / Laud, Peeter / Lipmaa, Helger / Villemson, Jan et al. | 1998
- 502
-
Threshold traitor tracingNaor, Moni / Pinkas, Benny et al. | 1998