On the composition of public-coin zero-knowledge protocols

DOI10.1137/100811465MaRDI QIDQ5895542zbMATH OpenOpenAlexFDO

Authors Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström

Publication date 15 March 2012

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/100811465

zbMATH Keywords

zero-knowledgeparallel repetitionpublic-coin interactive protocols

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the Composition of Public-Coin Zero-Knowledge Protocols
• Public-coin parallel zero-knowledge for NP
• On the Composition of Zero-Knowledge Proof Systems
• Automata, Languages and Programming
• Private coins versus public coins in zero-knowledge proof systems

Cited in

(11)

• On the Composition of Zero-Knowledge Proof Systems
• Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Private coins versus public coins in zero-knowledge proof systems
• On the Composition of Public-Coin Zero-Knowledge Protocols
• Non-black-box simulation from one-way functions and applications to resettable security
• Public-coin parallel zero-knowledge for NP
• On non-black-box simulation and the impossibility of approximate obfuscation
• Post-quantum resettably-sound zero knowledge
• Publicly verifiable zero knowledge from (collapsing) blockchains
• On the existence of extractable one-way functions

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 Q5895542)