ACM Computing Surveys (CSUR)
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Labeling images with a computer game
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Preface: Fitts' law 50 years later: Applications and contributions from human-computer interaction
International Journal of Human-Computer Studies - Special issue: Fitts law 50 years later: Applications and contributions from human-computer interaction
International Journal of Human-Computer Studies - Special issue: Fitts law 50 years later: Applications and contributions from human-computer interaction
A model and architecture for pseudo-random generation with applications to /dev/random
Proceedings of the 12th ACM conference on Computer and communications security
Analysis of the Linux Random Number Generator
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Computer
Timing analysis of keystrokes and timing attacks on SSH
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Cryptography in OpenBSD: an overview
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Cryptanalysis of the windows random number generator
Proceedings of the 14th ACM conference on Computer and communications security
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
Shake Well Before Use: Intuitive and Secure Pairing of Mobile Devices
IEEE Transactions on Mobile Computing
Games for extracting randomness
XRDS: Crossroads, The ACM Magazine for Students - Comp-YOU-Ter
Accelerometers and randomness: perfect together
Proceedings of the fourth ACM conference on Wireless network security
A novel model by evolving partially connected neural network for stock price trend forecasting
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Randomness 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 competitive games as an entropy source, in order to enhance the quality of the randomness in the system. This idea has two motivations: (i) results in experimental psychology indicate that humans are able to behave quite randomly when engaged in competitive games in which a mixed strategy is optimal, and (ii) people have an affection for games, and this leads to longer play yielding more entropy overall. While the resulting strings are not perfectly random, we show how to integrate such a game into a robust pseudo-random generator that enjoys backward and forward security. We construct a game suitable for randomness extraction, and test users playing patterns. The results show that in less than two minutes a human can generate 128 bits that are 2-64-close to random, even on a limited computer such as a PDA that might have no other entropy source. As proof of concept, we supply a complete working software for a robust PRG. It generates random sequences based solely on human game play, and thus does not depend on the Operating System or any external factor.