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

DOI10.1007/978-3-642-03351-3_10zbMATH Open1248.94063OpenAlexW1576798452MaRDI QIDQ3392944FDOQ3392944

Authors: Yi Deng, Giovanni Di Crescenzo, Dengguo Feng, Dongdai 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

Recommendations

• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Automata, Languages and Programming
• On round-optimal zero knowledge in the bare public-key model
• Concurrent non-malleable zero knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Cites Work

• Title not available (Why is that?)
• 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)
• Efficient concurrent zero-knowledge in the auxiliary string model
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Efficient Zero Knowledge on the Internet
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Title not available (Why is that?)
• Foundations of Cryptography
• Nonmalleable Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Automata, Languages and Programming
• The Knowledge Complexity of Interactive Proof Systems
• Title not available (Why is that?)
• New and improved constructions of non-malleable cryptographic protocols
• Advances in Cryptology – CRYPTO 2004
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Theory of Cryptography
• Title not available (Why is that?)
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Title not available (Why is that?)

Cited In (9)

• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Impossibility results for universal composability in public-key models and with fixed inputs
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Automata, Languages and Programming
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• A black-box construction of non-malleable encryption from semantically secure encryption

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

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