Secure multiparty computations on Bitcoin

Andrychowicz, Marcin; Dziembowski, Stefan; Malinowski, Daniel; Mazurek, Łukasz

doi:10.1145/2896386

Cited by 134 publications

(200 citation statements)

References 29 publications

Supporting

Mentioning

198

Contrasting

Order By: Relevance

“…For example, in the ADMM fair 2-party lottery protocol [2], each player deposits at least 2 BTC and plays with another 1 BTC. The winner receives their deposit and the prize of 2 BTC for a total gain of 1 BTC.…”

Section: Discussionmentioning

confidence: 99%

“…Several recent works by Andrychowicz et al [1,2] (Protocol "ADMM") and Bentov and Kumaresan [3] (Protocol "BK") describe multi-party computation schemes in which Bitcoin deposits are used to ensure fairness. The general idea is that parties in the computation make a deposit at the beginning of the computation, which honest parties will get back in the end.…”

Section: Introductionmentioning

confidence: 99%

“…This is roughly how fairness and security are defined for ADMM 1 and BK. 2 ADMM and BK use Bitcoin to define complex transactions like…”

Section: Introductionmentioning

confidence: 99%

“…[2,§IV] 2 "Loosely speaking, our notion of fair secure computation guarantees: an honest party never has to pay any penalty; [and] if a party aborts after learning the output and does not deliver output to honest parties, then every honest party is compensated." [3, §2.1]…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Denial of Service attack against fair computations using Bitcoin deposits

Beekman

2016

Information Processing Letters

View full text Add to dashboard Cite

Bitcoin supports complex transactions where the recipient of a transaction can be programmatically determined. Using these transactions, multiparty computation protocols that aim to ensure fairness among participants have been designed. We present a Denial of Service attack against these protocols that results in a net loss for some or all of the honest parties involved, violating those fairness goals.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…This is roughly how fairness and security are defined for ADMM 1 and BK. 2 ADMM and BK use Bitcoin to define complex transactions like…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Denial of Service attack against fair computations using Bitcoin deposits

Beekman

2016

Information Processing Letters

View full text Add to dashboard Cite

show abstract

“…Since there was no an efficient MFE protocol that achieves the complete topology, the fairness problem in SMPC protocols still could not be completely solved. Existing fair SMPC solutions either work with inefficient gradual release [26], or require the use of bitcoins [13,1].…”

Section: Introductionmentioning

confidence: 99%

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Kılınç

Küpçü

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. We examine MFE scenarios where every participant has some item, and at the end of the protocol, either every participant receives every other participant's item, or no participant receives anything. This is a particularly hard scenario, even though it is directly applicable to protocols such as fair SMPC or multi-party contract signing. We further generalize our protocol to work for any exchange topology. We analyze the case where a trusted third party (TTP) is optimistically available, although we emphasize that the trust put on the TTP is only regarding the fairness, and our protocols preserve the privacy of the exchanged items even against a malicious TTP.We construct an asymptotically optimal (for the complete topology) multi-party fair exchange protocol that requires a constant number of rounds, in comparison to linear, and O(n 2 ) messages, in comparison to cubic, where n is the number of participating parties. We enable the parties to efficiently exchange any item that can be efficiently put into a verifiable escrow (e.g., signatures on a contract). We show how to apply this protocol on top of any SMPC protocol to achieve a fairness guarantee with very little overhead, especially if the SMPC protocol works with arithmetic circuits. Our protocol guarantees fairness in its strongest sense: even if all n − 1 other participants are malicious and colluding, fairness will hold.

show abstract

Blockchain‐based fair three‐party contract signing protocol for fog computing

Huang

Chen

2018

Concurrency and Computation

View full text Add to dashboard Cite

SummaryFog computing is a new computing paradigm that can provide flexible resources and services at the edge of network. It is an extension of cloud computing and usually cooperated with cloud computing. Therefore, end users, fog nodes, and cloud servers can form a three‐layer service model in practical application. In this model, they should have an agreement on a service contract, which contains every party's rights and obligations before the beginning of the service. However, due to lack of trust, it will suffer from some fairness problems during signing a service contract. Contract signing protocol allows two or more mutual distrust entities to sign a predefined digital contract in a fair and effective way. In this paper, we propose a fair three‐party contract signing protocol based on the primitive of blockchain, which can be applied to the scenario of fog computing. Our proposed construction allows the participants to sign a contract in a fair way without the involvement of an arbitrator. Moreover, the privacy of the contract content can be preserved on the public chain. Finally, we realize the proposed protocol through the private blockchain and provide the experimental simulation that analyzes the efficiency and effectiveness.

show abstract

Secure multiparty computations on Bitcoin

Cited by 134 publications

References 29 publications

A Denial of Service attack against fair computations using Bitcoin deposits

A Denial of Service attack against fair computations using Bitcoin deposits

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Blockchain‐based fair three‐party contract signing protocol for fog computing

Contact Info

Product

Resources

About