Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems-Reference-Cited by-同舟云学术

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Published:1991-07 Issue:3 Volume:38 Page:690-728
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Goldreich Oded¹,Micali Silvio²,Wigderson Avi³

Affiliation:

1. Technion, Haifa, Israel

2. Massachusetts Institute of Technology, Cambridge

3. Hebrew Univ., Jerusalem, Israel

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference63 articles.

1. RSA and Rabin Functions: Certain Parts are as Hard as the Whole

2. ALON N. GALIL Z. AND YUNG M. A fully polynomial simultaneous broadcast in the presence of faults. Unpublished manuscript 1985. ALON N. GALIL Z. AND YUNG M. A fully polynomial simultaneous broadcast in the presence of faults. Unpublished manuscript 1985.

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

1. Scalability meets regulation: UTXO-based sharding and zero-knowledge proofs for regulated digital currencies;Cluster Computing;2024-02-06

2. Authentication, Authorization, Access Control, and Key Exchange in Internet of Things;ACM Transactions on Internet of Things;2024-02-03

3. A Blockchain-Based Trustworthy Access Control Scheme for Medical Data Sharing;IET Information Security;2024-01-31

4. Experimental implementation of an efficient test of quantumness;Physical Review A;2024-01-09

5. Logarithmic-Size (Linkable) Ring Signatures from Lattice Isomorphism Problems;Security, Privacy, and Applied Cryptography Engineering;2024