How to use bitcoin to incentivize correct computations

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2014, Pages 30-41

  Kumaresan, Ranjit ^a   Bentov, Iddo ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bitcoin; Bounties; Fair exchange; Secure computation; Verifiable computation

Indexed keywords

COMPLEX NETWORKS; CRYPTOGRAPHY;

BOUNTIES; COMPLEXITY MEASURES; COMPUTATIONAL EFFORT; DESIGN PROTOCOLS; FAIR EXCHANGE; FORMAL DEFINITION; SECURE COMPUTATION; SECURITY AND PRIVACY;

BITCOIN;

EID: 84910657489     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2660267.2660380     Document Type: Conference Paper

References (35)

1. Bitcoin wiki: CVEs. https://en.bitcoin.it/wiki/CVEs#CVE-2010-5141.
2. G. Andresen. Turing complete language vs non-turing complete. https://bitcointalk.org/index.php?topic=431513.20#msg4882293.
3. M. Andrychowicz, S. Dziembowski, D. Malinowski, and L. Mazurek. Fair two-party computations via the bitcoin deposits. In First Workshop on Bitcoin Research, FC, 2014.
4. M. Andrychowicz, S. Dziembowski, D. Malinowski, and L. Mazurek. Secure multiparty computations on bitcoin. In IEEE Security and Privacy, 2014.
5. Gilad Asharov, Yehuda Lindell, and Hila Zarosim. Fair and efficient secure multiparty computation with reputation systems. In Asiacrypt (2), pages 201-220, 2013.
6. Gilad Asharov and Claudio Orlandi. Calling out cheaters: Covert security with public verifiability. In Asiacrypt, pages 681-698, 2012.
7. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In Eurocrypt, 1998.
8. Yonatan Aumann and Yehuda Lindell. Security against covert adversaries: Efficient protocols for realistic adversaries. In Salil P. Vadhan, editor, 4th Theory of Cryptography Conference-TCC 2007, volume 4392 of LNCS, pages 137-156. Springer, February 2007.
9. S. Barber, X. Boyen, E. Shi, and E. Uzun. Bitter to better-how to make bitcoin a better currency. In FC, 2012.
10. Mira Belenkiy, Melissa Chase, C. Christopher Erway, John Jannotti, Alptekin Kupcu, and Anna Lysyanskaya. Incentivizing outsourced computation. In NetEcon, pages 85-90, 2008.
11. Iddo Bentov and Ranjit Kumaresan. How to use bitcoin to design fair protocols. In ePrint 2014/129, 2014.
12. D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu, and M. Steiner. Highly-scalable searchable symmetric encryption with support for boolean queries. In Crypto (1), 2013.
13. J.-S. Coron, T. Lepoint, and M. Tibouchi. Practical multlinear maps over the integers. In Crypto (1), 2013.
14. E. Friedman and P. Resnick. The social cost of cheap pseudonyms. In Journal of Economics and Management Strategy, pages 173-199, 2000.
15. S. Garg, C. Gentry, S. Halevi, and D. Wichs. On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In ePrint 2013/860.
16. S. Garg, C. Gentry, A. Sahai, and B. Waters. Witness encryption and its applications. In STOC, 2013.
17. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Advances in Cryptology-Crypto 2010, 2010.
18. R. Gennaro, C. Gentry, B. Parno, and M. Raykova. Quadratic span programs and succinct nizks without pcps. In Eurocrypt, 2013.
19. Oded Goldreich. Foundations of cryptography-vol. 2. 2004.
20. S. Goldwasser, Y. T Kalai, R.Ã. Popa, V. Vaikuntanathan, and N. Zeldovich. How to run turing machines on encrypted data. In Crypto (2), pages 536-553, 2013.
21. Philippe Golle and Ilya Mironov. Uncheatable distributed computations. In David Naccache, editor, Cryptographers' Track-RSA 2001, volume 2020 of LNCS, pages 425-440. Springer, April 2001.
22. V. Goyal, P. Mohassel, and A. Smith. Efficient two party and multi party computation against covert adversaries. In Advances in Cryptology-Eurocrypt 2008.
23. Y. Huang, J. Katz, and D. Evans. Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution. In IEEE Security and Privacy, pages 272-284, 2012.
24. Y. Ishai, M. Prabhakaran, and A. Sahai. Founding cryptography on oblivious transfer-efficiently. In Advances in Cryptology-Crypto 2008, pages 572-591, 2008.
25. S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu, and M. Steiner. Outsourced symmetric private information retrieval. In CCS, pages 875-888.
26. L. Lamport. Fast paxos, 2005. MSR-TR-2005-112.
27. Y. Lindell and B. Pinkas. A proof of security of Yao's protocol for two-party computation. Journal of Cryptology., 22(2):161-188, 2009.
28. G. Maxwell. Zero knowledge contingent payment. 2011. https://en.bitcoin.it/wiki/Zero-Knowledge-Contingent-Payment.
29. P. Mohassel and M. Franklin. Efficiency tradeoffs for malicious two-party computation. In PKC 2006.
30. V. Pappas, B. Vo, F. Krell, S.-G. Choi, V. Kolesnikov, S. Bellovin, A. Keromytis, and T. Malkin. Blind seer: A scalable private dbms. In IEEE Security and Privacy, 2014.
31. B. Parno, J. Howell, C. Gentry, and M. Raykova. Pinocchio: Nearly practical verifiable computation. In IEEE S&P, 2013.
32. R. L. Rivest, A. Shamir, and D. A. Wagner. Time-lock puzzles and timed-release crypto. Technical Report MIT/LCS/TR-684, MIT, 1996.
33. A. Rosen and A. Shelat. Optimistic concurrent zero knowledge. In Advances in Cryptology-Asiacrypt 2010.
34. P. Todd. Reward offered for hash collisions for sha1, sha256, ripemd160. https://bitcointalk.org/index.php?topic=293382.0, 2013.
35. Andrew Yao. How to generate and exchange secrets (extended abstract). In FOCS, pages 162-167, 1986.