Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case-Reference-Cited by-同舟云学术

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

Published:2002 Issue: Volume: Page:111-126
ISSN:0302-9743
Container-title:Advances in Cryptology — CRYPTO 2002
language:
Short-container-title:

Author:

Nielsen Jesper Buus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45708-9_8

Reference15 articles.

1. Lect Notes Comput Sci;D. Beaver,1997

2. Manuel Blum, Paul Feldman, and Silvio Micali. Non-interactive zero-knowledge and its applications (extended abstract). In [ACM88], pages 103–112.

3. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In [ACM88], pages 1–10.

4. Lect Notes Comput Sci;D. Beaver,1992

5. 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.

Cited by 192 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Publicly Verifiable Attribute-Based Encryption and Distributed Decryption;2023 3rd International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE);2023-05-12

2. Adaptively Secure MPC with Sublinear Communication Complexity;Journal of Cryptology;2023-03-22

3. Composable Oblivious Pseudo-random Functions via Garbled Circuits;Progress in Cryptology – LATINCRYPT 2023;2023

4. Synchronizable Fair Exchange;Theory of Cryptography;2023

5. CASE: A New Frontier in Public-Key Authenticated Encryption;Theory of Cryptography;2023