Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.94347OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428127

Boaz Barak, Shien Jin Ong, Salil P. Vadhan

Publication date: 28 November 2007

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

Full work available at URL: https://doi.org/10.1007/b11817

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (18)

Precise zero-knowledge arguments with poly-logarithmic efficiency ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Explainable arguments ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ (Nondeterministic) hardness vs. non-malleability ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ On constant-round concurrent non-malleable proof systems ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Lower bounds for non-black-box zero knowledge ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Towards accountability in CRS generation ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: Advances in Cryptology - CRYPTO 2003