Efficiency preserving transformations for concurrent non-malleable zero knowledge

DOI10.1007/978-3-642-11799-2_32MaRDI QIDQ3408214zbMATH OpenOpenAlexFDO

Authors Rafail Ostrovsky, Omkant Pandey, Ivan Visconti

Publication date 24 February 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-11799-2_32

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Concurrent non-malleable zero knowledge proofs
• Statistical concurrent non-malleable zero knowledge
• On the concurrent composition of zero-knowledge proofs
• Efficient Zero Knowledge on the Internet
• Simulatable commitments and efficient concurrent zero-knowledge

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Concurrent Non-malleable Commitments from Any One-Way Function
• Concurrent zero knowledge in the public-key model
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Efficient Zero Knowledge on the Internet
• Foundations of Cryptography
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks
• New and improved constructions of non-malleable cryptographic protocols
• Non-interactive and information-theoretic secure verifiable secret sharing
• Nonmalleable Cryptography
• On the concurrent composition of zero-knowledge proofs
• On the necessary and sufficient assumptions for UC computation
• Perfect Non-interactive Zero Knowledge for NP
• Public Key Cryptography - PKC 2006
• Resettable zero-knowledge (extended abstract)
• Revisiting the Efficiency of Malicious Two-Party Computation
• Robust non-interactive zero knowledge
• Simulatable commitments and efficient concurrent zero-knowledge
• Simulatable VRFs with Applications to Multi-theorem NIZK
• Strengthening zero-knowledge protocols using signatures
• The knowledge complexity of interactive proof-systems
• Theory of Cryptography

Cited in

(11)

• On constant-round concurrent non-malleable proof systems
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Non-malleable time-lock puzzles and applications
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Improved OR-composition of sigma-protocols
• Expedient Non-malleability Notions for Hash Functions
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Statistical concurrent non-malleable zero knowledge
• A new approach to efficient non-malleable zero-knowledge
• Improved black-box constructions of composable secure computation
• Four-round statistical non-malleable zero-knowledge

This page was built for publication: Efficiency preserving transformations for concurrent non-malleable zero knowledge

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