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

(88)

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
An improved affine equivalence algorithm for random permutations
A new approach to round-optimal secure multiparty computation
Two-message witness indistinguishability and secure computation in the plain model from new assumptions
What security can we achieve within 4 rounds?
Combiners for functional encryption, unconditionally
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
Round optimal secure multiparty computation from minimal assumptions
On the round complexity of secure quantum computation
Broadcast-optimal two round MPC with an honest majority
Three-round secure multiparty computation from black-box two-round oblivious transfer
On the round complexity of black-box secure MPC
On reductions from multi-domain noninterference to the two-level case
Round-optimal and communication-efficient multiparty computation
Round-optimal black-box protocol compilers
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
Two round information-theoretic MPC with malicious security
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
Cryptographic group actions and applications
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
Laconic private set intersection and applications
Secure computation with minimal interaction, revisited
Founding Cryptography on Oblivious Transfer – Efficiently
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
Reusable two-round MPC from LPN
Perfect secure computation in two rounds
Two-round secure MPC from indistinguishability obfuscation
Towards round-optimal secure multiparty computations: multikey FHE without a CRS
Two-round Multiparty Secure Computation from Minimal Assumptions
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
On the exact round complexity of secure three-party computation
On the enumeration of minimal non-pairwise compatibility graphs
Round-optimal secure multi-party computation
Multi-theorem preprocessing NIZKs from lattices
Minicrypt primitives with algebraic structure and applications
Minimizing setup in broadcast-optimal two round MPC
Efficient laconic cryptography from learning with errors
Round-optimal oblivious transfer and MPC from computational CSIDH
Beyond honest majority: the round complexity of fair and robust multi-party computation
Statistical security in two-party computation revisited
Round-optimal black-box secure computation from two-round malicious OT
Fully-secure MPC with minimal trust
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
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
Round-optimal black-box MPC in the plain model
Reusable secure computation in the plain model
On concurrent multi-party quantum computation
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
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
Malicious security for SCALES. Outsourced computation with ephemeral servers
A unified framework for succinct garbling from homomorphic secret sharing
Towards building scalable constant-round MPC from minimal assumptions via round collapsing
A framework for witness encryption from linearly verifiable SNARKs and applications
Black-box constant-round secure 2PC with succinct communication
Round-optimal black-box multiparty computation from polynomial-time assumptions
Simultaneous-message and succinct secure computation
Towards accountability in CRS generation
Secure computation with parallel calls to 2-ary functions
Broadcast-optimal secure computation from black-box oblivious transfer
Honest majority constant-round MPC with linear communication from one-way functions
Two-round multiparty secure computation minimizing public key operations

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)