Concurrent zero-knowledge

DOI10.1145/1039488.1039489zbMath1125.94031OpenAlexW2036788199WikidataQ56270786 ScholiaQ56270786MaRDI QIDQ5435668

Moni Naor, Cynthia Dwork, Amit Sahai

Publication date: 14 January 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1039488.1039489

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ On the concurrent composition of quantum zero-knowledge ⋮ Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions ⋮ Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation ⋮ Unconditionally anonymous ring and mesh signatures ⋮ Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ DSH: Deniable Secret Handshake Framework ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Partial fairness in secure two-party computation ⋮ Public-coin parallel zero-knowledge for NP ⋮ Turn-based communication channels ⋮ A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks ⋮ Possibility and impossibility results for selective decommitments ⋮ Concurrent zero knowledge, revisited ⋮ Timed encryption with application to deniable key exchange ⋮ A convertible multi-authenticated encryption scheme for group communications ⋮ Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms ⋮ Efficient verifiable delay functions ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ General composition and universal composability in secure multiparty computation ⋮ New approaches for deniable authentication ⋮ Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments