Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
From MaRDI portal
Publication:3408214
DOI10.1007/978-3-642-11799-2_32zbMath1274.94102OpenAlexW1590101058MaRDI QIDQ3408214
Ivan Visconti, Rafail Ostrovsky, Omkant Pandey
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
Related Items (8)
Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ On constant-round concurrent non-malleable proof systems ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resettable zero-knowledge (extended abstract)
- On the Necessary and Sufficient Assumptions for UC Computation
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- New and improved constructions of non-malleable cryptographic protocols
- Efficient Zero Knowledge on the Internet
- Perfect Non-interactive Zero Knowledge for NP
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Foundations of Cryptography
- The knowledge complexity of interactive proof-systems
- Nonmalleable Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Revisiting the Efficiency of Malicious Two-Party Computation
- Concurrent Non-malleable Commitments from Any One-Way Function
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Automata, Languages and Programming
- Public Key Cryptography - PKC 2006
- Theory of Cryptography
This page was built for publication: Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
