Concurrently secure computation in constant rounds

DOI10.1007/978-3-642-29011-4_8MaRDI QIDQ2894403zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai

Publication date 29 June 2012

Published in Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29011-4_8

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Round optimal concurrent MPC via strong simulation
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Protocols for bounded-concurrent secure two-party computation in the plain model
• A new approach to black-box concurrent secure computation

Cited in

(20)

• On the exact round complexity of self-composable two-party computation
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• On the Necessity of Rewinding in Secure Multiparty Computation
• Round-optimal black-box secure computation from two-round malicious OT
• Concurrent secure computation with optimal query complexity
• One-message zero knowledge and non-malleable commitments
• Round optimal concurrent MPC via strong simulation
• Constant-round linear-broadcast secure computation with penalties
• Two-round concurrent 2PC from sub-exponential LWE
• Maliciously-secure MrNISC in the plain model
• Constant round adaptively secure protocols in the tamper-proof hardware model
• 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
• Concurrently composable security with shielded super-polynomial simulators
• Concurrent secure computation via non-black box simulation
• On concurrently secure computation in the multiple ideal query model
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• 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: Concurrently secure computation in constant rounds

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