Games for extracting randomness

SOUPS 2009 - Proceedings of the 5th Symposium On Usable Privacy and Security

Volumn , Issue , 2009, Pages

  Halprin, Ran ^a   Naor, Moni ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE GAMES; COMPUTATIONAL TASK; ENTROPY SOURCES; EXTERNAL FACTORS; MIXED STRATEGY; OPERATING SYSTEMS; PROOF OF CONCEPT; PSEUDORANDOM GENERATORS; RANDOM SEQUENCE;

COMPUTER OPERATING SYSTEMS;

ENTROPY;

EID: 70350731258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1572532.1572548     Document Type: Conference Paper

References (43)

1. R. Motwani and P. Raghavan, "Randomized algorithms," ACM Computing Surveys (CSUR), vol. 28, no. 1, pp. 33-37, 1996.
2. O. Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer, 1999.
3. S. Rajasekaran, Handbook of Randomized Computing. Kluwer Academic Publishers, 2001.
4. J. Gentle, Random Number Generation and Monte Carlo Methods. Springer, 2003.
5. A. Ferrenberg, D. Landau, and Y. Wong, "Monte carlo simulations: Hidden errors from "good" random number generators," Phys. Rev. Lett., vol. 69, pp. 3382-3384, Dec 1992.
6. I. Goldberg and D. Wagner, "Randomness and the netscape browser," Dr. Dobb's, pp. 66-70, January 1996.
7. Z. Gutterman, B. Pinkas, and T. Reinman, "Analysis of the linux random number generator," in IEEE Symposium on Security and Privacy, pp. 371-385, IEEE Computer Society, 2006.
8. H. Shacham and B. Enright, "The debian openssl bug and its effect on ssl." http://www.usenix.org/events/sec08/wips.html, 2008.
9. F. Weimer, "New openssl packages fix predictable random number generator." http://lists.debian.org/debian-security-announce/2008/msg00152. html.
10. P. Zimmermann, "Pgp(tm) user's guide." ftp://ftp.pgpi.org/pub/ pgp/2.x/doc/pgpdoc1.txt.
11. D. X. Song, D. Wagner, and X. Tian, "Timing analysis of keystrokes and timing attacks on ssh," in SSYM'01: Proceedings of the 10th conference on USENIX Security Symposium, (Berkeley, CA, USA), pp. 25-25, USENIX Association, 2001.
12. T. de Raadt, N. Hallqvist, A. Grabowski, A. Keromytis, and N. Provos, "Cryptography in OpenBSD: An Overview," Proc. of the 1999 USENIX Annual Technical Conference, Freenix Track, pp. 93-101, 1999.
13. L. Dorrendorf, Z. Gutterman, and B. Pinkas, "Cryptanalysis of the windows random number generator," in ACM Conference on Computer and Communications Security (P. Ning, S. D. C. di Vimercati, and P. F. Syverson, eds.), pp. 476-485, ACM, 2007.
14. M. Haahr, "Random.org - true random number service." http://www.random.org.
15. G. Bernstein and M. Lieberman, "Secure random number generation using chaotic circuits," Circuits and Systems, IEEE Transactions on, vol. 37, no. 9, pp. 1157-1164, 1990.
16. L. Noll, R. Mende, S. Sisodiya, et al., "Method for seeding a pseudo-random number generator with a cryptographic hash of a digitization of a chaotic system." US Patent 5,732,138, 1998.
17. W. Wagenaar, "Generation of random sequences by human subjects: A critical survey of literature," Psychological Bulletin, vol. 77, pp. 65-72, 1972.
18. D. Munger, "Is 17 the "most random" number?." scienceblogs.com, specifically http://scienceblogs.com/cognitivedaily/2007/02/ index.php?page=3, Feburary 2007.
19. R. Falk and C. Konold, "Making sense of randomness: Implicit encoding as a basis for judgment," Psychological Review, vol. 104, pp. 301-318, April 1997.
20. B. Burns and B. Corpus, "Randomness and induction from streaks: "gambler's fallacy" versus "hot hand"," Psychonomic Bulletin and Review, vol. 11, pp. 179-184, 2004.
21. A. Tversky and T. Gilovich, "The "Hot Hand": Statistical Reality or Cognitive Illusion?," Preference, Belief, and Similarity: Selected Writings, 2004.
22. A. Rapoport and D. Budescu, "Randomization in individual choice behavior," Psychological Review, vol. 104, no. 1, pp. 603-617, 1997.
23. M. Figurska, M. Stańczyk, and K. Kulesza, "Humans cannot consciously generate random numbers sequences: Polemic study," Medical Hypotheses, vol. 70, no. 1, pp. 182-185, 2008.
24. D. Green, "Testing Randomness," Teaching Mathematics and its Applications, vol. 1, no. 3, pp. 95-100, 1982.
25. A. Rapoport and D. Budescu, "Generation of random series in two-person strictl competitive games," Journal of Experimental Psychology: General, vol. 121, no. 3, pp. 352-363, 1992.
26. K. Eliaz and A. Rubinstein, "Edgar Allen Poe's Riddle: Do Guessers Outperform Misleaders in a Repeated Matching Pennies Game?." http://arielrubinstein.tau.ac.il/papers/poe.pdf, Feb. 2008.
27. L. von Ahn, "Games with a purpose," Computer, vol. 39, pp. 92-94, June 2006.
28. B. Barak and S. Halevi, "A model and architecture for pseudo-random generation and applications to /dev/random," ACM Conf. Computer and Comm. Security, pp. 203-U-212, 2005.
29. J. von Neumann, "Various techniques used in connection with random digits," Applied Math Series, vol. 12, pp. 36-38, 1951.
30. R. Shaltiel, "Recent developments in explicit constructions of extractors," Current Trends in Theoretical Computer Science: The Challenge of the New Century, 2004.
31. B. Barak, R. Shaltiel, and E. Tromer, "True random number generators secure in a changing environment." Cryptographic Hardware and Embedded Systems - proc. CHES 2003, LNCS 2779, 166-180, Springer, 2003.
32. P. Miltersen and T. Sørensen, "A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament," Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, 2007.
33. J. Schaeffer, N. Burch, Y. Bjornsson, A. Kishimoto, M. Muller, R. Lake, P. Lu, and S. Sutphen, "Checkers Is Solved," Science, vol. 317, no. 5844, p. 1518, 2007.
34. P. Ayton and R. Falk, "Subjective Randomness in Hide-and-Seek Games," Book of Abstracts of the 15th Bi-annual Conference on Subjective Probability, Utility and Decision-Making, p. 37, 1995.
35. A. Rubinstein, A. Tversky, and D. Heller, "Naive strategies in competitive games," Understanding Strategic Interaction - Essays in Honor of Reinhard Selten, W.Guth et al. (editors), pp. 394-402, 1996.
36. G. Costikyan, "I have no words and i must design." Interactive Fantasy vol. 2 (1994), available at http://www.costik.com/nowords.html.
37. Y. Guiard and M. Beaudouin-Lafon, "Fitts' law 50 years later: applications and contributions from human-computer interaction," International Journal of Human-Computer Studies, vol. 61, no. 6, pp. 747-750, 2004.
38. R. corp., "A million random digits with 100,000 normal deviates." http://www.rand.org/pubs/monograph reports/MR1418/ (Accessed October 2008), 1955.
39. G. Marsaglia, "DIEHARD: A Battery of Tests of Randomness," See http://statf.su.edu/~geo/diehard.html, 1996.
40. L. von Ahn and L. Dabbish, "Labeling images with a computer game," in CHI (E. Dykstra-Erickson and M. Tscheligi, eds.), pp. 319-326, ACM, 2004.
41. D. Kirovski, M. Sinclair, and D. Wilson, "The Martini Synch," tech. rep., Technical report MSR-TR-2007-123, Microsoft Research, 2007.
42. R. Mayrhofer and H. Gellersen, "Shake well before use: Intuitive and secure pairing of mobile devices," IEEE Transactions on Mobile Computing, vol. 8, no. 6, pp. 792-806, 2009.
43. S. Zhai, J. Kong, and X. Ren, "Speed-accuracy tradeoff in fitts' law tasks: on the equivalency of actual and nominal pointing precision," Int. J. Hum.-Comput. Stud., vol. 61, no. 6, pp. 823-856, 2004.