A new approach to round-optimal secure multiparty computation
From MaRDI portal
Publication:1675737
DOI10.1007/978-3-319-63688-7_16zbMath1407.94071OpenAlexW2621249775MaRDI QIDQ1675737
Abhishek Jain, Arka Rai Choudhuri, Prabhanjan V. Ananth
Publication date: 3 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_16
Related Items (20)
On the round complexity of secure quantum computation ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ On the round complexity of black-box secure MPC ⋮ Round-optimal multi-party computation with identifiable abort ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ From FE combiners to secure MPC and back ⋮ Maliciously-secure MrNISC in the plain model ⋮ Statistical security in two-party computation revisited ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Round-optimal black-box MPC in the plain model ⋮ Reusable secure computation in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ What security can we achieve within 4 rounds? ⋮ On the exact round complexity of secure three-party computation ⋮ Round-optimal secure multi-party computation ⋮ Towards accountability in CRS generation ⋮ Reverse firewalls for actively secure MPCs
This page was built for publication: A new approach to round-optimal secure multiparty computation
