Four round secure computation without setup
From MaRDI portal
Publication:1690211
DOI10.1007/978-3-319-70500-2_22zbMath1410.94052OpenAlexW2620838540MaRDI QIDQ1690211
Antigoni Polychroniadou, Zvika Brakerski, Shai Halevi
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70500-2_22
Related Items (27)
On the round complexity of secure quantum computation ⋮ On the round complexity of black-box secure MPC ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Two-message statistically sender-private OT from LWE ⋮ 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 ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ 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 and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Blockchains enable non-interactive MPC ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ What security can we achieve within 4 rounds? ⋮ On the exact round complexity of secure three-party computation ⋮ Round-optimal secure multi-party computation ⋮ Post-quantum multi-party computation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Towards accountability in CRS generation ⋮ Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS
This page was built for publication: Four round secure computation without setup
