Low communication 2-prover zero-knowledge proofs for NP-Reference-Cited by-同舟云学术

Low communication 2-prover zero-knowledge proofs for NP

Published: Issue: Volume: Page:215-227
ISSN:
Container-title:Advances in Cryptology — CRYPTO’ 92
language:
Short-container-title:

Author:

Dwork Cynthia,Feige Uri,Kilian Joe,Naor Moni,Safra Muli

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48071-4_15.pdf

Reference19 articles.

1. N. Alon, J. H. Spencer, The Probabilistic Method, John Wiley & Sons, New-York, 1992.

2. S. Arora, C. Lund, R. Motwani, M. Szegedy and M. Sudan, Proof Verification and the Hardness of Approximations, Proc. 33rd IEEE Symp. on Foundation of Computer Science, 1992, to appear.

3. S. Arora and M. Safra Probabilistic Checking of Proofs Proc. 33rd IEEE Symp. on Foundation of Computer Science, 1992, to appear.

4. L. Babai, L. Fortnow, L. Levin and M. Szegedy Checking Computations in Polylogarithmic Time Proc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 21–31.

5. L. Babai, L. Fortnow, C. Lund, Non-Deterministic. Exponential Time has Two-Prover Interactive Protocols, Proc. 31st IEEE Symp. on Foundation of Computer Science, 1990, pp. 16–25.

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

1. A survey on scalable consensus algorithms for blockchain technology;Cyber Security and Applications;2025-12

2. Two Prover Perfect Zero Knowledge for MIP*;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience;Entropy;2022-07-13

4. Succinct Non-Interactive Arguments via Linear Interactive Proofs;Journal of Cryptology;2022-05-02

5. Asymptotically Quasi-Optimal Cryptography;Advances in Cryptology – EUROCRYPT 2022;2022