Skip to main content

Generation of Reliable Randomness via Social Phenomena

  • Conference paper
Model and Data Engineering (MEDI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8216))

Included in the following conference series:

Abstract

Randomness is a hot topic in computer science due to its important implications such as cryptography, gambling, hashing algorithms and so on. Due to the implicit determinism of computer systems, randomness can only be simulated. In order to generate reliable random sequences, IT systems have to rely on hardware random number generators. Unfortunately, these devices are not always affordable and suitable in all the circumstances (e.g., personal use, data-intensive systems, mobile devices, etc.). Human-computer interaction (HCI) has recently become bidirectional: computers help human beings in carrying out their issues and human beings support computers in hard tasks. Following this trend, we introduce RandomDB, a database system that is able to generate reliable randomness from social phenomena. RandomDB extracts data from social networks to answer random queries in a flexible way. We prototyped RandomDB and we conducted some experiments in order to show the effectiveness and the advantages of the system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bassham III, L.E., Rukhin, A.L., Soto, J., Nechvatal, J.R., Smid, M.E., Barker, E.B., Leigh, S.D., Levenson, M., Vangel, M., Banks, D.L., Heckert, N.A., Dray, J.F., Vo, S.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. SP 800-22 Rev. 1a (2010)

    Google Scholar 

  2. Boyar, J.: Inferring sequences produced by pseudo-random number generators. J. ACM 36(1), 129–141 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, J.: The Physical Foundation of Economics: An Analytical Thermodynamic Theory. World Scientific Publishing Company (2005)

    Google Scholar 

  4. Dorrendorf, L., Gutterman, Z., Pinkas, B.: Cryptanalysis of the random number generator of the windows operating system. ACM Trans. Inf. Syst. Secur. 13(1) (2009)

    Google Scholar 

  5. Franklin, M.J., Kossmann, D., Kraska, T., Ramesh, S., Xin, R.: CrowdDB: answering queries with crowdsourcing. In: SIGMOD, pp. 61–72 (2011)

    Google Scholar 

  6. Galam, S.: Sociophysics: A Physicist’s Modeling of Psycho-political Phenomena. Springer (2012)

    Google Scholar 

  7. Halprin, R., Naor, M.: Games for extracting randomness. In: SOUPS (2009)

    Google Scholar 

  8. La Cerra, P.: The First Law of Psychology is the Second Law of Thermodynamics: The Energetic Evolutionary Model of the Mind and the Generation of Human Psychological Phenomena. Human Nature Review 3, 440–447 (2003)

    Google Scholar 

  9. L’Ecuyer, P., Simard, R.J.: TestU01: A C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4) (2007)

    Google Scholar 

  10. Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3–30 (1998)

    Article  MATH  Google Scholar 

  11. Maurer, U.M.: A universal statistical test for random bit generators. J. Cryptology 5(2), 89–105 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  12. de Raadt, T., Hallqvist, N., Grabowski, A., Keromytis, A.D., Provos, N.: Cryptography in openbsd: An overview. In: USENIX Annual Technical Conference, FREENIX Track, pp. 93–101 (1999)

    Google Scholar 

  13. Rapoport, A., Budescu, D.V.: Randomization in Individual Choice Behavior. Psychological Review 104(3), 603–617 (1997)

    Article  Google Scholar 

  14. Saito, T., Ishii, K., Tatsuno, I., Sukagawa, S., Yanagita, T.: Randomness and genuine random number generator with self-testing functions (2010), http://csrc.nist.gov/rng/rng2.html

  15. Von Ahn, L., Maurer, B., McMillen, C., Abraham, D., Blum, M.: reCAPTCHA: Human-based character recognition via web security measures. Science 321(5895), 1465–1468 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  16. Yilek, S., Rescorla, E., Shacham, H., Enright, B., Savage, S.: When private keys are public: Results from the 2008 Debian OpenSSL vulnerability. In: Proceedings of IMC 2009, pp. 15–27. ACM Press (November 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Virgilio, R., Maccioni, A. (2013). Generation of Reliable Randomness via Social Phenomena. In: Cuzzocrea, A., Maabout, S. (eds) Model and Data Engineering. MEDI 2013. Lecture Notes in Computer Science, vol 8216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41366-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41366-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41365-0

  • Online ISBN: 978-3-642-41366-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics