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

Jesper Buus Nielsen. Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings. Volume 2442 of Lecture Notes in Computer Science, pages 111-126, Springer, 2002. [doi]

Abstract

Abstract is missing.