Non-malleable zero knowledge: black-box constructions and definitional relationships

DOI10.1007/978-3-319-10879-7_25MaRDI QIDQ2922674zbMATH OpenOpenAlexFDO

Authors Abhishek Jain, Omkant Pandey

Publication date 14 October 2014

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

Full work available at URL https://doi.org/10.1007/978-3-319-10879-7_25

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Statistical concurrent non-malleable zero knowledge
• Concurrent non-malleable zero knowledge proofs
• New and improved constructions of non-malleable cryptographic protocols
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Statistical concurrent non-malleable zero-knowledge from one-way functions

Cited in

(13)

• A black-box construction of non-malleable encryption from semantically secure encryption
• An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Statistical concurrent non-malleable zero knowledge
• Witness-succinct universally-composable SNARKs
• Spartan and bulletproofs are simulation-extractable (for free!)
• A new approach to efficient non-malleable zero-knowledge
• How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
• Black-box (and fast) non-malleable zero knowledge
• Improved black-box constructions of composable secure computation
• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
• Unclonable commitments and proofs
• Four-round statistical non-malleable zero-knowledge

This page was built for publication: Non-malleable zero knowledge: black-box constructions and definitional relationships

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