Secure Multiparty Computations on Bitcoin

@inproceedings{Andrychowicz2014SecureMC,
  title={Secure Multiparty Computations on Bitcoin},
  author={Marcin Andrychowicz and Stefan Dziembowski and Daniel Malinowski and Lukasz Mazurek},
  booktitle={IEEE Symposium on Security and Privacy},
  year={2014}
}
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… 
Robust Multiparty Computation with Faster Verification Time
TLDR
This paper observes that a deposit transaction created by a party in KZZ can be generated simply from the information contained in a different deposit transaction, and implements a host of novel techniques for addition and elimination of elements on a set relevant for the protocol.
TTP-free Fair Exchange of Digital Signatures with Bitcoin
TLDR
A new primitive called committed key generation that converts committed message into public/private key paring, specifically, an ECDSA key pair used in the Bitcoin in the authors' construction, with non-interactive zero-knowledge proof is proposed.
Insured MPC: Efficient Secure Computation with Financial Penalties
TLDR
This work puts forth the first UC secure modular construction of “Insured MPC”, where either the output of the private computation is fairly delivered or a proof that a set of parties has misbehaved is produced, allowing for financial punishments.
An Analysis of Non-standard Transactions
TLDR
The Bitcoin block-chain is explored with the purpose to analyze and classify standard and non-standard transactions, understanding how much the standard behaviour is respected.
Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts
TLDR
Although smart contracts are believed to have a huge potential, for the moment they are not widely used in practice, because most of Bitcoin miners allow only to post standard transactions on the blockchain, it is currently very hard to create non-trivial smart contracts in Bitcoin.
Efficient Publicly Verifiable 2PC over a Blockchain with Applications to Financially-Secure Computations
We present a new efficient two-party secure computation protocol which allows the honest party to catch dishonest behavior (if any) with a publicly-verifiable, non-repudiable proof without
Enhancing Privacy and Improving Security in Scalable Blockchain
TLDR
The purpose of this paper is to review how varying degrees of user privacy is maintained in bitcoin cryptocurrency and explores privacy-enhancing techniques adopted in bitcoin.
Liar, Liar, Coins on Fire!: Penalizing Equivocation By Loss of Bitcoins
We show that equivocation, i.e., making conflicting statements to others in a distributed protocol, can be monetarily disincentivized by the use of crypto-currencies such as Bitcoin. To this end, we
FairSwap: How To Fairly Exchange Digital Goods
TLDR
FairSwap is introduced -- an efficient protocol for fair exchange of digital goods using smart contracts executed over decentralized cryptocurrencies, where the contract takes the role of an external judge that completes the exchange in case of disagreement.
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards
TLDR
This work presents a new model for achieving fairness in MPC against dishonest majority by using public bulletin boards implemented via existing infrastructure such as blockchains or Google's certificate transparency logs.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 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 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, Mathematics
    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.
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).
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
TLDR
Zerocoin is proposed, a cryptographic extension to Bitcoin that augments the protocol to allow for fully anonymous currency transactions and uses standard cryptographic assumptions and does not introduce new trusted parties or otherwise change the security model of Bitcoin.
Fairplay - Secure Two-Party Computation System
TLDR
Fairplay is introduced, a full-fledged system that implements generic secure function evaluation (SFE) and provides a test-bed of ideas and enhancements concerning SFE, whether by replacing parts of it, or by integrating with it.
Timed Commitments
We introduce and construct timed commitment schemes, an extension to the standard notion of commitments in which a potential forced opening phase permits the receiver to recover (with effort) the
Optimistic Fair Secure Computation
We present an efficient and fair protocol for secure two-party computation in the optimistic model, where a partially trusted third party T is available, but not involved in normal protocol
...
1
2
3
...