Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

This publication has 12 references indexed in Scilit:

• OAEP Reconsidered
  Published by Springer Nature ,2001
• Universally composable security: a new paradigm for cryptographic protocols
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2001
• Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
  Published by Springer Nature ,2000
• Security and Composition of Multiparty Cryptographic Protocols
  Journal of Cryptology, 2000
• The random oracle methodology, revisited (preliminary version)
  Published by Association for Computing Machinery (ACM) ,1998
• Plug and play encryption
  Published by Springer Nature ,1997
• Adaptively secure multi-party computation
  Published by Association for Computing Machinery (ACM) ,1996
• Optimal asymmetric encryption
  Published by Springer Nature ,1995
• Random oracles are practical
  Published by Association for Computing Machinery (ACM) ,1993
• Completeness theorems for non-cryptographic fault-tolerant distributed computation
  Published by Association for Computing Machinery (ACM) ,1988