How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge-Reference-Cited by-同舟云学术

How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge

Published: Issue: Volume: Page:89-106
ISSN:
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Malka Lior

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78524-8_6.pdf

Reference33 articles.

1. Aiello, W., Håstad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. of Computer and System Sciences 42(3), 327–345 (1991)

2. Babai, L., Moran, S.: Arthur-merlin games: A randomized proof system and a hierarchy of complexity classes. J. of Computer and System Sciences 36, 254–276 (1988)

3. Bellare, M., Rogaway, P.: Noninteractive perfect zero-knowledge. Unpublished manuscript (June 1990)

4. Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the ICM, pp. 1444–1451 (1986)

5. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge proofs and their applications. In: Proceedings of the 20th STOC, ACM, New York (1988)

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

1. Super-Perfect Zero-Knowledge Proofs;Lecture Notes in Computer Science;2020

2. On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs;Theory of Cryptography;2017

3. A framework for non-interactive instance-dependent commitment schemes (NIC);Theoretical Computer Science;2015-08

4. Complete Problem for Perfect Zero-Knowledge Quantum Proof;SOFSEM 2012: Theory and Practice of Computer Science;2012