The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Secure Multiparty Computations on Bitcoin
Open accessAbstract
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 show that the Bit coin system provides an attractive way to construct a version of "timed commitments", where the committer has to reveal his secret within a certain time frame, or to pay a fine. This, in turn, can be used to obtain fairness in some multiparty protocols. Secondly, we introduce a concept of multiparty protocols that work "directly on Bit coin". Recall that the standard definition of the MPCs guarantees only that the protocol "emulates the trusted third party". Hence ensuring that the inputs are correct, and the outcome is respected is beyond the scope of the definition. Our observation is that the Bit coin system can be used to go beyond the standard "emulation-based" definition, by constructing protocols that link their inputs and the outputs with the real Bit coin transactions. As an instantiation of this idea we construct protocols for secure multiparty lotteries using the Bit coin currency, without relying on a trusted authority (one of these protocols uses the Bit coin-based timed commitments mentioned above). Our protocols guarantee fairness for the honest parties no matter how the loser behaves. For example: if one party interrupts the protocol then her money is transferred to the honest participants. Our protocols are practical (to demonstrate it we performed their transactions in the actual Bit coin system), and can be used in real life as a replacement for the online gambling sites. We think that this paradigm can have also other applications. We discuss some of them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bitcoin: A Peer-to-Peer Electronic Cash System
Wright, C. S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3440802 · Cited by 13,922
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190
Pricing via processing or combatting junk mail
Dwork, C., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_10 · Cited by 1,282
Untraceable Electronic Cash: (Extended Abstract)
Chaum, D., Fiat, A., & Naor, M. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_25 · Cited by 1,120
Quantitative Analysis of the Full Bitcoin Transaction Graph
Ron, D., & Shamir, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_2 · Cited by 1,019
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Miers, I., Garman, C., Green, M., & Rubin, A. D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.34 · Cited by 983
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Fairplay—a secure two-party computation system
Malkhi, D., Nisan, N., Benny Pinkas, B., & Sella, Y. (2004) · Cited by 782
Bitter to Better — How to Make Bitcoin a Better Currency
Barber, S., Boyen, X., Shi, E., & Uzun, E. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_29 · Cited by 570
Secure Multiparty Computation Goes Live
Bogetoft, P., Christensen, D. L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., et al. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03549-4_20 · Cited by 539
Coin flipping by telephone a protocol for solving impossible problems
Blum, M. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008911 · Cited by 518
FairplayMP: a system for secure multi-party computation
Ben-David, A., Nisan, N., & Pinkas, B. (2008) · Proceedings of the 15th ACM conference on Computer and communications security · doi:10.1145/1455770.1455804 · Cited by 475
Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., & Smart, N. P. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40203-6_1 · Cited by 458
Limits on the security of coin flips when half the processors are faulty
Cleve, R. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12168 · Cited by 451
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
The Social Cost of Cheap Pseudonyms
Friedman, E. J., & Resnick, P. (2001) · Journal of Economics & Management Strategy · doi:10.1162/105864001300122476 · Cited by 377
Abraham, I., Dolev, D., Gonen, R., & Halpern, J. (2006) · Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing · doi:10.1145/1146381.1146393 · Cited by 343
How to Use Bitcoin to Design Fair Protocols
Bentov, I., & Kumaresan, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44381-1_24 · Cited by 339
Rational secret sharing and multiparty computation: extended abstract
Halpern, J., & Teague, V. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007447 · Cited by 319
Boneh, D., & Naor, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_15 · Cited by 307
Fair Two-Party Computations via Bitcoin Deposits
Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, Ł. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44774-1_8 · Cited by 153
Self-citationOptimistic Fair Secure Computation
Cachin, C., & Camenisch, J. L. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_6 · Cited by 97
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries
Garay, J. A., Katz, J. I., Maurer, U. M., Tackmann, B., & Zikas, V. (2013) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2013.75 · Cited by 93
Timed Release of Standard Digital Signatures
Garay, J. A., & Jakobsson, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36504-4_13 · Cited by 85
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
Beimel, A., Lindell, Y., Omri, E., & Orlov, I. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_16 · Cited by 55
von Ahn, L., Hopper, N., & Langford, J. C. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060668 · Cited by 43
Note on fair coin toss via BitcoinPreprint
Nakai, T., & Shinagawa, K. (2014) · arXiv (Cornell University) · doi:10.4230/oasics.tokenomics.2021.5 · Cited by 30
CommitCoin: Carbon Dating Commitments with Bitcoin (Short Paper)
Clark, J., & Essex, A. (2012) · Financial Cryptography · Cited by 14
Cited by
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
A Survey of Attacks on Ethereum Smart Contracts (SoK)
Atzei, N., Bartoletti, M., & Cimoli, T. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-54455-6_8 · Cited by 1,553
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies
Bonneau, J., Miller, A., Clark, J., Narayanan, A., Kroll, J. A., & Felten, E. W. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.14 · Cited by 1,246
Metadata
- Authors
- Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, L.
- Venue
- 2014 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2014-05
- Pages
- 443-458
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2031015560
- Cited by
- 345
- References
- 29
- FWCI
- 18.97
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.