{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:18:38Z","timestamp":1780571918795,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662443804","type":"print"},{"value":"9783662443811","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44381-1_24","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T04:27:09Z","timestamp":1405312029000},"page":"421-439","source":"Crossref","is-referenced-by-count":240,"title":["How to Use Bitcoin to Design Fair Protocols"],"prefix":"10.1007","author":[{"given":"Iddo","family":"Bentov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ranjit","family":"Kumaresan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Fair two-party computations via the bitcoin deposits, ePrint 2013\/837 (2013)","DOI":"10.1109\/SP.2014.35"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: IEEE Security and Privacy (2014)","DOI":"10.1109\/SP.2014.35"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-54242-8_13","volume-title":"Theory of Cryptography","author":"G. Asharov","year":"2014","unstructured":"Asharov, G.: Towards characterizing complete fairness in secure two-party computation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 291\u2013316. Springer, Heidelberg (2014)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic protocols for fair exchange. In: ACM CCS, pp. 7\u201317 (1997)","DOI":"10.1145\/266420.266426"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BFb0054156","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Asokan","year":"1998","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 591\u2013606. Springer, Heidelberg (1998)"},{"key":"24_CR6","unstructured":"Back, A., Bentov, I.: Note on fair coin toss via bitcoin (2013), http:\/\/arxiv.org\/abs\/1402.3698"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-32946-3_29","volume-title":"Financial Cryptography and Data Security","author":"S. Barber","year":"2012","unstructured":"Barber, S., Boyen, X., Shi, E., Uzun, E.: Bitter to better \u2014 how to make bitcoin a better currency. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol.\u00a07397, pp. 399\u2013414. Springer, Heidelberg (2012)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority. In: IEEE FOCS, pp. 468\u2013473 (1989)","DOI":"10.1109\/SFCS.1989.63520"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-22792-9_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A. Beimel","year":"2011","unstructured":"Beimel, A., Lindell, Y., Omri, E., Orlov, I.: 1\/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 277\u2013296. Springer, Heidelberg (2011)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Belenkiy, M., Chase, M., Erway, C., Jannotti, J., Kupcu, A., Lysyanskaya, A., Rachlin, E.: Making p2p accountable without losing privacy. In: Proc. of WPES (2007)","DOI":"10.1145\/1314333.1314339"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.: A fair protocol for signing contracts (extended abstract). In: Brauer, W. (ed.) ICALP. LNCS, vol.\u00a0194, pp. 43\u201352. Springer, Heidelberg (1985)","DOI":"10.1007\/BFb0015729"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: ACM STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols, ePrint 2014\/129 (2014)","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed Commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44598-6_6","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"C. Cachin","year":"2000","unstructured":"Cachin, C., Camenisch, J.L.: Optimistic Fair Secure Computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 93\u2013111. Springer, Heidelberg (2000)"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: IEEE FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-39200-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 68\u201386. Springer, Heidelberg (2003)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: ACM STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-24676-3_18","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"L. Chen","year":"2004","unstructured":"Chen, L., Kudla, C., Paterson, K.G.: Concurrent Signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 287\u2013305. Springer, Heidelberg (2004)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-32946-3_28","volume-title":"Financial Cryptography and Data Security","author":"J. Clark","year":"2012","unstructured":"Clark, J., Essex, A.: CommitCoin: Carbon Dating Commitments with Bitcoin. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol.\u00a07397, pp. 390\u2013398. Springer, Heidelberg (2012)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Friedman, E., Resnick, P.: The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 173\u2013199 (2000)","DOI":"10.1162\/105864001300122476"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-36504-4_13","volume-title":"Financial Cryptography","author":"J. Garay","year":"2003","unstructured":"Garay, J., Jakobsson, M.: Timed release of standard digital signatures. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 168\u2013182. Springer, Heidelberg (2003)"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-48405-1_29","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J.A. Garay","year":"1999","unstructured":"Garay, J.A., Jakobsson, M., MacKenzie, P.D.: Abuse-Free Optimistic Contract Signing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 449\u2013466. Springer, Heidelberg (1999)"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Garay, J., Katz, J., Kumaresan, R., Zhou, H.-S.: Adaptively secure broadcast, revisited. In: ACM PODC, pp. 179\u2013186 (2011)","DOI":"10.1145\/1993806.1993832"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Garay, J., MacKenzie, P., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. In: TCC, pp. 404\u2013428 (2006)","DOI":"10.1007\/11681878_21"},{"key":"24_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-45126-6_14","volume-title":"Financial Cryptography","author":"J.A. Garay","year":"2003","unstructured":"Garay, J.A., Pomerance, C.: Timed fair exchange of standard signatures. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 190\u2013207. Springer, Heidelberg (2003)"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of cryptography: Basic Applications, vol.\u00a02 (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: ACM STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"24_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"S. Goldwasser","year":"1991","unstructured":"Goldwasser, S., Levin, L.A.: Fair Computation of General Functions in Presence of Immoral Majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Gordon, S., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: ACM STOC, pp. 413\u2013422 (2008)","DOI":"10.1145\/1374376.1374436"},{"key":"24_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-11799-2_7","volume-title":"Theory of Cryptography","author":"D. Gordon","year":"2010","unstructured":"Gordon, D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On Complete Primitives for Fairness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 91\u2013108. Springer, Heidelberg (2010)"},{"key":"24_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-13190-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S.D. Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J.: Partial Fairness in Secure Two-Party Computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 157\u2013176. Springer, Heidelberg (2010)"},{"key":"24_CR35","unstructured":"Huang, Y., Katz, J., Evans, D.: Private set intersection: Are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"24_CR36","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/978-3-662-44381-1_26","volume-title":"CRYPTO 2014, Part II","author":"Y. Huang","year":"2014","unstructured":"Huang, Y., Katz, J., Kolesnikov, V., Kumaresan, R., Malozemoff, A.J.: Amortizing Garbled Circuits. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol.\u00a08617, pp. 458\u2013475. Springer, Heidelberg (2014)"},{"key":"24_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding Cryptography on Oblivious Transfer \u2013 Efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"24_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J. Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally Composable Synchronous Computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 477\u2013498. Springer, Heidelberg (2013)"},{"key":"24_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"24_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-15497-3_30","volume-title":"Computer Security \u2013 ESORICS 2010","author":"A. K\u00fcp\u00e7\u00fc","year":"2010","unstructured":"K\u00fcp\u00e7\u00fc, A., Lysyanskaya, A.: Optimistic Fair Exchange with Multiple Arbiters. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 488\u2013507. Springer, Heidelberg (2010)"},{"key":"24_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-11925-5_18","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"A. K\u00fcp\u00e7\u00fc","year":"2010","unstructured":"K\u00fcp\u00e7\u00fc, A., Lysyanskaya, A.: Usable Optimistic Fair Exchange. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.\u00a05985, pp. 252\u2013267. Springer, Heidelberg (2010)"},{"key":"24_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-79263-5_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"A.Y. Lindell","year":"2008","unstructured":"Lindell, A.Y.: Legally-enforceable fairness in secure two-party computation. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 121\u2013137. Springer, Heidelberg (2008)"},{"key":"24_CR43","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/978-3-662-44381-1_27","volume-title":"CRYPTO 2014, Part II","author":"Y. Lindell","year":"2014","unstructured":"Lindell, Y., Riva, B.: Cut-and-Choose Yao-Based Secure Computation in the Online\/Offline and Batch Settings. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol.\u00a08617, pp. 476\u2013494. Springer, Heidelberg (2014)"},{"key":"24_CR44","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay: a secure two-party computation system. In: USENIX, p. 20 (2004)"},{"key":"24_CR45","unstructured":"Maxwell, G.: Zero knowledge contingent payment (2011), https:\/\/en.bitcoin.it\/wiki\/Zero_Knowledge_Contingent_Payment"},{"key":"24_CR46","doi-asserted-by":"crossref","unstructured":"Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: ACM PODC, pp. 12\u201319 (2003)","DOI":"10.1145\/872035.872038"},{"key":"24_CR47","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008), http:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"24_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Naor","year":"1990","unstructured":"Naor, M.: Bit Commitment Using Pseudo-randomness. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 128\u2013136. Springer, Heidelberg (1990)"},{"key":"24_CR49","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-39200-9_6","volume-title":"EUROCRYPT 2003","author":"B. Pinkas","year":"2003","unstructured":"Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 87\u2013105. Springer, Heidelberg (2003)"},{"key":"24_CR50","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44381-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T00:23:19Z","timestamp":1649636599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44381-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443804","9783662443811"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44381-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}