Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case

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

Volumn 2442, Issue , 2002, Pages 111-126

  Nielsen, Jesper Buus ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

ADAPTIVE ADVERSARY; INTERACTIVE COMMUNICATIONS; RANDOM ORACLE; RANDOM ORACLES; RO MODELING;

CRYPTOGRAPHY;

EID: 84937420653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45708-9_8     Document Type: Conference Paper

References (16)

1. ACM88. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, Illinois, 2–4 May 1988.
2. Bea97. D. Beaver. Plug and play encryption. In Crypto ’97, pages 75–89, Berlin, 1997. Springer. LNCS Vol. 1294.
3. BFM88. Manuel Blum, Paul Feldman, and Silvio Micali. Non-interactive zeroknowledge and its applications (extended abstract). In [ACM88], pages 103–112.
4. BGW88. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In [ACM88], pages 1–10.
5. BH92. D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In EuroCrypt ’92, pages 307–323, Berlin, 1992. Springer. LNCS Vol. 658.
6. BR93.Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computing and Communications Security, pages 62–73. ACM, 1993.
7. BR95. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In EuroCrypt ’94, pages 92–111, Berlin, 1995. Springer. LNCS Vol. 950.
8. Can00. Ran Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143–202, winter 2000.
9. Can01. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42th Annual Symposium on Foundations of Computer Science. IEEE, 2001.
10. CCD88. David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In [ACM88], pages 11–19.
11. CFGN96. Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 639–648, Philadelphia, Pennsylvania, 22–24 May 1996.
12. CGH98. Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited (preliminary version). In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 209–218, Dallas, TX, USA, 24–26 May 1998.
13. DN00. Ivan Damgård and Jesper B. Nielsen. Improved non-committing encryption schemes based on a general complexity assumption. In Crypto 2000, pages 432–450, Berlin, 2000. Springer. LNCS Vol. 1880.
14. FS86. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Crypto ’86, pages 186–194, Berlin, 1986. Springer. LNCS Vol. 263.
15. GK90. O. Goldreich and H. Krawczyk. On the composition of zero knowledge proof systems. In Proceedings of ICALP 90, Berlin, 1990. Springer. LNCS Vol. 443.
16. Sho01. Victor Shoup. OAEP reconsidered. In Crypto 2001, pages 239–259, Berlin, 2001. Springer. LNCS Vol. 2139.