Theory of Cryptography

DOI10.1007/B95566zbMath1197.94175OpenAlexW2498336418MaRDI QIDQ5901768

Rafael Pass, Boaz Barak

Publication date: 14 May 2009

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (16)

Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ 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 ⋮ Verifiable functional encryption using Intel SGX ⋮ Adaptive security in SNARGs via iO and lossy functions ⋮ NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness ⋮ Cryptography in the multi-string model ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ Succinct non-interactive secure computation

This page was built for publication: Theory of Cryptography