Abstract
True Randomness Generators (TRG) use the output of an entropy source to generate a sequence of symbols that is sufficiently close to a uniformly random sequence, and so can be securely used in applications that require unpredictability of each symbol. A TRG algorithm generally consists of (i) an entropy source and (ii) an extractor algorithm that uses a random seed to extract the randomness of the entropy source. We propose a TRG that uses the user input in a game played between the user and the computer both as the output of an entropy source, and the random seed required for the extractor. An important property of this TRG is that the (randomness) quality of its output can be flexibly adjusted. We describe the theoretical foundation of the approach and design and implement a game that instantiates the approach. We give the results of our experiments with users playing the game, and analysis of the resulting output strings. Our results support effectiveness of the approach in generating high quality randomness. We discuss our results and propose directions for future work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Barak, B.: Computational complexity: a modern approach, vol. 1. Cambridge University Press, Cambridge (2009)
Alimomeni, M.: Sheep-wolf game to generate true random numbers by human (2013), http://pages.cpsc.ucalgary.ca/~malimome/expander/
Barker, E., Kelsey, J.: Recommendation for the entropy sources used for random bit generation (August 2012), http://csrc.nist.gov/publications/drafts/800-90/draft-sp800-90b.pdf
Barak, B., Shaltiel, R., Tromer, E.: True random number generators secure in a changing environment. In: Walter, C.D., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 166–180. Springer, Heidelberg (2003)
Dorrendorf, L., Gutterman, Z., Pinkas, B.: Cryptanalysis of the random number generator of the windows operating system. ACM Trans. Inf. Syst. Secur. 13(1), 10:1–10:32 (2009)
Rukhin, et al.: A statistical test suite for the validation of random number generators and pseudo random number generators for cryptographic applications (2010), http://csrc.nist.gov/groups/ST/toolkit/rng/documents/SP800-22rev1a.pdf .
Goldberg, I., David, W.: Randomness and the netscape browser, http://www.cs.berkeley.edu/~daw/papers/ddj-netscape.html
Gutterman, Z., Pinkas, B., Reinman, T.: Analysis of the linux random number generator. In: 2006 IEEE Symposium on Security and Privacy, p. 15. IEEE (2006)
Heninger, N., Durumeric, Z., Wustrow, E., Alex Halderman, J.: Mining your ps and qs: detection of widespread weak keys in network devices. In: Proceedings of the 21st USENIX Conference on Security Symposium, Security 2012, p. 35. USENIX Association, Berkeley (2012)
Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their application. Bulletin of the AMS 43(4), 439–561 (2006)
Halprin, R., Naor, M.: Games for extracting randomness. In: Proceedings of the 5th Symposium on Usable Privacy and Security, p. 12. ACM (2009)
Lenstra, A.K., Hughes, J.P., Augier, M., Bos, J.W., Kleinjung, T., Wachter, C.: Public keys. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 626–642. Springer, Heidelberg (2012)
Lubotzky, A., Phillips, R., Sarnak, P.: Explicit expanders and the ramanujan conjectures. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 240–246. ACM (1986)
L’Ecuyerand, P., Simard, R.: Testu01 (August 2007), http://www.iro.umontreal.ca/~simardr/testu01/tu01.html
L’Ecuyer, P., Simard, R.: Testu01: A c library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4) (August 2007)
Marsaglia, G.: Diehard (1998), http://www.stat.fsu.edu/pub/diehard/
Microsoft. Windows random number generator, http://msdn.microsoft.com/en-us/library/aa379942.aspx
Osborne, M.J.: An introduction to game theory, vol. 3. Oxford University Press, Oxford (2004)
Rapoport, A., Budescu, D.V.: Generation of random series in two-person strictly competitive games. Journal of Experimental Psychology: General 121(3), 352 (1992)
Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In: Proceedings of 41st Annual Symposium on Foundations of Computer Science, pp. 3–13 (2000)
Shaltiel, R.: An introduction to randomness extractors. Automata, Languages and Programming, 21–41 (2011)
von Neumann, J.: Various techniques used in connection with random digits. J. Research Nat. Bur. Stand., Appl. Math. Series 12, 36–38 (1951)
Wagenaar, W.A.: Generation of random sequences by human subjects: A critical survey of literature. Psychological Bulletin 77(1), 65 (1972)
Zhou, Q., Liao, X., wo Wong, K., Hu, Y., Xiao, D.: True random number generator based on mouse movement and chaotic hash function. Information Sciences 179(19), 3442–3450 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Alimomeni, M., Safavi-Naini, R., Sharifian, S. (2013). A True Random Generator Using Human Gameplay. In: Das, S.K., Nita-Rotaru, C., Kantarcioglu, M. (eds) Decision and Game Theory for Security. GameSec 2013. Lecture Notes in Computer Science, vol 8252. Springer, Cham. https://doi.org/10.1007/978-3-319-02786-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-02786-9_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02785-2
Online ISBN: 978-3-319-02786-9
eBook Packages: Computer ScienceComputer Science (R0)