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
Yehuda Lindell, N. P. Smart, Eduardo Soria-Vazquez
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 (10)
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Broadcast-optimal two-round MPC
- 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)
