Fair two-party computations via bitcoin deposits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8438, Issue , 2014, Pages 105-121

  Andrychowicz, Marcin ^a   Dziembowski, Stefan ^a,b   Malinowski, Daniel ^a   Mazurek, Łukasz ^a  

^a UNIVERSITY OF WARSAW   (Poland)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FINANCE; SECURITY OF DATA;

COMMITMENT SCHEME; CONTRACT SIGNING; FINANCIAL COMPENSATION; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; SECURE TWO-PARTY PROTOCOLS; SPECIFIC TASKS; TWO-PARTY COMPUTATION;

CRYPTOGRAPHY;

EID: 84910677988     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44774-1_8     Document Type: Conference Paper

References (31)

1. Abadi, M., Glew, N.: Certified email with a light on-line trusted third party: design and implementation. In: WWW '02.
2. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek,_L.: Secure multiparty computations on Bitcoin. Cryptology ePrint Archive (2013). http://eprint. iacr. org/2013/784.
3. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: How to deal with malleability of Bitcoin transactions. CoRR, abs/1312. 3230 (2013).
4. Ateniese, G., Nita-Rotaru, C.: Stateless-recipient certified e-mail system based on verifiable encryption. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 182-199. Springer, Heidelberg (2002).
5. Back, A., Bentov, I.: Note on fair coin toss via Bitcoin (2013). http://www. cs. technion. ac. il/-idddo/cointossBitcoin. pdf.
6. Ben-Or, M., Goldreich, O., Micali, S., Rivest, R. L.: A fair protocol for signing contracts. IEEE Trans. Inf. Theor. 36(1), 40-46 (1990).
7. Blum, M.: Coin flipping by telephone. In: CRYPTO 1981 (1981).
8. Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236-254. Springer, Heidelberg (2000).
9. Clark, J., Essex, A.: CommitCoin: carbon dating commitments with Bitcoin. In: Keromytis, A. D. (ed.) FC 2012. LNCS, vol. 7397, pp. 390-398. Springer, Heidelberg (2012).
10. Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC '86.
11. Cramer, Ronald: Introduction to secure computation. In: Damgård, Ivan Bjerre (ed.) EEF School 1998. LNCS, vol. 1561, p. 16. Springer, Heidelberg (1999).
12. Damgård, I. B.: Practical and provably secure release of a secret and exchange of signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 200-217. Springer, Heidelberg (1994).
13. Der Spiegel International. Swiss Bank Data: German Tax Officials Launch Nationwide Raids, April 2013.
14. Pfitzmann, B., et al.: Optimal efficiency of optimistic contract signing. In: PODC '98.
15. Miers, I., et al.: Zerocoin: anonymous distributed e-cash from Bitcoin. IEEE S&P (2012).
16. Barber, S., Boyen, X., Shi, E., Uzun, E.: Bitter to better-how to make bitcoin a better currency. In: Keromytis, A. D. (ed.) FC 2012. LNCS, vol. 7397, pp. 399-414. Springer, Heidelberg (2012).
17. Gordon, S., et al.: Complete fairness in secure two-party computation. J. ACM 58(6), 1-37 (2011).
18. Even, S., Yacobi, Y.: Relations among public key signature schemes. Technical report 175, Computer Science Department, Technion, Israel (1980).
19. Garay, J. A., Jakobsson, M.: Timed release of standard digital signatures. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 168-182. Springer, Heidelberg (2003).
20. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987 (1987).
21. Goldreich, O.: The Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004).
22. Goldreich, O., Micali, S., Wigderson, A: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: FOCS '86.
23. Goldreich, O., Vainish, R.: How to solve any protocol problem-an efficiency improvement. In: CRYPTO '87.
24. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186-208 (1989).
25. Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 87-105. Springer, Heidelberg (2003).
26. Bitcoin wiki: Contracts. http://en. bitcoin. it/wiki/Contracts. Accessed 24 Nov 2013.
27. Bitcoin wiki: Dominant Assurance Contracts. http://en. bitcoin. it/wiki/Dominant Assurance Contracts. Accessed 19 Jan 2014.
28. Bitcoin wiki: Transaction malleability. https://en. bitcoin. it/wiki/Transaction Malleability. Accessed 20 Jan 2014.
29. Yao, A. C.-C.: How to generate and exchange secrets. In: FOCS 1986 (1986).
30. Zhou, J., Gollmann, D.: A fair non-repudiation protocol. In: IEEE S&P (1996).
31. Zhou, J., Gollmann, D.: Certified electronic mail. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol. 1146, pp. 160-171. Springer, Heidelberg (1996).