Communications of the ACM

84 COMMUNICATIONS OF THE ACM | APRIL 2016 | VOL. 59 | NO. 4 previous version of our lottery. We are also very grateful to David Wagner for carefully reading our paper and for several useful remarks.

References

1. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, Ł. Fair two-party computations via bitcoin deposits. In 1st Workshop on Bitcoin Research (Christ Church, Barbados, March 7, 2014), Springer, Berlin, Germany, 105–121.

2. Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, Ł. On the malleability of bitcoin transactions.

In 2nd Workshop on Bitcoin Research (San Juan, Puerto Rico, January 30,

2015), Springer, Berlin, Germany.

3. Back, A., Bentov, I. Note on fair coin toss via bitcoin, 2013. http:// www.cs.technion.ac.il/~idddo/ cointossBitcoin.pdf.

4. Ben-David, A., Nisan, N., Pinkas, B. FairplayMP: A system for secure multi-party computation. In ACM CCS 08: 15th Conference on Computer and Communications Security (Alexandria, VA, October

27–31, 2008), ACM, NY, 257–266.

5. Bentov, I., Kumaresan, R. How to use bitcoin to design fair protocols.

In Advances in Cryptology – CRYPTO,

2014. Part II (Santa Barbara, CA, August 17–21, 2014), Springer, Berlin, Germany, 421–439.

6. Blum, M. Coin flipping by telephone. In

Advances in Cryptology – CRYPTO’ 81

(Santa Barbara, CA, 1981), U.C. Santa Barbara, Department of Electrical and Computer Engineering, 11–15.

7. Bogetoft, P., et al. Secure multiparty computation goes live. In FC 2009:

13th International Conference on Financial Cryptography and Data Security (Accra Beach, Barbados, February 23–26, 2009), Springer, Berlin, Germany, 325–343.

8. Boneh, D., Naor, M. Timed commitments. In Advances in Cryptology – CRYPTO 2000 (Santa Barbara, CA, August 20–24, 2000), Springer, Berlin, Germany, 236–254.

9. Cleve, R. Limits on the security of coin flips when half the processors are faulty. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC ’ 86 (Berkeley, CA, May 28–30, 1986), ACM, NY, 364–369.

10. Damgård, I., et al. Practical covertly secure MPC for dishonest majority — Or: Breaking the SPDZ limits. In ESORICS

2013: 18th European Symposium on Research in Computer Security

(Egham, UK, September 9–13, 2013), Springer, Berlin, Germany, 1–18.

11. Douceur, J.R. The sybil attack. In First International Workshop on Peer-to-Peer Systems, IPTPS ’01, 2002.

12. Friedman, E. J., Resnick, P. The social cost of cheap pseudonyms. J. Econ. Manage. Strat. 10 (2000), 173–199.

13. Garay, J.A., Jakobsson, M. Timed release of standard digital signatures.

In FC 2002: 6th International Conference on Financial Cryptography

(Southampton, Bermuda, March

Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, and Łukasz Mazurek

({ marcin.andrychowicz, stefan.dziembowski, daniel.malinowski, lukasz.mazurek}@ crypto.edu.pl), Institute of Informatics, University of Warsaw, Warsaw, Poland.

11–14, 2003), Springer, Berlin, Germany, 168–182.

14. Goldreich, O., Micali, S., Wigderson, A.

How to play any mental game or A completeness theorem for protocols with honest majority. In 19th Annual ACM Symposium on Theory of

Computing (New York City, NY, May

25–27, 1987), ACM, NY, 218–229.

15. Kumaresan, R., Bentov, I. How to use bitcoin to incentivize correct computations. In ACM CCS 2014

(Scottsdale, AZ, November 3–7,

2014), ACM, N Y, 30–41.

16. Malkhi, D., Nisan, N., Pinkas, B.,
Sella, Y. Fairplay – A secure two-
party computation system. In 13th
Conference on USENIX Security
Symposium, SSYM’04 (San Diego,
CA, August 9–13, 2004), USENIX
Association, 287–302.

17. Nakamoto, S. Bitcoin: A peer-
to-peer electronic cash system.
The Cryptography Mailing List, 2008.
18. Post, T. W. Cheating scandals raise
new questions about honesty, security
of internet gambling. The Washington
Post November 30, 2008.
19. Resnick, P., Kuwabara, K., Zeckhauser, R.,
Friedman, E. Reputation systems.
Commun. ACM 43, 12 (Dec. 2000) 45–48
20. Yao, A.C.-C. How to generate and
exchange secrets (extended abstract).
In 27th Annual Symposium on
Foundations of Computer Science
(Toronto, ON, Canada, October 27–29,
1986), IEEE Computer Society Press,
162–167.

Copyright held by authors. Publication rights licensed to ACM. $15.00.

A personal walk down the computer industry road.

BY AN EYEWITNESS.

Smarter Than Their Machines: Oral Histories of the Pioneers of Interactive Computing is based on oral histories archived at the Charles Babbage Institute, University of Minnesota.

These oral histories contain important messages for our leaders of today, at all levels, including that government, industry, and academia can accomplish great things when working together in an effective way.