Two-round multiparty secure computation from minimal assumptions

Recommendations

Three-round secure multiparty computation from black-box two-round oblivious transfer
Two-round multiparty secure computation minimizing public key operations
Two-round adaptively secure multiparty computation from standard assumptions
Secure multiparty computation with minimal interaction
Two-round MPC: information-theoretic and black-box

Cited in

(76)

Quadratic multiparty randomized encodings beyond honest majority and their applications
Reusable secure computation in the plain model
Round-optimal black-box MPC in the plain model
Malicious security for SCALES. Outsourced computation with ephemeral servers
Beyond honest majority: the round complexity of fair and robust multi-party computation
SCALES. MPC with small clients and larger ephemeral servers
mrNISC from LWE with polynomial modulus
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
Two-round adaptively secure MPC from isogenies, LPN, or CDH
mrNISC from LWE with polynomial modulus
R3PO: reach-restricted reactive program obfuscation and its applications
Two-round maliciously-secure oblivious transfer with optimal rate
Knowledge encryption and its applications to simulatable protocols with low round-complexity
Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
Round-optimal oblivious transfer and MPC from computational CSIDH
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Multi-theorem preprocessing NIZKs from lattices
On concurrent multi-party quantum computation
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
BETA: biometric-enabled threshold authentication
Round-optimal black-box secure computation from two-round malicious OT
Combiners for functional encryption, unconditionally
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
On the round complexity of black-box secure MPC
Two-round multiparty secure computation minimizing public key operations
Broadcast-optimal two-round MPC
On the round complexity of secure quantum computation
Perfect secure computation in two rounds
Two-round MPC: information-theoretic and black-box
Two-round adaptively secure multiparty computation from standard assumptions
Statistical security in two-party computation revisited
Succinct garbling schemes from functional encryption through a local simulation paradigm
Fully-secure MPC with minimal trust
Efficient laconic cryptography from learning with errors
Perfect secure computation in two rounds
Broadcast-optimal two round MPC with an honest majority
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
Cryptographic group actions and applications
On the enumeration of minimal non-pairwise compatibility graphs
Round-optimal black-box protocol compilers
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
Concurrently composable non-interactive secure computation
Two-round Multiparty Secure Computation from Minimal Assumptions
A new approach to round-optimal secure multiparty computation
Round-optimal and communication-efficient multiparty computation
On communication models and best-achievable security in two-round MPC
Two-round secure MPC from indistinguishability obfuscation
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-message witness indistinguishability and secure computation in the plain model from new assumptions
Post-quantum multi-party computation
Two-round oblivious transfer from CDH or LPN
An improved affine equivalence algorithm for random permutations
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?
Secure computation with minimal interaction, revisited
Reusable two-round MPC from LPN
Two-round maliciously secure computation with super-polynomial simulation
Towards round-optimal secure multiparty computations: multikey FHE without a CRS
On reductions from multi-domain noninterference to the two-level case
Round-optimal secure multi-party computation

This page was built for publication: Two-round multiparty secure computation from minimal assumptions

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