Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way

DOI10.1007/978-3-662-46494-6_15MaRDI QIDQ5261636zbMATH OpenOpenAlexFDO

Authors Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramanian

Publication date 6 July 2015

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

Full work available at URL https://doi.org/10.1007/978-3-662-46494-6_15

zbMATH Keywords

zero-knowledgeone-way function (OWF)

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• 4-round resettably-sound zero knowledge
• Non-black-box simulation from one-way functions and applications to resettable security
• Resettably-sound resettable zero knowledge in constant rounds
• Non-black-box simulation from one-way functions and applications to resettable security
• Non-black-box simulation in the fully concurrent setting

Cited in

(14)

• Minicrypt primitives with algebraic structure and applications
• Resettable statistical zero-knowledge for NP
• Non-black-box simulation from one-way functions and applications to resettable security
• Sublinear zero-knowledge arguments for RAM programs
• Round optimal black-box ``commit-and-prove
• Resettably-sound resettable zero knowledge in constant rounds
• Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
• On the Power of Secure Two-Party Computation
• Towards a unified approach to black-box constructions of zero-knowledge proofs
• 4-round resettably-sound zero knowledge
• Unbounded ABE via bilinear entropy expansion, revisited
• On the power of secure two-party computation
• Post-quantum resettably-sound zero knowledge
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph

This page was built for publication: Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way

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