Two-round multiparty secure computation from minimal assumptions
From MaRDI portal
Publication:1648848
DOI10.1007/978-3-319-78375-8_16zbMATH Open1428.94072OpenAlexW2794956529MaRDI QIDQ1648848FDOQ1648848
Authors: Sanjam Garg, Akshayaram Srinivasan 
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_16
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 (74)
- mrNISC from LWE with polynomial modulus
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Broadcast-optimal four-round MPC in the plain model
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- 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
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
- On concurrent multi-party quantum computation
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Multi-theorem preprocessing NIZKs from lattices
- R3PO: reach-restricted reactive program obfuscation and its applications
- Two-round maliciously-secure oblivious transfer with optimal rate
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Malicious security for SCALES. Outsourced computation with ephemeral servers
- The round complexity of statistical MPC with optimal resiliency
- SCALES. MPC with small clients and larger ephemeral servers
- mrNISC from LWE with polynomial modulus
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Post-quantum multi-party computation
- Reusable two-round MPC from LPN
- Round-optimal black-box secure computation from two-round malicious OT
- An improved affine equivalence algorithm for random permutations
- Broadcast-optimal two-round MPC
- On the round complexity of secure quantum computation
- Efficient laconic cryptography from learning with errors
- Broadcast-optimal two round MPC with an honest majority
- On actively-secure elementary MPC reductions
- On the exact round complexity of secure three-party computation
- 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
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Two-round secure MPC from indistinguishability obfuscation
- Secure computation with minimal interaction, revisited
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- On the round complexity of black-box secure MPC
- Round-optimal black-box protocol compilers
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- Towards round-optimal secure multiparty computations: multikey FHE without a CRS
- 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
- On reductions from multi-domain noninterference to the two-level case
- Multiparty reusable non-interactive secure computation from LWE
- Unbounded multi-party computation from learning with errors
- Towards accountability in CRS generation
- A new approach to round-optimal secure multiparty computation
- Two-round oblivious transfer from CDH or LPN
- Combiners for functional encryption, unconditionally
- From FE combiners to secure MPC and back
- BETA: biometric-enabled threshold authentication
- Two-round multiparty secure computation minimizing public key operations
- Reverse firewalls for actively secure MPCs
- Fully-secure MPC with minimal trust
- Laconic private set intersection and applications
- Cryptographic group actions and applications
- 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
- On communication models and best-achievable security in two-round MPC
- Minimizing setup in broadcast-optimal two round MPC
- On the enumeration of minimal non-pairwise compatibility graphs
- Founding Cryptography on Oblivious Transfer – Efficiently
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)
