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

DOI10.1007/978-3-642-25385-0_21zbMATH Open1227.94041OpenAlexW1567016883MaRDI QIDQ3102198FDOQ3102198

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (4)

• Title not available (Why is that?)
• Concurrent knowledge extraction in public-key models
• Resettably Secure Computation
• Individual simulations

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)