International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Jesper Buus Nielsen
Download:
DOI: 10.1007/3-540-45708-9_8 (login may be required)
URL: https://iacr.org/archive/crypto2002/24420111/24420111.pdf
Search ePrint
Search Google
Conference: CRYPTO 2002
BibTeX
@inproceedings{crypto-2002-1603,
  title={Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case},
  booktitle={Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={2442},
  pages={111-126},
  url={https://iacr.org/archive/crypto2002/24420111/24420111.pdf},
  doi={10.1007/3-540-45708-9_8},
  author={Jesper Buus Nielsen},
  year=2002
}