Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model

DOI10.1007/978-3-642-03351-3_10zbMath1248.94063OpenAlexW1576798452MaRDI QIDQ3392944

Giovanni Di Crescenzo, Dengguo Feng, Yi Deng, Dong-Dai Lin

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_10

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (3)

Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Efficient signature generation by smart cards
• How to construct constant-round zero-knowledge proof systems for NP
• Resettable zero-knowledge (extended abstract)
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• 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
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• Nonmalleable Cryptography
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Automata, Languages and Programming
• Theory of Cryptography

This page was built for publication: Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model