Communication-efficient non-interactive proofs of knowledge with online extractors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3621 LNCS, Issue , 2006, Pages 152-168

  Fischlin, Marc ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SECURITY OF DATA; THEOREM PROVING;

EXTRACTABLE PROOFS; FIAT-SHAMIR TRANSFORMATION; NON-INTERACTIVE PROOFS; ONLINE EXTRACTORS;

INTERNET;

EID: 33745123687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (29)

1. Masayuki Abe. Combining Encryption and Proof of Knowledge in the Random Oracle Model. The Computer Journal, 47(1):58-70, 2004.
2. Giuseppe Ateniese, Jan Camenisch, Marc Joye, and Gene Tsudik. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. Advances in Cryptology - Crypto 2000, Volume 1880 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
3. Dan Boneh and Xavier Boyen. Short Signatures Without Random Oracles. Advances in Cryptology - Eurocrypt 2004, Volume 3027 of Lecture Notes in Computer Science, pages 56-73. Springer-Verlag, 2004.
4. Mihir Bellare, Alexandra Boldyreva, and Adriana Palacio. An Un-Instantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. Advances in Cryptology - Eurocrypt 2004, Volume 3027 of Lecture Notes in Computer Science. Springer-Verlag, 2004.
5. Dan Boneh, Xavier Boyen, and Hovav Shacham. Short Group Signatures. Advances in Cryptology - Crypto 2004, Volume 3152 of Lecture Notes in Computer Science, pages 41-55. Springer-Verlag, 2004.
6. Mihir Bellare, Juan Garay, and Tal Rabin. Fast Batch Verification for Modular Exponentiation and Digital Signatures. Advances in Cryptology - Eurocrypt'98, Volume 1403 of Lecture Notes in Computer Science, pages 236-250. Springer-Verlag, 1998.
7. Mihir Bellare, Daniele Micciancio, and Bogdan Warinschi. Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. Advances in Cryptology - Eurocrypt 2003, Volume 2656 of Lecture Notes in Computer Science, pages 614-629. Springer-Verlag, 2003.
8. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. Proceedings of the Annual Conference on Computer and Communications Security (CCS). ACM Press, 1993.
9. Ronald Cramer, Ivan Damgard, and Berry Schoenmakers. Proofs of Partial Knowledge and Simplified Desing of Witness Hiding Protocols. Advances in Cryptology - Crypto'94, Volume 839 of Lecture Notes in Computer Science, pages 174-187. Springer-Verlag, 1995.
10. Ran Canetti, Oded Goldreich, and Shai Halevi. The Random Oracle Methodology, Revisited. Proceedings of the Annual Symposium on the Theory of Computing (STOC) 1998, pages 209-218. ACM Press, 1998.
11. Jean-Sebastien Coron. On the Exact Security of Full Domain Hash. Advances in Cryptology - Crypto 2000, Volume 1880 of Lecture Notes in Computer Science, pages 229-235. Springer-Verlag, 2000.
12. Jean-Sebastien Coron. Optimal Security Proofs for PSS and Other Signature Schemes. Advances in Cryptology - Eurocrypt 2002, Volume 2332 of Lecture Notes in Computer Science, pages 272-287. Springer-Verlag, 2002.
13. David Chaum and Torben Pedersen. Wallet Databases with Observers. Advances in Cryptology - Crypto'92, Volume 740 of Lecture Notes in Computer Science, pages 89-105. Springer-Verlag, 1992.
14. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, and Moti Yung. On Monotone Formula Closure of SZK. Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS)'94, pages 454-465. IEEE Computer Society Press, 1994.
15. Erik De Win, Serge Mister, Bart Preneel, and Michael Wiener. On the Performance of Signature Schemes Based on Elliptic Curves. Algorithmic Number Theory Symposium - ANTS-III, Volume 1423 of Lecture Notes in Computer Science, pages 252-266. Springer-Verlag, 1998.
16. Alfredo De Santis and Giuseppe Persiano. Zero-Knowledge Proofs of Knowledge Without Interaction. Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS)'92, pages 427-436. IEEE Computer Society Press, 1992.
17. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Schemes. Advances in Cryptology - Crypto'86, Volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer-Verlag, 1986.
18. Eu-Jin Goh and Stanislaw Jarecki. Signature Scheme as Secure as the Diffie-Hellman Problem. Advances in Cryptology - Eurocrypt 2003, Volume 2656 of Lecture Notes in Computer Science, pages 401-415. Springer-Verlag, 2003.
19. Louis Guillou and Jean-Jacques Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Trasmission and Memory. Advances in Cryptology - Eurocrypt'88, Volume 330 of Lecture Notes in Computer Science, pages 123-128. Springer-Verlag, 1988.
20. Shaft Goldwasser and Yael Tauman. On the (In)security of the Fiat-Shamir Paradigm. Proceedings of the Annual Symposium on Foundations of Computer Science (FOGS) 2003, pages 102-113. IEEE Computer Society Press, 2003.
21. Jonothan Katz and Nan Wang. Efficiency Improvement for Signature Schemes with Tight Security Reductions. Proceedings of the Annual Conference on Computer and Communications Security (CCS). ACM Press, 2003.
22. R. Merkle. A Digital Signature Based on a Conventional Encryption Function. Advances in Cryptology - Crypto'87, Volume 293 of Lecture Notes in Computer Science, pages 369-378. Springer-Verlag, 1988.
23. Ueli Maurer, Renato Renner, and Clemens Holenstein. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. Theory of Cryptography Conference (TCC) 2004, Volume 2951 of Lecture Notes in Computer Science, pages 21-39. Springer-Verlag, 2004.
24. Daniele Micciancio and Salil Vadhan. Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. Advances in Cryptology - Crypto 2003, Volume 2729 of Lecture Notes in Computer Science, pages 282-298. Springer-Verlag, 2003.
25. T. Okamoto. Provable Secure and Practical Identification Schemes and Corresponding Signature Schemes. Advances in Cryptology - Crypto'92, Volume 740 of Lecture Notes in Computer Science, pages 31-53. Springer-Verlag, 1992.
26. Rafael Pass. On Deniability in the Common Reference String and Random Oracle Model. Advances in Cryptology - Crypto 2003, Volume 2729 of Lecture Notes in Computer Science, pages 316-337. Springer-Verlag, 2003.
27. David Pointcheval and Jacques Stern. Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology, 13(3):361-396, 2000.
28. C.P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4:161-174, 1991.
29. Victor Shoup and Rosario Gennaro. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. Journal of Cryptology, 15(2):75-96, 2002.