On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Universal classes of hash functions
Cryptography in constant parallel time
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Foundations of Cryptography
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
The complexity of promise problems with applications to public-key cryptography
The Knowledge Complexity of Interactive Proof Systems
Statistical zero-knowledge languages can be recognized in two rounds
A complete problem for statistical zero knowledge
Computationally private randomizing polynomials and their applications
Randomly Encoding Functions: A New Cryptographic Paradigm
Cryptography in $NC^0$
Unconditional Characterizations of Non-interactive Zero-Knowledge
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
A minimal model for secure computation (extended abstract)
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
Noninteractive Zero-Knowledge
An Equivalence Between Zero Knowledge and Commitments
On relationships between statistical zero-knowledge proofs
The random oracle hypothesis is false
Necessary and sufficient conditions for collision-free hashing
Minimizing locality of one-way functions via semi-private randomized encodings
Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19--21, 2008. Proceedings
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

Cited In (9)

New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
On relationships between statistical zero-knowledge proofs
On the relationship between statistical zero-knowledge and statistical randomized encodings
Statistical zero-knowledge languages can be recognized in two rounds
Statistical zero knowledge and quantum one-way functions
Fine-Grained Cryptography
On the complexity of collision resistant hash functions: new and old black-box separations
Quantum advantage from one-way functions
Garbled Circuits as Randomized Encodings of Functions: a Primer

This page was built for publication: On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829956)