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

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

doi:10.1007/978-3-030-03332-3_4

Cited by 18 publications

(10 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, at the time of writing (2021), the most efficient, practical, n-party BMR style protocols are HSS [HSS17] and WRK [WRK17b]; both of which are based on Tiny-OT for the underlying protocol to produce the shared garbling. Tiny-OT was also applied in the Tiny-Keys extensions to the above protocols [HOSS18a,HOSS18b]. Tiny-OT also forms the basis of the two party protocol [WRK17a].…”

Section: Impactmentioning

confidence: 99%

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer

et al. 2021

Self Cite

View full text Add to dashboard Cite

We present a unified view of the two-party and multi-party computation protocols based on oblivious transfer first outlined in Nielsen et al. (CRYPTO 2012) and Larraia et al. (CRYPTO 2014). We present a number of modifications and improvements to these earlier presentations, as well as full proofs of the entire protocol. Improvements include a unified pre-processing and online MAC methodology, mechanisms to pass between different MAC variants, and fixing a minor bug in the protocol of Larraia et al. in relation to a selective failure attack. It also fixes a minor bug in Nielsen et al. resulting from using Jensen's inequality in the wrong direction in an analysis.

show abstract

Section: Impactmentioning

confidence: 99%

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer

et al. 2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…This reflects the fact that a malicious sender in F mal-t -PPRF can try to guess subsets containing the receiver's α j inputs, which correspond to non-zero coordinates of the error vector. This assumption with leakage is essentially the same as an assumption recently used for maliciously secure MPC based on syndrome decoding [34]. For a formal definition we refer to the full version.…”

Section: Inputsmentioning

confidence: 99%

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation

Boyle

Couteau

Gilboa

et al. 2019

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

Self Cite

103

View full text Add to dashboard Cite

We consider the problem of securely generating useful instances of two-party correlations, such as many independent copies of a random oblivious transfer (OT) correlation, using a small amount of communication. This problem is motivated by the goal of secure computation with silent preprocessing, where a low-communication input-independent setup, followed by local ("silent") computation, enables a lightweight "non-cryptographic" online phase once the inputs are known.Recent works of Boyle et al. (CCS 2018, Crypto 2019) achieve this goal with good concrete efficiency for useful kinds of two-party correlations, including OT correlations, under different variants of the Learning Parity with Noise (LPN) assumption, and using a small number of "base" oblivious transfers. The protocols of Boyle et al. have several limitations. First, they require a large number of communication rounds. Second, they are only secure against semi-honest parties. Finally, their concrete efficiency estimates are not backed by an actual implementation. In this work we address these limitations, making three main contributions: • Eliminating interaction. Under the same assumption, we obtain the first concretely efficient 2-round protocols for generating useful correlations, including OT correlations, in the semi-honest security model. This implies the first efficient 2-round OT extension protocol of any kind and, more generally, protocols for non-interactive secure computation (NISC) that are concretely efficient and have the silent preprocessing feature.

show abstract

“…Data modifications can lead to mining errors if random noise is used [17] or may become complex when using homomorphic data encryption [18]. Instead, in PP-Overgrid, we employ the second approach based on Multi-Party Computation (MPC) protocols [19]. These algorithms were developed for aggregating information collected from multiple users, without disclosing any information of the single users.…”

Section: Privacy-preserving Schemesmentioning

confidence: 99%

Privacy-Preserving Overgrid: Secure Data Collection for the Smart Grid

Croce

Giuliano

Tinnirello

et al. 2020

Sensors

View full text Add to dashboard Cite

In this paper, we present a privacy-preserving scheme for Overgrid, a fully distributed peer-to-peer (P2P) architecture designed to automatically control and implement distributed Demand Response (DR) schemes in a community of smart buildings with energy generation and storage capabilities. To monitor the power consumption of the buildings, while respecting the privacy of the users, we extend our previous Overgrid algorithms to provide privacy preserving data aggregation (PP-Overgrid). This new technique combines a distributed data aggregation scheme with the Secure Multi-Party Computation paradigm. First, we use the energy profiles of hundreds of buildings, classifying the amount of “flexible” energy consumption, i.e., the quota which could be potentially exploited for DR programs. Second, we consider renewable energy sources and apply the DR scheme to match the flexible consumption with the available energy. Finally, to show the feasibility of our approach, we validate the PP-Overgrid algorithm in simulation for a large network of smart buildings.

show abstract

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

Cited by 18 publications

References 27 publications

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation

Privacy-Preserving Overgrid: Secure Data Collection for the Smart Grid

Contact Info

Product

Resources

About