Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model

DOI10.1007/978-3-642-02882-3_14zbMath1248.94064OpenAlexW1558226165MaRDI QIDQ5323057

Giovanni Di Crescenzo

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

zero-knowledge protocolsround complexitycomplexity assumptionsconcurrent zero-knowledgebare public-key model

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

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
• Bit commitment using pseudorandomness
• 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
• On Monotone Formula Composition of Perfect Zero-Knowledge Languages
• Efficient Zero Knowledge on the Internet
• 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
• The Knowledge Complexity of Interactive Proof Systems
• A Pseudorandom Generator from any One-way Function
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Advances in Cryptology – CRYPTO 2004
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Zaps and Their Applications
• Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
• Automata, Languages and Programming

This page was built for publication: Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model