Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
From MaRDI portal
Publication:2695641
DOI10.1007/978-3-030-90459-3_13OpenAlexW3214310125MaRDI QIDQ2695641
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_13
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum disclosure proofs of knowledge
- Definitions and properties of zero-knowledge proof systems
- Statistical witness indistinguishability (and more) in two messages
- Distinguisher-dependent simulation in two rounds and its applications
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Statistical ZAPR arguments from bilinear maps
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- On the Existence of Extractable One-Way Functions
- Barriers in cryptography with weak, correlated and leaky sources
- Magic Functions
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- The Knowledge Complexity of Interactive Proof Systems
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Foundations of Cryptography
- Nonmalleable Cryptography
- Weak zero-knowledge beyond the black-box barrier
- From Weak to Strong Zero-Knowledge and Applications
- New Techniques for Noninteractive Zero-Knowledge
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Witness encryption and its applications
