More Efficient Constant-Round Multi-party Computation from BMR and SHE
From MaRDI portal
Publication:3179370
DOI10.1007/978-3-662-53641-4_21zbMath1406.94071OpenAlexW2572799557MaRDI QIDQ3179370
Yehuda Lindell, Eduardo Soria-Vazquez, Nigel 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
Related Items (10)
Actively secure half-gates with minimum overhead under duplex networks ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Scalable Multi-party Private Set-Intersection ⋮ 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 multi-party computation combining BMR and SPDZ ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Broadcast-optimal two-round MPC
Uses Software
Cites Work
- Secure multi-party computation without agreement
- Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- Better Preprocessing for Secure Multiparty Computation
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Dishonest Majority Multi-Party Computation for Binary Circuits
- Efficient Three-Party Computation from Cut-and-Choose
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Two-Output Secure Computation with Malicious Adversaries
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Two-Party Computation Is Practical
- Fully homomorphic encryption using ideal lattices
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Advances in Cryptology – CRYPTO 2004
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- The Exact Round Complexity of Secure Computation
This page was built for publication: More Efficient Constant-Round Multi-party Computation from BMR and SHE
