Definitions and properties of zero-knowledge proof systems

DOI10.1007/BF00195207zbMath0791.94010MaRDI QIDQ1324756

Publication date: 24 July 1994

Published in: Journal of Cryptology (Search for Journal in Brave)

computational complexity zero-knowledge proofs computational indistinguishability auxiliary- input blackbox-simulation cryptographic composition of protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

On QA-NIZK in the BPK Model, The graph clustering problem has a perfect zero-knowledge interactive proof, One-message zero knowledge and non-malleable commitments, Round-optimal fully black-box zero-knowledge arguments from one-way permutations, Probabilistic proof systems — A survey, Two-message statistically sender-private OT from LWE, Pattern matching on encrypted streams, Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge, 3-Message Zero Knowledge Against Human Ignorance, Formal verification of fair exchange based on Bitcoin smart contracts, Random oracles and non-uniformity, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Spatial Isolation Implies Zero Knowledge Even in a Quantum World, Round-optimal zero-knowledge proofs of knowledge for NP, Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions, Randomness-efficient non-interactive zero knowledge, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Secure electronic bills of lading: Blind counts and digital signatures, Cryptographic algorithms for privacy-preserving online applications, On sequential composition of precise zero-knowledge, How to deal with malicious users in privacy‐preserving distributed data mining, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, Maliciously-secure MrNISC in the plain model, On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles, Algebraic restriction codes and their applications, On the impossibility of cryptography with tamperable randomness, NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion, Indistinguishable Proofs of Work or Knowledge, NIZK from SNARGs, Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract), mrNISC from LWE with polynomial modulus, Concurrently composable non-interactive secure computation, Existence of 3-round zero-knowledge proof systems for NP, Multikey Fully Homomorphic Encryption and Applications, Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash, \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions, Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG, Smooth zero-knowledge hash functions, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, Which languages have 4-round zero-knowledge proofs?, A new approach to efficient non-malleable zero-knowledge, Universal ring signatures in the standard model, The hunting of the SNARK, Universally composable symbolic security analysis, Public-coin parallel zero-knowledge for NP, The round complexity of quantum zero-knowledge, Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness, Statistical ZAPs from group-based assumptions, Two-round maliciously secure computation with super-polynomial simulation, On communication models and best-achievable security in two-round MPC, Leakproof secret sharing protocols with applications to group identification scheme, Oblivious transfer from trapdoor permutations in minimal rounds, Verifiable functional encryption using Intel SGX, Non-interactive secure computation from one-way functions, Cryptography and cryptographic protocols, A language-dependent cryptographic primitive, The Knowledge Complexity of Interactive Proof Systems, A uniform-complexity treatment of encryption and zero-knowledge, Predictable Arguments of Knowledge, Lower bounds for non-black-box zero knowledge, On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits, A Framework for Constructing Convertible Undeniable Signatures, Parallel and Concurrent Security of the HB and HB + Protocols, Multi-theorem preprocessing NIZKs from lattices, Parallel and concurrent security of the HB and \(HB^{+}\) protocols, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, On subversion-resistant SNARKs, The Complexity of Zero Knowledge, Cryptography in the multi-string model, Compact designated verifier NIZKs from the CDH assumption without pairings, Compact NIZKs from standard assumptions on bilinear maps, Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?, Statistical ZAPR arguments from bilinear maps, Statistical Zaps and new oblivious transfer protocols, Round-optimal blind signatures in the plain model from classical and quantum standard assumptions, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, Towards accountability in CRS generation, Handling expected polynomial-time strategies in simulation-based security proofs, New RSA-Based (Selectively) Convertible Undeniable Signature Schemes, Practical Fault-Tolerant Data Aggregation, On the Existence of Extractable One-Way Functions, Two-Message, Oblivious Evaluation of Cryptographic Functionalities, Composition of Zero-Knowledge Proofs with Efficient Provers, (Commit-and-prove) predictable arguments with privacy, New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust, Non-interactive zero-knowledge arguments for QMA, with preprocessing, How to Simulate It – A Tutorial on the Simulation Proof Technique, QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge, Weak Zero-Knowledge beyond the Black-Box Barrier, Succinct non-interactive secure computation

Cites Work