scientific article; zbMATH DE number 1418312

zbMath0942.68046MaRDI QIDQ4941874

Amit Sahai, Oded Goldreich, Salil P. Vadhan

Publication date: 27 August 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

non-interactive zero-knowledge proofsstatistical zero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Complete Problem for Perfect Zero-Knowledge Quantum Proof, Minimum Circuit Size, Graph Isomorphism, and Related Problems, Statistical difference beyond the polarizing regime, Super-Perfect Zero-Knowledge Proofs, Unnamed Item, Public-key encryption from homogeneous CLWE, On the Power of Statistical Zero Knowledge, Cryptographic hardness under projections for time-bounded Kolmogorov complexity, SZK proofs for black-box group problems, Perfect Non-interactive Zero Knowledge for NP, Minimum Circuit Size, Graph Isomorphism, and Related Problems, How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge, An Equivalence Between Zero Knowledge and Commitments, On the relationship between statistical zero-knowledge and statistical randomized encodings, How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge, The Complexity of Zero Knowledge, On the Complexity of Computational Problems Regarding Distributions, Unnamed Item, On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings, Communication Complexity of Statistical Distance, The complexity of estimating min-entropy