Nearly simultaneously resettable black-box zero knowledge

DOI10.1007/978-3-642-31594-7_8MaRDI QIDQ2843238zbMATH OpenOpenAlexFDO

Authors Joshua Baron, Rafail Ostrovsky, Ivan Visconti

Publication date 12 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31594-7_8

zbMATH Keywords

black-box simulationreset attacks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Resettable zero-knowledge (extended abstract)
• Resettable cryptography in constant rounds -- the case of zero knowledge
• Non-black-box simulation in the fully concurrent setting
• Lower bounds for non-black-box zero knowledge
• Resettably Secure Computation

Cited in

(6)

• Post-quantum resettably-sound zero knowledge
• Resettable cryptography in constant rounds -- the case of zero knowledge
• Impossibility of black-box simulation against leakage attacks
• Resettably Secure Computation
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Resettable statistical zero-knowledge for NP

This page was built for publication: Nearly simultaneously resettable black-box zero knowledge

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