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

DOI10.1007/978-3-319-78375-8_17zbMATH Open1428.94060OpenAlexW2794717746MaRDI QIDQ1648849FDOQ1648849

Authors: 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

Recommendations

• On multiparty garbling of arithmetic circuits
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Round optimal secure multiparty computation from minimal assumptions
• scientific article; zbMATH DE number 1030985
• Round-optimal and communication-efficient multiparty computation
• Topics in Cryptology – CT-RSA 2006
• A new efficient protocol for \(k\)-out-of-\(n\) oblivious transfer
• Efficient \(k\)-out-of-\(n\) oblivious transfer schemes

Mathematics Subject Classification ID

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

Cited In (59)

• Broadcast-optimal four-round MPC in the plain model
• 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
• Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
• Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
• R3PO: reach-restricted reactive program obfuscation and its applications
• Two-round maliciously-secure oblivious transfer with optimal rate
• The round complexity of statistical MPC with optimal resiliency
• mrNISC from LWE with polynomial modulus
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• On non-uniform security for black-box non-interactive CCA commitments
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Post-quantum multi-party computation
• Offline witness encryption with semi-adaptive security
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Reusable two-round MPC from LPN
• Broadcast-optimal two-round MPC
• Efficient laconic cryptography from learning with errors
• On actively-secure elementary MPC reductions
• On the exact round complexity of secure three-party computation
• Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
• What security can we achieve within 4 rounds?
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• Round-optimal secure multi-party computation
• Minicrypt primitives with algebraic structure and applications
• Perfect secure computation in two rounds
• Two-round MPC: information-theoretic and black-box
• Two-round adaptively secure multiparty computation from standard assumptions
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Perfect secure computation in two rounds
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• On the round complexity of black-box secure MPC
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Concurrently composable non-interactive secure computation
• Round-optimal and communication-efficient multiparty computation
• Efficient and tight oblivious transfer from PKE with tight multi-user security
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Low cost constant round MPC combining BMR and oblivious transfer
• Multiparty reusable non-interactive secure computation from LWE
• Unbounded multi-party computation from learning with errors
• Towards accountability in CRS generation
• Round-optimal oblivious transfer and MPC from computational CSIDH
• Two-round oblivious transfer from CDH or LPN
• From FE combiners to secure MPC and back
• BETA: biometric-enabled threshold authentication
• Reverse firewalls for actively secure MPCs
• Laconic private set intersection and applications
• Oblivious transfer from trapdoor permutations in minimal rounds
• 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?
• Two-round maliciously secure computation with super-polynomial simulation
• Optimal bounded-collusion secure functional encryption
• SCALES. MPC with small clients and larger ephemeral servers
• mrNISC from LWE with polynomial modulus
• On communication models and best-achievable security in two-round MPC
• Minimizing setup in broadcast-optimal two round MPC
• Founding Cryptography on Oblivious Transfer – Efficiently

This page was built for publication: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

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