More efficient constant-round multi-party computation from BMR and SHE
From MaRDI portal
Publication:3179370
DOI10.1007/978-3-662-53641-4_21zbMATH Open1406.94071OpenAlexW2572799557MaRDI QIDQ3179370FDOQ3179370
Authors: Yehuda Lindell, Eduardo Soria-Vazquez, N. P. Smart 
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2016/156
Recommendations
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Efficient constant round multi-party computation combining BMR and SPDZ
- Low cost constant round MPC combining BMR and oblivious transfer
- Efficient scalable constant-round MPC via garbled circuits
- Low cost constant round MPC combining BMR and oblivious transfer
Cites Work
- Fully homomorphic encryption using ideal lattices
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Efficient secure two-party computation using symmetric cut-and-choose
- Secure two-party computation via cut-and-choose oblivious transfer
- Two-output secure computation with malicious adversaries
- Founding Cryptography on Oblivious Transfer – Efficiently
- The IPS compiler: optimizations, variants and concrete efficiency
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Secure two-party computation is practical
- Advances in Cryptology – CRYPTO 2004
- Secure multi-party computation without agreement
- The Exact Round Complexity of Secure Computation
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- A simpler variant of universally composable security for standard multiparty computation
- Adaptively secure multi-party computation from LWE (via equivocal FHE)
- More efficient oblivious transfer extensions with security for malicious adversaries
- Dishonest majority multi-party computation for binary circuits
- Efficient three-party computation from cut-and-choose
- Efficient constant round multi-party computation combining BMR and SPDZ
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Which ring based somewhat homomorphic encryption scheme is best?
- Better preprocessing for secure multiparty computation
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
Cited In (11)
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Broadcast-optimal two-round MPC
- Efficient constant round multi-party computation combining BMR and SPDZ
- Actively secure half-gates with minimum overhead under duplex networks
- TinyKeys: a new approach to efficient multi-party computation
- Low cost constant round MPC combining BMR and oblivious transfer
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Efficient constant-round MPC with identifiable abort and public verifiability
- Scalable Multi-party Private Set-Intersection
- Mixed-technique multi-party computations composed of two-party computations
- Maliciously circuit-private multi-key FHE and MPC based on LWE
Uses Software
This page was built for publication: More efficient constant-round multi-party computation from BMR and SHE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179370)
