A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation

Asharov, Gilad; Lindell, Yehuda

doi:10.1007/s00145-015-9214-4

Cited by 79 publications

(72 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the protocol can be computed with perfect security on the information theoretic model against passive and active adversaries under Canetti's hybrid model [13] by using available MPC protocols such as BGW [7]. We refer the reader to [21] for a complete set of proofs of security and composability for BGW. Indeed, results in BGW [7] and CDD [8] showed that any function can be computed using MPC with the aforementioned security levels by providing secure addition and multiplication under an arithmetic circuit paradigm.…”

Section: Privacy-preserving Protocol For Electricity Tradingmentioning

confidence: 99%

An MPC-Based Privacy-Preserving Protocol for a Local Electricity Trading Market

Abidin

Aly

Cleemput

et al. 2016

Cryptology and Network Security

View full text Add to dashboard Cite

Abstract. This paper proposes a decentralised and privacy-preserving local electricity trading market. The market employs a bidding protocol based on secure multiparty computation and allows users to trade their excess electricity among themselves. The bid selection and trading price calculation are performed in a decentralised and privacy-preserving manner. We implemented the market in C++ and tested its performance with realistic data sets. Our simulation results show that the market tasks can be performed for 2500 bids in less than four minutes in the "online" phase, showing its feasibility for a typical electricity trading period.

show abstract

Section: Privacy-preserving Protocol For Electricity Tradingmentioning

confidence: 99%

An MPC-Based Privacy-Preserving Protocol for a Local Electricity Trading Market

Abidin

Aly

Cleemput

et al. 2016

Cryptology and Network Security

View full text Add to dashboard Cite

show abstract

“…To avoid confusion related to security of the BGW protocol, we want to clarify the relation between our result and the recent security proof for this protocol, given by Lindell and Asharov [2]. They prove static security and then notice that BGW satisfies the MR definition, which by the result from [7] implies adaptive security (in the MR definition).…”

Section: Introductionmentioning

confidence: 75%

Adaptive versus Static Security in the UC Model

Damgård

Nielsen

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We show that for certain class of unconditionally secure protocols and target functionalities, static security implies adaptive security in the UC model. Similar results were previously only known for models with weaker security and/or composition guarantees. The result is, for instance, applicable to a wide range of protocols based on secret sharing. It "explains" why an often used proof technique for such protocols works, namely where the simulator runs in its head a copy of the honest players using dummy inputs and generates a protocol execution by letting the dummy players interact with the adversary. When a new player Pi is corrupted, the simulator adjusts the state of its dummy copy of Pi to be consistent with the real inputs and outputs of Pi and gives the state to the adversary. Our result gives a characterization of the cases where this idea will work to prove adaptive security. As a special case, we use our framework to give the first proof of adaptive security of the seminal BGW protocol in the UC framework.

show abstract

“…The analysis follows the standard BGW analysis (detailed in [AL11]). Very roughly, to show correctness, note that by the homomorphic properties of the Reed-Solomon code the correct polynomial E is such that E(0) = C(x 1 , .…”

Section: Output E(0)mentioning

confidence: 99%

Indistinguishability Obfuscation: From Approximate to Exact

Bitansky¹,

Vaikuntanathan²

2015

Theory of Cryptography

View full text Add to dashboard Cite

We show general transformations from subexponentially-secure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1/2 + fraction of inputs on a certain samplable distribution, into exact indistinguishability obfuscation where the obfuscated circuit and the original circuit agree on all inputs. As a step towards our results, which is of independent interest, we also obtain an approximate-to-exact transformation for functional encryption. At the core of our techniques is a method for "fooling" the obfuscator into giving us the correct answer, while preserving the indistinguishability-based security. This is achieved based on various types of secure computation protocols that can be obtained from different standard assumptions.Put together with the recent results of Canetti, Kalai and Paneth (TCC 2015), Pass and Shelat (TCC 2016), and Mahmoody, Mohammed and Nemathaji (TCC 2016), we show how to convert indistinguishability obfuscation schemes in various ideal models into exact obfuscation schemes in the plain model.

show abstract

A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation

Cited by 79 publications

References 29 publications

An MPC-Based Privacy-Preserving Protocol for a Local Electricity Trading Market

An MPC-Based Privacy-Preserving Protocol for a Local Electricity Trading Market

Adaptive versus Static Security in the UC Model

Indistinguishability Obfuscation: From Approximate to Exact

Contact Info

Product

Resources

About