Simple, Black-Box Constructions of Adaptively Secure Protocols

DOI10.1007/978-3-642-00457-5_23zbMath1213.94091OpenAlexW1522346171MaRDI QIDQ3611778

Seung Geol Choi, Hoeteck Wee, Dana Dachman-Soled, Tal Malkin

Publication date: 3 March 2009

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_23

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Round optimal black-box ``commit-and-prove ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Succinct arguments for RAM programs via projection codes ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Efficient one-sided adaptively secure computation ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Black-box non-interactive non-malleable commitments ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model ⋮ Oblivious transfer based on single-qubit rotations

This page was built for publication: Simple, Black-Box Constructions of Adaptively Secure Protocols