Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model

DOI10.1007/978-3-540-70583-3_45zbMath1155.94379OpenAlexW1500572009MaRDI QIDQ3519532

Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_45

zbMATH Keywords

witness indistinguishabilitynon-malleable zero knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Non-malleable functions and their applications ⋮ Concurrent knowledge extraction in public-key models ⋮ Impossibility of Black-Box Simulation Against Leakage Attacks ⋮ On constant-round concurrent non-malleable proof systems ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ Co-sound Zero-Knowledge with Public Keys ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ On the Necessary and Sufficient Assumptions for UC Computation ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resettable zero-knowledge (extended abstract)
• New and improved constructions of non-malleable cryptographic protocols
• Efficient Zero Knowledge on the Internet
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Nonmalleable Cryptography
• Advances in Cryptology – CRYPTO 2004
• Automata, Languages and Programming

This page was built for publication: Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model