Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Hazay, Carmit; Schöll, Peter; Soria-Vázquez, Eduardo

doi:10.1007/978-3-319-70694-8_21

Cited by 55 publications

(15 citation statements)

References 40 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following our work, there has been renewed interest in the BMR protocol. First and foremost, the works of [25,16] build directly on this work and show how to construct the BMR garbled circuit more efficiently. In addition, [3] considered the semi-honest setting, and [21] apply an optimized version of our construction to efficient RAM-based MPC.…”

Section: Our Contributionmentioning

confidence: 99%

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

Lindell

Pinkas

Smart

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Recently, there has been huge progress in the field of concretely efficient secure computation, even while providing security in the presence of malicious adversaries. This is especially the case in the two-party setting, where constant-round protocols exist that remain fast even over slow networks. However, in the multi-party setting, all concretely efficient fully-secure protocols, such as SPDZ, require many rounds of communication.In this paper, we present a constant-round multiparty secure computation protocol that is fully-secure in the presence of malicious adversaries and for any number of corrupted parties. Our construction is based on the constant-round protocol of Beaver et al. (the BMR protocol), and is the first version of that protocol that is concretely efficient for the dishonest majority case.Our protocol includes an online phase that is extremely fast and mainly consists of each party locally evaluating a garbled circuit. For the offline phase we present both a generic construction (using any underlying MPC protocol), and a highly efficient instantiation based on the SPDZ protocol. Our estimates show the protocol to be considerably more efficient than previous fully-secure multi-party protocols.

show abstract

Section: Our Contributionmentioning

confidence: 99%

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

Lindell

Pinkas

Smart

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Our multiparty GC-based protocol is a combination, with some extensions, of protocols described in [14,16,19,28]. We let K = F 2 κ be a finite field, recall we use K = F 2 128 in our implementation.…”

Section: Bmr-style Mpc For Binary Circuitsmentioning

confidence: 99%

“…In the passively secure two party case this idea goes back to Yao [29], which was generalised to the honest-majority multi-party setting by Beaver et al [3]. Recently, there has been renewed interest in n-party activelysecure protocols in this paradigm, such as [16,28]. The focus in these newer protocols is almost always on full-threshold access structures.…”

Section: Introductionmentioning

confidence: 99%

“…This in turn influences our selection of the underlying n-party GC protocol. Thus, in this work, we adapt the BMR-style protocol of [16]. The reason for selecting [16] over, say [28] is that the former is role symmetric and it is easier to turn into a reactive MPC protocol compared to [28].…”

Section: Introductionmentioning

confidence: 99%

“…Figure 1: Our functionalities -The GC-based protocol of [16] makes use pre-processing of socalled authenticated bits and authenticated AND-triples, via OTextension. There are a number of different ways of producing such triples e.g., Oblivious Transfer (OT).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Zaphod

Aly

Orsini

Rotaru

et al. 2019

Proceedings of the 7th ACM Workshop on Encrypted Computing &Amp; Applied Homomorphic Cryptography

View full text Add to dashboard Cite

We present modifications to the MPC system SCALE-MAMBA to enable the evaluation of garbled circuit (GC) based MPC functionalities and Linear Secret Sharing (LSSS) based MPC functionalities along side each other. This allows the user to switch between different MPC paradigms to achieve the best performance. To do this we present modifications to the GC-based MPC protocol of Hazay et al. (Asiacrypt 2017) (to enable it to support reactive computation), and combine different aspects of their pre-processing phase with those of Wang et al. (CCS 2017), in order to optimize our pre-processing protocols. We also give a more efficient method for producing daBits (double authenticated Bits) than that presented in the work of Rotaru and Wood (ePrint 2019). Finally, we examine how the functionality can be integrated within the existing MPC framework SCALE-MAMBA . CCS CONCEPTS• Security and privacy → Security protocols; Privacy-preserving protocols; • Theory of computation → Cryptographic protocols.

show abstract

On Multiparty Garbling of Arithmetic Circuits

Ben-Efraim

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Cited by 55 publications

References 40 publications

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ

Zaphod

On Multiparty Garbling of Arithmetic Circuits

Contact Info

Product

Resources

About