Instance-hiding interactive proofs (extended abstract)
From MaRDI portal
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Algebraic methods for interactive proof systems
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Collision-resistance from multi-collision-resistance
- Cryptography in constant parallel time
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- scientific article; zbMATH DE number 503260 (Why is no real title available?)
- scientific article; zbMATH DE number 697825 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- IP = PSPACE
- On distributional collision resistant hashing
- On hiding information from an oracle
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages
- On relationships between statistical zero-knowledge proofs
- On the Composition of Zero-Knowledge Proof Systems
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Some consequences of non-uniform conditions on uniform classes
- Statistical randomized encodings: a complexity theoretic view
- Statistical zero-knowledge languages can be recognized in two rounds
- The Discrete Logarithm problem with preprocessing
- The Knowledge Complexity of Interactive Proof Systems
This page was built for publication: Instance-hiding interactive proofs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955047)
