Public-Coin Concurrent Zero-Knowledge in the Global Hash Model

DOI10.1007/978-3-642-36594-2_5MaRDI QIDQ4910272zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Huijia Lin, Omer Paneth

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_5

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Automata, Languages and Programming
• On the Composition of Public-Coin Zero-Knowledge Protocols
• On the composition of public-coin zero-knowledge protocols
• Public-coin parallel zero-knowledge for NP
• Concurrent zero knowledge, revisited
• Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
• scientific article; zbMATH DE number 1775426
• Private coins versus public coins in zero-knowledge proof systems
• Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash

Cited in

(10)

• Public-coin parallel zero-knowledge for NP
• Publicly verifiable zero knowledge from (collapsing) blockchains
• Random walks and concurrent zero-knowledge
• Non-black-box simulation in the fully concurrent setting, revisited
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• 3-message zero knowledge against human ignorance
• On non-black-box simulation and the impossibility of approximate obfuscation
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Magic adversaries versus individual reduction: science wins either way
• Smooth zero-knowledge hash functions

This page was built for publication: Public-Coin Concurrent Zero-Knowledge in the Global Hash Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910272)