Resettable statistical zero knowledge

DOI10.1007/978-3-642-28914-9_28MaRDI QIDQ2891502zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia

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_28

Mathematics Subject Classification ID

Network protocols (68M12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)

Recommendations

• Resettable zero-knowledge (extended abstract)
• On relationships between statistical zero-knowledge proofs
• scientific article; zbMATH DE number 1775425
• scientific article; zbMATH DE number 1256785
• Statistical zero-knowledge languages can be recognized in two rounds

Cited in

(14)

• An improved affine equivalence algorithm for random permutations
• Abuse resistant law enforcement access systems
• Oblivious transfer from trapdoor permutations in minimal rounds
• Secret Sharing and Statistical Zero Knowledge
• On the relationship between statistical zero-knowledge and statistical randomized encodings
• Resettable zero-knowledge (extended abstract)
• Resettably Secure Computation
• On the power of statistical zero knowledge
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Predictable arguments of knowledge
• The cost of statistical security in proofs for repeated squaring
• Resettable statistical zero-knowledge for NP
• Robustness for space-bounded statistical zero knowledge
• Statistical zero-knowledge languages can be recognized in two rounds

This page was built for publication: Resettable statistical zero knowledge

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