Definitions and properties of zero-knowledge proof systems

By Oded Goldreich, Yair Oren. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, background): “This kind of proofs validate a statement without revealing any secret related to it [245].”
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services (2017, result): “Note that given some well known impossibility results [30, 31], the notion of ZK obtained in this case is somewhat weak (ZK does not hold with respect to arbitrary auxiliary inputs the verifier might have).”
Short Pairing-Based Non-interactive Zero-Knowledge Arguments (2010, background): “Unfortunately, only languages in BPP have NIZK proofs in the plain model without any setup [22,21].”
How To Simulate It - A Tutorial on the Simulation Proof Technique (2016, methodology): “For the sake of this tutorial, we will only consider black-box zero knowledge [23, 17], where the simulator receives only oracle access to the verifier.”
Survey on Federated Learning Threats: concepts, taxonomy on attacks and defences, experimental study and challenges (2022, methodology): “It provides multiple cryptographic primitives which allows for secure computations such as Secret Sharing [135], Zero Knowledge Proofs [136] and Garbled Circuits [137].”