On the Composition of Public-Coin Zero-Knowledge Protocols
From MaRDI portal
Recommendations
Cited in
(14)- Public-coin parallel zero-knowledge for NP
- Publicly verifiable zero knowledge from (collapsing) blockchains
- On the concurrent composition of quantum zero-knowledge
- Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
- Non-black-box simulation in the fully concurrent setting, revisited
- Non-black-box simulation from one-way functions and applications to resettable security
- Interactive oracle proofs
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages
- An efficient parallel repetition theorem
- Private coins versus public coins in zero-knowledge proof systems
- On the Composition of Zero-Knowledge Proof Systems
- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
- On the composition of public-coin zero-knowledge protocols
- Resettable statistical zero-knowledge for NP
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)