Resettable cryptography in constant rounds -- the case of zero knowledge

DOI10.1007/978-3-642-25385-0_21MaRDI QIDQ3102198zbMATH OpenOpenAlexFDO

Authors Yi Deng, Dengguo Feng, Vipul Goyal, Amit Sahai, Dongdai Lin, Moti Yung

Publication date 2 December 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25385-0_21

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Resettable zero-knowledge (extended abstract)
• Resettably-sound resettable zero knowledge in constant rounds
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Nearly simultaneously resettable black-box zero knowledge
• scientific article; zbMATH DE number 1722687

Cited in

(5)

• Individual simulations
• Concurrent knowledge extraction in public-key models
• Nearly simultaneously resettable black-box zero knowledge
• Resettably Secure Computation
• scientific article; zbMATH DE number 1955784 (Why is no real title available?)

This page was built for publication: Resettable cryptography in constant rounds -- the case of zero knowledge

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