Theory of Cryptography
From MaRDI portal
Publication:5898639
DOI10.1007/11681878zbMath1112.94017OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898639
Shien Jin Ong, Daniele Micciancio, Salil P. Vadhan, Amit Sahai
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Related Items (8)
Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer ⋮ SZK proofs for black-box group problems ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ An Equivalence Between Zero Knowledge and Commitments ⋮ The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
This page was built for publication: Theory of Cryptography
