Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma

DOI10.1007/978-3-662-46494-6_12zbMath1354.94030OpenAlexW23650548MaRDI QIDQ5261632

Amit Sahai, Vipul Goyal, Huijia Lin, Rafael Pass, Omkant Pandey

Publication date: 6 July 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_12

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Concurrently composable non-interactive secure computation ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions

This page was built for publication: Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma