Round optimal concurrent MPC via strong simulation
From MaRDI portal
Publication:1690214
DOI10.1007/978-3-319-70500-2_25zbMath1410.94042OpenAlexW2740195215MaRDI QIDQ1690214
Vipul Goyal, Dakshita Khurana, Saikrishna Badrinarayanan, Abhishek Jain, Amit Sahai
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70500-2_25
Related Items (13)
On the round complexity of black-box secure MPC ⋮ One-message zero knowledge and non-malleable commitments ⋮ Two-message statistically sender-private OT from LWE ⋮ Maliciously-secure MrNISC in the plain model ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Concurrently composable non-interactive secure computation ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Statistically sender-private OT from LPN and derandomization ⋮ A new framework for quantum oblivious transfer ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ What security can we achieve within 4 rounds? ⋮ Round-optimal secure multi-party computation
This page was built for publication: Round optimal concurrent MPC via strong simulation
