Ran Halprin
Moni Naor
Abstract
Two computer scientists have created a video game about mice and elephants that can make computer encryption properly secure---as long as you play it randomly.
- Barak, B. and Halevi, S. 2005. A model and architecture for pseudo-random generation and applications to /dev/random. ACM Conf. Computer and Comm. Security, 203"U--212. Google Scholar
Digital Library
- Barraclough, D., Conroy, M., and Lee, D. 2004. Prefrontal cortex and decision making in a mixed-strategy game. Nature Neuroscience 7, 4, 404--410.Google ScholarCross Ref
- Bernstein, G. and Lieberman, M. 1990. Secure random number generation using chaotic circuits. Circuits and Systems, IEEE Transactions on 37, 9, 1157--1164.Google Scholar
- Burns, B. and Corpus, B. 2004. Randomness and induction from streaks: "gambler's fallacy" versus "hot hand". Psychonomic Bulletin and Review 11, 179--184.Google ScholarCross Ref
- Eliaz, K. and Rubinstein, A. 2008. Edgar Allen Poe's Riddle: Do Guessers Outperform Misleaders in a Repeated Matching Pennies Game? http://arielrubinstein.tau.ac.il/papers/poe.pdf.Google Scholar
- Falk, R. and Konold, C. 1997. Making sense of randomness: Implicit encoding as a basis for judgment. Psychological Review 104, 2 {April}, 301--318.Google ScholarCross Ref
- Figurska, M., Stanczyk, M., and Kulesza, K. 2008. Humans cannot consciously generate random numbers sequences: Polemic study. Medical Hypotheses 70, 1, 182--185.Google ScholarCross Ref
- Flood, M., Lendenmann, K., and Rapoport, A. 1983. 2x2 Games played by rats: different delays of reinforcement as payoffs. Behav Sci 28, 65--78.Google ScholarCross Ref
- Glimcher, P., Dorris, M., and Bayer, H. 2005. Physiological utility theory and the neuroeconomics of choice. Games and Economic Behavior 52, 2, 213--256.Google ScholarCross Ref
- Goldberg, I. and Wagner, D. 1996. Randomness and the netscape browser. Dr. Dobb's Journal, 66--70.Google Scholar
- Haahr, M. Random.org: true random number service. http://www.random.org.Google Scholar
- Halprin, R. and Naor, M. 2009. Games for extracting randomness. In Proceedings of the 5th Symposium on Usable Privacy and Security, article 12, California. Google ScholarDigital Library
- Katz, J. and Lindell, Y. 2008. Introduction to modern cryptography. Chapman & Hall/CRC. Google ScholarDigital Library
- Noll, L., Mende, R., Sisodiya, S., et al. 1998. Method for seeding a pseudo-random number generator with a cryptographic hash of a digitization of a chaotic system. US Patent 5,732,138.Google Scholar
- Rapoport, A. and Budescu, D. 1992. Generation of random series in two-person strictl competitive games. Journal of Experimental Psychology: General 121, 3, 352--363.Google ScholarCross Ref
- Rapoport, A. and Budescu, D. 1997. Randomization in individual choice behavior. Psychological Review 104, 1, 603--617.Google ScholarCross Ref
- Shaltiel, R. 2004. Recent developments in explicit constructions of extractors. Current Trends in Theoretical Computer Science: The Challenge of the New Century. Google ScholarDigital Library
- Tversky, A. and Gilovich, T. 2004. The "Hot Hand": Statistical Reality or Cognitive Illusion? Preference, Belief, and Similarity: Selected Writings.Google Scholar
- von Neumann, J. 1951. Various techniques used in connection with random digits. Applied Math Series 12, 36--38.Google Scholar
- Weimer, F. New openssl packages fix predictable random number generator. http://lists.debian.org/debian-securityannounce/2008/msg00152.html.Google Scholar
Index Terms
- Games for extracting randomness
Recommendations
Games for extracting randomness
SOUPS '09: Proceedings of the 5th Symposium on Usable Privacy and SecurityRandomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous problems. We suggest utilizing the behavior of humans while playing ...
Extracting Randomness
Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related “dispersers,” exhibit some of the most “...
When Can Limited Randomness Be Used in Repeated Games?
The central result of classical game theory states that every finite normal form game has a Nash equilibrium, provided that players are allowed to use randomized (mixed) strategies. However, in practice, humans are known to be bad at generating random-...
Comments