Concurrent zero knowledge in the bounded player model

DOI10.1007/978-3-642-36594-2_4MaRDI QIDQ4910271zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti

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_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constant-round concurrent zero knowledge in the bounded player model
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Automata, Languages and Programming
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• scientific article; zbMATH DE number 1759795

Cited in

(4)

• Concurrent knowledge extraction in public-key models
• On the concurrent composition of quantum zero-knowledge
• Constant-round concurrent zero knowledge in the bounded player model
• Random walks and concurrent zero-knowledge

This page was built for publication: Concurrent zero knowledge in the bounded player model

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