On the relationship between statistical zero-knowledge and statistical randomized encodings
From MaRDI portal
Publication:2281251
DOI10.1007/s00037-018-0170-xzbMath1454.94042OpenAlexW2888278649WikidataQ129359783 ScholiaQ129359783MaRDI QIDQ2281251
Publication date: 19 December 2019
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-018-0170-x
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of statistical zero-knowledge proofs (to appear)
- Cryptography in constant parallel time
- Statistical zero-knowledge languages can be recognized in two rounds
- Universal classes of hash functions
- Zero-knowledge authentication scheme with secret key exchange
- The random oracle hypothesis is false
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- 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
- A minimal model for secure computation (extended abstract)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
- Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication
- Statistical Randomized Encodings: A Complexity Theoretic View
- 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
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Garbled Circuits as Randomized Encodings of Functions: a Primer
- 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
This page was built for publication: On the relationship between statistical zero-knowledge and statistical randomized encodings
