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

DOI10.1007/978-3-662-46494-6_12MaRDI QIDQ5261632zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Adaptively secure, universally composable, multiparty computation in constant rounds
• Concurrently secure computation in constant rounds
• The Exact Round Complexity of Secure Computation
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• The round complexity of secure computation against covert adversaries
• Concurrently composable non-interactive secure computation
• A new approach to round-optimal secure multiparty computation
• Round-efficient black-box construction of composable multi-party computation
• Round-efficient black-box construction of composable multi-party computation

Cited in

(16)

• On the exact round complexity of self-composable two-party computation
• Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
• Composable long-term security with rewinding
• Concurrently secure computation in constant rounds
• Two-round concurrent 2PC from sub-exponential LWE
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Round-efficient composable two-party quantum computation
• Improved black-box constructions of composable secure computation
• Concurrently composable non-interactive secure computation
• Adaptive hardness and composable security in the plain model from standard assumptions
• Magic adversaries versus individual reduction: science wins either way
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Concurrently composable security with shielded super-polynomial simulators
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261632)