On the Composition of Public-Coin Zero-Knowledge Protocols
From MaRDI portal
Publication:5895112
DOI10.1007/978-3-642-03356-8_10zbMATH Open1252.94092OpenAlexW1978376352MaRDI QIDQ5895112FDOQ5895112
Authors: Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_10
Recommendations
Cited In (14)
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages
- On the Composition of Zero-Knowledge Proof Systems
- Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
- On the concurrent composition of quantum zero-knowledge
- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
- An efficient parallel repetition theorem
- Private coins versus public coins in zero-knowledge proof systems
- Interactive oracle proofs
- Non-black-box simulation from one-way functions and applications to resettable security
- On the composition of public-coin zero-knowledge protocols
- Public-coin parallel zero-knowledge for NP
- Resettable statistical zero-knowledge for NP
- Publicly verifiable zero knowledge from (collapsing) blockchains
- Non-black-box simulation in the fully concurrent setting, revisited
This page was built for publication: On the Composition of Public-Coin Zero-Knowledge Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895112)