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

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

Cited in

(59)

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

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)