Two-round multiparty secure computation from minimal assumptions
From MaRDI portal
Publication:1648848
DOI10.1007/978-3-319-78375-8_16zbMath1428.94072OpenAlexW2794956529MaRDI QIDQ1648848
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
Related Items
On the round complexity of secure quantum computation, The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, 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, 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, Round-optimal and communication-efficient multiparty computation, Round-optimal black-box protocol compilers, Reusable Two-Round MPC from LPN, 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, Minimizing setup in broadcast-optimal two round MPC, Efficient laconic cryptography from learning with errors, Round-optimal oblivious transfer and MPC from computational CSIDH, 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), 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, Perfect Secure Computation in Two Rounds, What security can we achieve within 4 rounds?, Beyond honest majority: the round complexity of fair and robust multi-party computation, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, On the exact round complexity of secure three-party computation, Round-optimal secure multi-party computation, Multi-theorem preprocessing NIZKs from lattices, On the enumeration of minimal non-pairwise compatibility graphs, Minicrypt primitives with algebraic structure and applications, 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, Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS, Two-round oblivious transfer from CDH or LPN, Broadcast-optimal two-round MPC
