A Unified Approach to MPC with Preprocessing Using OT

Frederiksen, Tore Kasper; Keller, Marcel; Orsini, Emmanuela; Schöll, Peter

doi:10.1007/978-3-662-48797-6_29

Cited by 42 publications

(48 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The M4R method gets half the latency of the vector method in this scenario, since the number of rounds is halved. As discussed earlier, the preprocessing for LowMC would likely be much better than AES if implemented with the protocol of [29].…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

MPC-Friendly Symmetric Key Primitives

Grassi

Rechberger

Rotaru

et al. 2016

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

Self Cite

View full text Add to dashboard Cite

We discuss the design of symmetric primitives, in particular Pseudo-Random Functions (PRFs) which are suitable for use in a secret-sharing based MPC system. We consider three different PRFs: the Naor-Reingold PRF, a PRF based on the Legendre symbol, and a specialized block cipher design called MiMC. We present protocols for implementing these PRFs within a secret-sharing based MPC system, and discuss possible applications. We then compare the performance of our protocols. Depending on the application, different PRFs may offer different optimizations and advantages over the classic AES benchmark. Thus, we cannot conclude that there is one optimal PRF to be used in all situations.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Note that LowMC only requires multiplication triples in F2, for which the protocol of [29] could be much faster than 4 The experiments in [31] showed that communication is the main bottleneck of the protocol, so this should give an accurate estimate. using F 2 128 triples.…”

Section: Lan Wanmentioning

confidence: 99%

MPC-Friendly Symmetric Key Primitives

Grassi

Rechberger

Rotaru

et al. 2016

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

Self Cite

View full text Add to dashboard Cite

show abstract

“…If any of these checks fails, abort. Similarly to prior constructions such as [DPSZ12,NNOB12,FKOS15,KOS16], our protocol is in the pre-processing model where the main difference is that the computation is carried out via two random committees P (h) and P (1) . The preprocessing phase is function and input independent, and provides all the correlated randomness needed for the online phase where the function is securely evaluated .…”

Section: Check Consistency Of the Inputs As Followsmentioning

confidence: 99%

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

Hazay

Orsini

Schöll

et al. 2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

In this work we develop a new theory for concretely efficient, largescale MPC with active security. Current practical techniques are mostly in the strong setting of all-but-one corruptions, which leads to protocols that scale badly with the number of parties. To work around this issue, we consider a large-scale scenario where a small minority out of many parties is honest and design scalable, more efficient MPC protocols for this setting. Our results are achieved by introducing new techniques for information-theoretic MACs with short keys and extending the work of Hazay et al. (CRYPTO 2018), which developed new passively secure MPC protocols in the same context. We further demonstrate the usefulness of this theory in practice by analyzing the concrete communication overhead of our protocols, which improve upon the most efficient previous works.

show abstract

“…In [31], a single non-XOR gate is estimated to require ca. 70µs during preprocessing (with two parties).…”

Section: Complexity Of Actively Secure Integer Multiplication and Aesmentioning

confidence: 99%

“…In concurrent work [36], the oblivious transfer methods of [31] have been extended to construct SPDZ multiplication triples over Z p . They report amortized timings of ca.…”

Section: Complexity Of Actively Secure Integer Multiplication and Aesmentioning

confidence: 99%

Preprocessing Based Verification of Multiparty Protocols with Honest Majority

Laud

Pankova

Jagomägis

2017

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

This paper presents a generic "GMW-style" method for turning passively secure protocols into protocols secure against covert attacks, adding relatively cheap offline preprocessing and post-execution verification phases. Our construction performs best with a small number of parties, and its main benefit is the total cost of the online and the offline phases. In the preprocessing phase, each party generates and shares a sufficient amount of verified multiplication triples that will be later used to assist that party's proof. The execution phase, after which the computed result is already available to the parties, has only negligible overhead that comes from signatures on sent messages. In the postprocessing phase, the verifiers repeat the computation of the prover in secret-shared manner, checking that they obtain the same messages that the prover sent out during execution. The verification preserves the privacy guarantees of the original protocol. It is applicable to protocols doing computations over finite rings, even if the same protocol performs its computation over several distinct rings. We apply our verification method to the Sharemind platform for secure multiparty computations (SMC), evaluate its performance and compare it to other existing SMC platforms offering security against stronger than passive attackers.

show abstract

A Unified Approach to MPC with Preprocessing Using OT

Cited by 42 publications

References 17 publications

MPC-Friendly Symmetric Key Primitives

MPC-Friendly Symmetric Key Primitives

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

Preprocessing Based Verification of Multiparty Protocols with Honest Majority

Contact Info

Product

Resources

About