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

DOI10.1007/978-3-662-53015-3_16zbMATH Open1406.94020OpenAlexW2405108849MaRDI QIDQ2829956FDOQ2829956

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Universal classes of hash functions
• Title not available (Why is that?)
• Cryptography in constant parallel time
• Efficient concurrent zero-knowledge in the auxiliary string model
• 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. (Invited talk)
• 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
• Title not available (Why is that?)
• Necessary and sufficient conditions for collision-free hashing
• Minimizing locality of one-way functions via semi-private randomized encodings
• Title not available (Why is that?)
• 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 (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
• 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
• 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)