Secure Multiparty Computations on Bitcoin

@article{Andrychowicz2014SecureMC,
  title={Secure Multiparty Computations on Bitcoin},
  author={Marcin Andrychowicz and Stefan Dziembowski and Daniel Malinowski and Lukasz Mazurek},
  journal={2014 IEEE Symposium on Security and Privacy},
  year={2014},
  pages={443-458}
}
Bit coin is a decentralized digital currency, introduced in 2008, that has recently gained noticeable popularity. Its main features are: (a) it lacks a central authority that controls the transactions, (b) the list of transactions is publicly available, and (c) its syntax allows more advanced transactions than simply transferring the money. The goal of this paper is to show how these properties of Bit coin can be used in the area of secure multiparty computation protocols (MPCs). Firstly, we… 
Two Party double deposit trustless escrow in cryptographic networks and Bitcoin [BitHalo]
Crypto-currency is a form of decentralized digital currency that has changed the world of finance over the past several years. Bitcoin[6] lacks a central authority and protects anonymity, while
Multiparty Computation Protocols Based on Cryptocurrencies
TLDR
This dissertation shows how to use cryptocurrencies and techniques coming from the field of cryptocurrencies to construct new types of Multiparty Computation Protocols (MPC), which go beyond the standard definition of MPC, and formally verify the correctness and the security of such protocols.
Improvements to Secure Computation with Penalties
TLDR
This work improves the efficiency of protocols for secure computation with penalties in a hybrid model where parties have access to the "claim-or-refund" transaction functionality and presents a 'dual-mode' protocol that offers different guarantees depending on the number of corrupt parties.
Fair and Robust Multi-party Computation Using a Global Transaction Ledger
Classical results on secure multi-party computation (MPC) imply that fully secure computation, including fairness (either all parties get output or none) and robustness (output delivery is
How to Use Bitcoin to Play Decentralized Poker
TLDR
This work formalize, generalize, and construct multiparty protocols for the primitive secure cash distribution with penalties, which is dropout-tolerant in the sense that any party that drops out during the protocol is forced to pay a monetary penalty to all other parties.
Verification of recursive Bitcoin contracts
TLDR
This work addresses the problem of verifying liquidity on BitML, a DSL for smart contracts with a secure compiler to Bitcoin, featuring primitives for currency transfers, contract renegotiation and consensual recursion, and implements a toolchain that automatically verifies liquidity of BitML contracts and compiles them to Bitcoin.
Fair and Robust Multi-party Computation Using a Global Transaction Ledger
TLDR
This work puts forth a new formal model of secure MPC with compensation and shows how the introduction of suitable ledger and synchronization functionalities makes it possible to describe such protocols using standard interactive Turing machines ITM circumventing the need for the use of extra features that are outside the standard model as in previous works.
How to Use Bitcoin to Incentivize Correct Computations
TLDR
An efficient secure computation protocol is shown that monetarily penalizes an adversary that attempts to learn one bit of information but gets detected in the process and captures the amount of computational effort required to validate Bitcoin transactions required to implement it in Bitcoin.
How to deal with malleability of BitCoin transactions
TLDR
This short note shows a general technique for creating malleability-resilient "refund" transactions, which does not require any modification of the BitCoin protocol.
How to Use Bitcoin to Play Internet Poker
Back and Bentov (arXiv 2014) and Andrychowicz et al. (Security and Privacy 2014) introduced techniques to perform secure multiparty computations on Bitcoin. Among other things, these works
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 74 REFERENCES
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
TLDR
The main result is constructions of 1/p-secure protocols that are resilient against any number of corrupt parties provided that the number of parties is constant and the size of the range of the functionality is at most polynomial (in the security parameter n).
How to Use Bitcoin to Incentivize Correct Computations
TLDR
An efficient secure computation protocol is shown that monetarily penalizes an adversary that attempts to learn one bit of information but gets detected in the process and captures the amount of computational effort required to validate Bitcoin transactions required to implement it in Bitcoin.
How to deal with malleability of BitCoin transactions
TLDR
This short note shows a general technique for creating malleability-resilient "refund" transactions, which does not require any modification of the BitCoin protocol.
Compact E-Cash
TLDR
This paper presents efficient off-line anonymous e-cash schemes where a user can withdraw a wallet containing 2 coins each of which she can spend unlinkably, and offers exculpability of users, that is, the bank can prove to third parties that a user has double-spent.
How to Generate and Exchange Secrets (Extended Abstract)
  • A. Yao
  • Computer Science
    FOCS
  • 1986
TLDR
A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
FairplayMP: a system for secure multi-party computation
TLDR
This work presents FairplayMP, a system for secure multi-party computation that supplements the Fairplay system and modified the BMR protocol in a novel way and considerably improved its performance by using the Ben-Or-Goldwasser-Wigderson (BGW) protocol for the purpose of constructing gate tables.
Partial Fairness in Secure Two-Party Computation
TLDR
A definition of partial fairness within the standard real-/ideal-world paradigm is proposed and it is shown that there exist functions with super-polynomial domains and ranges for which it is impossible to achieve the definition.
Covert two-party computation
TLDR
This work presents another protocol which is fair and secure against malicious adversaries in the Random Oracle Model --- unlike most other protocols against malicious adversary, this protocol does not rely on zero-knowledge proofs (or similar cut-and-choose techniques), because they inherently reveal that a computation took place.
Fair Two-Party Computations via Bitcoin Deposits
TLDR
The Bitcoin currency system can be used to obtain fairness in any two-party secure computation protocol in the following sense: if one party aborts the protocol after learning the output then the other party gets a financial compensation (in bitcoins).
Merkle-Damgård Revisited: How to Construct a Hash Function
TLDR
It is shown that the current design principle behind hash functions such as SHA-1 and MD5 — the (strengthened) Merkle-Damgard transformation — does not satisfy a new security notion for hash-functions, stronger than collision-resistance.
...
1
2
3
4
5
...