On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

DOI10.1007/978-3-319-13039-2_5zbMath1344.94050arXiv1210.3719OpenAlexW2103286324MaRDI QIDQ2945373

Divya Gupta, Amit Sahai

Publication date: 10 September 2015

Published in: Progress in Cryptology -- INDOCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3719

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (7)

Toward RSA-OAEP Without Random Oracles ⋮ Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Unnamed Item ⋮ The hunting of the SNARK ⋮ Random walks and concurrent zero-knowledge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for concurrent zero knowledge
• Composition of secure multi-party protocols. A comprehensive study.
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Secure Two-Party Computation with Low Communication
• Impossibility Results for Static Input Secure Computation
• New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation
• On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
• Information-Theoretically Secure Protocols and Security under Composition
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• On Invertible Sampling and Adaptive Security
• Succinct NP Proofs from an Extractability Assumption
• Extractable Perfectly One-Way Functions
• Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
• Perfect NIZK with Adaptive Soundness
• Towards a Theory of Extractable Functions
• Statistically Hiding Sets
• The Knowledge Complexity of Interactive Proof Systems
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• On the existence of extractable one-way functions
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography

This page was built for publication: On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption