On the relationship between statistical zero-knowledge and statistical randomized encodings

DOI10.1007/978-3-662-53015-3_16MaRDI QIDQ2829956zbMATH OpenOpenAlexFDO

Authors Benny Applebaum, Pavel Raykov

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the relationship between statistical zero-knowledge and statistical randomized encodings
• Statistical randomized encodings: a complexity theoretic view
• On relationships between statistical zero-knowledge proofs
• Output-compressing randomized encodings and applications
• Resettable statistical zero knowledge

Cites work

• scientific article; zbMATH DE number 1583796 (Why is no real title available?)
• scientific article; zbMATH DE number 4057439 (Why is no real title available?)
• scientific article; zbMATH DE number 1418312 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A complete problem for statistical zero knowledge
• A minimal model for secure computation (extended abstract)
• An Equivalence Between Zero Knowledge and Commitments
• Computationally private randomizing polynomials and their applications
• Cryptography in $NC^0$
• Cryptography in constant parallel time
• Efficient concurrent zero-knowledge in the auxiliary string model
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Foundations of Cryptography
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back
• Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
• Minimizing locality of one-way functions via semi-private randomized encodings
• Necessary and sufficient conditions for collision-free hashing
• Noninteractive Zero-Knowledge
• On relationships between statistical zero-knowledge proofs
• Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
• Statistical zero-knowledge languages can be recognized in two rounds
• The Knowledge Complexity of Interactive Proof Systems
• The complexity of promise problems with applications to public-key cryptography
• The random oracle hypothesis is false
• Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19--21, 2008. Proceedings
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• Universal classes of hash functions
• Zero-information protocols and unambiguity in Arthur-Merlin communication (extended abtract)

Cited in

(10)

• 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
• Garbled circuits as randomized encodings of functions: a primer
• Statistical randomized encodings: a complexity theoretic view
• 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

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)