How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract)-Reference-Cited by-同舟云学术

How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract)

Published: Issue: Volume: Page:171-185
ISSN:
Container-title:Advances in Cryptology — CRYPTO’ 86
language:
Short-container-title:

Author:

Goldreich Oded,Micali Silvio,Wigderson Avi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47721-7_11.pdf

Reference37 articles.

1. Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Co., 1974.

2. Alexi, W., B. Chor, O. Goldreich, and C.P. Schnorr, “RSA and Rabin Functions: Certain Parts Are As Hard As The Whole”, to appear in SIAM Jour. on Computing. Extended Abstract in Proc. 25th FOCS, 1984.

3. Alon, N., Z. Galil, and M. Yung, “A Fully Polynomial Simultaneous Broadcast in the Presence of Faults”, preprint, 1985.

4. Babai, L., “Trading Group Theory for Randomness”, Proc. 17th STOC, 1985, pp. 421–429.

5. Benaloh, (Cohen) J.D., “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret”, these proceedings.

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

1. Commitments to Quantum States;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Sigma Protocols from Verifiable Secret Sharing and Their Applications;Advances in Cryptology – ASIACRYPT 2023;2023

3. Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions;Advances in Cryptology – CRYPTO 2023;2023

4. The Power of Undirected Rewindings for Adaptive Security;Advances in Cryptology – CRYPTO 2023;2023

5. Succinct Interactive Oracle Proofs: Applications and Limitations;Advances in Cryptology – CRYPTO 2022;2022