{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:26Z","timestamp":1740109286365,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T00:00:00Z","timestamp":1506038400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"European Research Council (BE)","award":["339539"],"award-info":[{"award-number":["339539"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00446-017-0311-5","type":"journal-article","created":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T22:27:26Z","timestamp":1506032846000},"page":"389-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The entropy of a distributed computation random number generation from memory interleaving"],"prefix":"10.1007","volume":"31","author":[{"given":"Karolos","family":"Antoniadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9213-2331","authenticated-orcid":false,"given":"Peva","family":"Blanchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Stainer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,22]]},"reference":[{"key":"311_CR1","unstructured":"DieHarder: A random number test suite. \n                        http:\/\/www.phy.duke.edu\/~rgb\/General\/dieharder.php"},{"key":"311_CR2","unstructured":"ENT\u2014a pseudorandom number sequence test program. \n                        http:\/\/fourmilab.ch\/random"},{"key":"311_CR3","unstructured":"ID Quantique\u2014quantum-safe crypto-photon counting\u2014randomness. \n                        http:\/\/www.idquantique.com\/"},{"key":"311_CR4","unstructured":"Tails bug report #7675. \n                        https:\/\/labs.riseup.net\/code\/issues\/7675"},{"key":"311_CR5","unstructured":"Tor bug report #10402. \n                        https:\/\/trac.torproject.org\/projects\/tor\/ticket\/10402"},{"key":"311_CR6","unstructured":"Intel Digital Random Number Generator (DRNG) Software Implementation Guide. \n                        https:\/\/software.intel.com\/sites\/default\/files\/m\/d\/4\/1\/d\/8\/441_Intel_R__DRNG_Software_Implementation_Guide_final_Aug7.pdf\n                        \n                     (2012)"},{"issue":"4","key":"311_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1511\/2014.109.266","volume":"102","author":"S Aaronson","year":"2014","unstructured":"Aaronson, S.: Quantum randomness. Am. Sci. 102(4), 266 (2014). doi:\n                        10.1511\/2014.109.266","journal-title":"Am. Sci."},{"issue":"3","key":"311_CR8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1511\/2014.108.170","volume":"102","author":"S Aaronson","year":"2014","unstructured":"Aaronson, S.: The quest for randomness. Am. Sci. 102(3), 170 (2014). doi:\n                        10.1511\/2014.108.170","journal-title":"Am. Sci."},{"key":"311_CR9","doi-asserted-by":"publisher","unstructured":"Abbes, S.: The information rate of asynchronous sources. In: Information and Communication Technologies, 2006. ICTTA \u201906. 2nd, vol.\u00a02, pp. 3463\u20133467. IEEE, Damascus, 24\u201328 Apr (2006). doi:\n                        10.1109\/ICTTA.2006.1684974","DOI":"10.1109\/ICTTA.2006.1684974"},{"key":"311_CR10","doi-asserted-by":"publisher","unstructured":"Agafin, S., Krasnopevtsev, A.: Memory access time as entropy source for RNG. In: Proceedings of the 7th International Conference on Security of Information and Networks, SIN \u201914, pp. 176:176\u2013176:179. ACM, New York, NY, USA (2014). doi:\n                        10.1145\/2659651.2659695","DOI":"10.1145\/2659651.2659695"},{"key":"311_CR11","doi-asserted-by":"publisher","unstructured":"Alistarh, D., Censor-Hillel, K., Shavit, N.: Are lock-free concurrent algorithms practically wait-free? In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31\u2013June 03, 2014, pp. 714\u2013723 (2014). doi:\n                        10.1145\/2591796.2591836","DOI":"10.1145\/2591796.2591836"},{"key":"311_CR12","doi-asserted-by":"publisher","unstructured":"Alistarh, D., Sauerwald, T., Vojnovic, M.: Lock-free algorithms under stochastic schedulers. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\u00e1n, Spain, July 21\u201323, 2015, pp. 251\u2013260 (2015). doi:\n                        10.1145\/2767386.2767430","DOI":"10.1145\/2767386.2767430"},{"issue":"4","key":"311_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1924421.1924427","volume":"54","author":"G Anthes","year":"2011","unstructured":"Anthes, G.: The quest for randomness. Commun. ACM 54(4), 13\u201315 (2011). doi:\n                        10.1145\/1924421.1924427","journal-title":"Commun. ACM"},{"issue":"1","key":"311_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/S0196-6774(02)00220-1","volume":"45","author":"J Aspnes","year":"2002","unstructured":"Aspnes, J.: Fast deterministic consensus in a noisy environment. J. Algorithms 45(1), 16\u201339 (2002). doi:\n                        10.1016\/S0196-6774(02)00220-1","journal-title":"J. Algorithms"},{"key":"311_CR15","unstructured":"Barker, E., Kelsley, J.: Recommendation for random bit generator (rbg) constructions. SP 800-90C (2012)"},{"key":"311_CR16","doi-asserted-by":"crossref","unstructured":"Barker, E., Kelsley, J.: Recommendation for random number generation using deterministic random bit generators. SP 800-90A (2012)","DOI":"10.6028\/NIST.SP.800-90a"},{"key":"311_CR17","unstructured":"Barker, E., Kelsley, J.: Recommendation for the entropy sources used for random bit generation. SP 800-90B (2012)"},{"issue":"5","key":"311_CR18","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/s11241-011-9129-6","volume":"47","author":"B Bhat","year":"2011","unstructured":"Bhat, B., Mueller, F.: Making DRAM refresh predictable. Real Time Syst. 47(5), 430\u2013453 (2011). doi:\n                        10.1007\/s11241-011-9129-6","journal-title":"Real Time Syst."},{"key":"311_CR19","doi-asserted-by":"publisher","unstructured":"Blanchard, P., Guerraoui, R., Stainer, J., Zablotchi, I.: The disclosure power of shared objects. In: Networked Systems\u20145th International Conference, NETYS 2017, Marrakech, Morocco, May 17\u201319, 2017, Proceedings, pp. 222\u2013227 (2017). doi:\n                        10.1007\/978-3-319-59647-1_17","DOI":"10.1007\/978-3-319-59647-1_17"},{"key":"311_CR20","doi-asserted-by":"publisher","unstructured":"Colesa, A., Tudoran, R., Banescu, S.: Software random number generation based on race conditions. In: SYNASC 2008, 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, 26\u201329 September 2008, pp. 439\u2013444 (2008). doi:\n                        10.1109\/SYNASC.2008.36","DOI":"10.1109\/SYNASC.2008.36"},{"key":"311_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48658-5_13","volume-title":"Advances in Cryptology\u2014CRYPTO \u201994, Lecture Notes in Computer","author":"D Davis","year":"1994","unstructured":"Davis, D., Ihaka, R., Fenstermacher, P.: Cryptographic randomness from air turbulence in disk drives. In: Desmedt, Y. (ed.) Advances in Cryptology\u2014CRYPTO \u201994, Lecture Notes in Computer, vol. 839, pp. 114\u2013120. Springer, Berlin (1994). doi:\n                        10.1007\/3-540-48658-5_13"},{"key":"311_CR22","doi-asserted-by":"publisher","unstructured":"Devietti, J., Lucia, B., Ceze, L., Oskin, M.: DMP: Deterministic shared memory multiprocessing. In: Proceedings of the 14th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS XIV, pp. 85\u201396. ACM, New York, NY, USA (2009). doi:\n                        10.1145\/1508244.1508255","DOI":"10.1145\/1508244.1508255"},{"issue":"2","key":"311_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00124891","volume":"2","author":"W Diffie","year":"1992","unstructured":"Diffie, W., Van Oorschot, P., Wiener, M.: Authentication and authenticated key exchanges. Des. Codes Cryptogr. 2(2), 107\u2013125 (1992). doi:\n                        10.1007\/BF00124891","journal-title":"Des. Codes Cryptogr."},{"key":"311_CR24","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation Onion Router. \n                        https:\/\/svn.torproject.org\/svn\/projects\/design-paper\/tor-design.html"},{"key":"311_CR25","unstructured":"Fidge, C.J.: Timestamps in message passing systems that preserve the partial ordering. In: Australian Computer Science Conference (1988)"},{"issue":"2","key":"311_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0020-0190(98)00143-4","volume":"68","author":"CJ Fidge","year":"1998","unstructured":"Fidge, C.J.: A limitation of vector timestamps for reconstructing distributed computations. Inf. Process. Lett. 68(2), 87\u201391 (1998). doi:\n                        10.1016\/S0020-0190(98)00143-4","journal-title":"Inf. Process. Lett."},{"key":"311_CR27","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Michael, A.: Sacrificing serializability to attain high availability of data. In: Proceedings of the ACM Symposium on Principles of Database Systems, March 29\u201331, 1982, Los Angeles, California, USA, pp. 70\u201375 (1982). doi:\n                        10.1145\/588111.588124","DOI":"10.1145\/588111.588124"},{"key":"311_CR28","unstructured":"Goubault, E.: Geometry and concurrency: a user\u2019s guide. Math. Struct. Comput. Sci. 10(4), 411\u2013425 (2000). \n                        http:\/\/journals.cambridge.org\/action\/displayAbstract?aid=54593"},{"key":"311_CR29","doi-asserted-by":"publisher","unstructured":"Gutterman, Z., Pinkas, B., Reinman, T.: Analysis of the Linux Random Number Generator. In: 2006 IEEE Symposium on Security and Privacy (S&P 2006), 21\u201324 May 2006, Berkeley, California, USA, pp. 371\u2013385 (2006). doi:\n                        10.1109\/SP.2006.5","DOI":"10.1109\/SP.2006.5"},{"key":"311_CR30","unstructured":"Heninger, N., Durumeric, Z., Wustrow, E., Halderman, J.A.: Mining your Ps and Qs: detection of widespread weak keys in network devices. In: Presented as part of the 21st USENIX Security Symposium (USENIX Security 12), pp. 205\u2013220. USENIX, Bellevue, WA (2012). \n                        https:\/\/www.usenix.org\/conference\/usenixsecurity12\/technical-sessions\/presentation\/heninger"},{"key":"311_CR31","unstructured":"Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann (2013). \n                        https:\/\/store.elsevier.com\/product.jsp?isbn=9780124045781"},{"issue":"3","key":"311_CR32","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990). doi:\n                        10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"311_CR33","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Shriver, E., Hillyer, B.K., Juels, A.: A practical secure physical random bit generator. In: Fifth ACM Conference on Computer and Communications Security pp. 103\u2013111 (1998)","DOI":"10.1145\/288090.288114"},{"issue":"7","key":"311_CR34","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978). doi:\n                        10.1145\/359545.359563","journal-title":"Commun. ACM"},{"key":"311_CR35","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem\u2014part I: a theory of interprocess communication. J. ACM 33, 313\u2013326 (1986)","journal-title":"J. ACM"},{"key":"311_CR36","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem\u2014part II: statement and solutions. J. ACM 33, 327\u2013348 (1986)","journal-title":"J. ACM"},{"key":"311_CR37","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. Distrib. Comput. 1, 86\u2013101 (1986)","journal-title":"Distrib. Comput."},{"key":"311_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"issue":"2","key":"311_CR39","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0743-7315(92)90030-Q","volume":"16","author":"M Lu","year":"1992","unstructured":"Lu, M., Fang, J.Z.: A solution of the cache ping-pong problem in multiprocessor systems. J. Parallel Distrib. Comput. 16(2), 158\u2013171 (1992)","journal-title":"J. Parallel Distrib. Comput."},{"key":"311_CR40","volume-title":"Pseudorandomness and Cryptographic Applications","author":"MG Luby","year":"1994","unstructured":"Luby, M.G., Michael, L.: Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton (1994)"},{"key":"311_CR41","doi-asserted-by":"publisher","unstructured":"Marandi, A., Leindecker, N.C., Vodopyanov, K.L., Byer, R.L.: All-optical quantum random bit generation from intrinsically binary phase of parametric oscillators. Opt. Express 20(17), 19,322\u201319,330 (2012). doi:\n                        10.1364\/OE.20.019322\n                        \n                    . \n                        http:\/\/www.opticsexpress.org\/abstract.cfm?URI=oe-20-17-19322","DOI":"10.1364\/OE.20.019322"},{"key":"311_CR42","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics, and Computation","author":"M Mezard","year":"2009","unstructured":"Mezard, M., Montanari, A.: Information, Physics, and Computation. Oxford University Press Inc., New York (2009)"},{"key":"311_CR43","unstructured":"M\u00fcller, S.: Cpu time jitter based non-physical true random number generator. In: Ottawa Linux Symposium (2014)"},{"key":"311_CR44","first-page":"36","volume":"12","author":"JV Neumann","year":"1951","unstructured":"Neumann, J.V.: Various techniques used in connection with random digits. Appl. Math. Ser. 12, 36\u201338 (1951)","journal-title":"Appl. Math. Ser."},{"issue":"1","key":"311_CR45","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43\u201352 (1996). doi:\n                        10.1006\/jcss.1996.0004","journal-title":"J. Comput. Syst. Sci."},{"key":"311_CR46","unstructured":"Potter, B., Wood, S.: Understanding and managing entropy usage. BlackHat, Las Vegas, Navada (2015)"},{"key":"311_CR47","doi-asserted-by":"publisher","unstructured":"Pratt, V.R.: Modeling concurrency with geometry. In: Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, January 21\u201323, 1991, pp. 311\u2013322 (1991). doi:\n                        10.1145\/99583.99625","DOI":"10.1145\/99583.99625"},{"key":"311_CR48","doi-asserted-by":"publisher","unstructured":"Raynal, M.: Concurrent Programming\u2014Algorithms, Principles, and Foundations. Springer, Berlin (2013). doi:\n                        10.1007\/978-3-642-32027-9","DOI":"10.1007\/978-3-642-32027-9"},{"key":"311_CR49","unstructured":"Ruhkin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vol, S., Bassham III, L.E.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. SP 800\u201322 Rev. 1a (2010)"},{"issue":"1","key":"311_CR50","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M Santha","year":"1986","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci. 33(1), 75\u201387 (1986). doi:\n                        10.1016\/0022-0000(86)90044-9","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"311_CR51","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/945511.945516","volume":"13","author":"A Seznec","year":"2003","unstructured":"Seznec, A., Sendrier, N.: HAVEGE: a user-level software heuristic for generating empirically strong random numbers. ACM Trans. Model. Comput. Simul. 13(4), 334\u2013346 (2003). doi:\n                        10.1145\/945511.945516","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"311_CR52","first-page":"67","volume":"77","author":"R Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS) 77, 67\u201395 (2002)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS)"},{"issue":"1","key":"311_CR53","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mob. Comput. Commun. Rev. 5(1), 3\u201355 (2001)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"311_CR54","doi-asserted-by":"crossref","unstructured":"Zhou, H., Bruck, J.: Generalizing the Blum-Elias method for generating random bits from markov chains. In: Proceedings of IEEE International Symposium on Information Theory (ISIT) (2010)","DOI":"10.1109\/ISIT.2010.5513679"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-017-0311-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0311-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0311-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T05:04:23Z","timestamp":1532322263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-017-0311-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,22]]},"references-count":54,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["311"],"URL":"https:\/\/doi.org\/10.1007\/s00446-017-0311-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2017,9,22]]}}}