On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
From MaRDI portal
Publication:2829956
DOI10.1007/978-3-662-53015-3_16zbMath1406.94020OpenAlexW2405108849MaRDI QIDQ2829956
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_16
Related Items (5)
On the complexity of collision resistant hash functions: new and old black-box separations ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ Fine-Grained Cryptography ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptography in constant parallel time
- Statistical zero-knowledge languages can be recognized in two rounds
- Universal classes of hash functions
- The random oracle hypothesis is false
- Minimizing locality of one-way functions via semi-private randomized encodings
- Necessary and sufficient conditions for collision-free hashing
- On relationships between statistical zero-knowledge proofs
- Computationally private randomizing polynomials and their applications
- Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19--21, 2008. Proceedings
- 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
- Randomly Encoding Functions: A New Cryptographic Paradigm
- A complete problem for statistical zero knowledge
- The complexity of promise problems with applications to public-key cryptography
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- The Knowledge Complexity of Interactive Proof Systems
- Noninteractive Zero-Knowledge
- Foundations of Cryptography
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- An Equivalence Between Zero Knowledge and Commitments
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Cryptography in $NC^0$
This page was built for publication: On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
