Simultaneously resettable arguments of knowledge

DOI10.1007/978-3-642-28914-9_30zbMATH Open1296.94101OpenAlexW185553MaRDI QIDQ2891504FDOQ2891504

Authors Chongwon Cho, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti

Publication date 15 June 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-28914-9_30

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Resettably-sound resettable zero knowledge in constant rounds
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Resettable zero-knowledge (extended abstract)
• 4-round resettably-sound zero knowledge

Cited in

(6)

• Concurrent non-malleable commitments (and more) in 3 rounds
• Concurrent knowledge extraction in public-key models
• Resettable statistical zero-knowledge for NP
• On non-black-box simulation and the impossibility of approximate obfuscation
• On the existence of extractable one-way functions
• Post-quantum resettably-sound zero knowledge

This page was built for publication: Simultaneously resettable arguments of knowledge

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