Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
- 13 September 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 111-126
- https://doi.org/10.1007/3-540-45708-9_8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- OAEP ReconsideredLecture Notes in Computer Science, 2001
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Improved Non-committing Encryption Schemes Based on a General Complexity AssumptionLecture Notes in Computer Science, 2000
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- The random oracle methodology, revisited (preliminary version)Published by Association for Computing Machinery (ACM) ,1998
- Plug and play encryptionLecture Notes in Computer Science, 1997
- Adaptively secure multi-party computationPublished by Association for Computing Machinery (ACM) ,1996
- Optimal asymmetric encryptionLecture Notes in Computer Science, 1995
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993