\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

DOI10.1007/978-3-319-78375-8_17zbMath1428.94060OpenAlexW2794717746MaRDI QIDQ1648849

Fabrice Benhamouda, Huijia Lin

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_17

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ On the round complexity of black-box secure MPC ⋮ Two-round MPC: information-theoretic and black-box ⋮ Perfect secure computation in two rounds ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Reusable Two-Round MPC from LPN ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Optimal bounded-collusion secure functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ Efficient laconic cryptography from learning with errors ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ SCALES. MPC with small clients and larger ephemeral servers ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Concurrently composable non-interactive secure computation ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Reusable secure computation in the plain model ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ On actively-secure elementary MPC reductions ⋮ On communication models and best-achievable security in two-round MPC ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Laconic private set intersection and applications ⋮ Offline witness encryption with semi-adaptive security ⋮ Perfect Secure Computation in Two Rounds ⋮ What security can we achieve within 4 rounds? ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ On the exact round complexity of secure three-party computation ⋮ Round-optimal secure multi-party computation ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Post-quantum multi-party computation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Towards accountability in CRS generation ⋮ BETA: biometric-enabled threshold authentication ⋮ Reverse firewalls for actively secure MPCs ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Two-round oblivious transfer from CDH or LPN ⋮ Broadcast-optimal two-round MPC