{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:23:59Z","timestamp":1773843839555,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842581","type":"print"},{"value":"9783030842598","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-84259-8_19","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:21:47Z","timestamp":1628637707000},"page":"548-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["No Time to Hash: On Super-Efficient Entropy Accumulation"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyao","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noah","family":"Stephens-Davidowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiye","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"19_CR1","unstructured":"Supplementary material: covering numbers for all rotations with $$n = 32$$ and $$n=64$$. http:\/\/noahsd.com\/rotation_extractor_supplement.zip"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Bar-Yossef, Z., Trevisan, L., Reingold, O., Shaltiel, R.: Streaming computation of combinatorial objects. In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montr\u00e9al, Qu\u00e9bec, Canada, 21\u201324 May 2002, pp. 165\u2013174. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/CCC.2002.1004352","DOI":"10.1109\/CCC.2002.1004352"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Barak, B., Halevi, S.: A model and architecture for pseudo-random generation with applications to \/dev\/random. In: Atluri, V., Meadows, C.A., Juels, A. (eds.) Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005, Alexandria, VA, USA, 7\u201311 November 2005, pp. 203\u2013212. ACM (2005). https:\/\/doi.org\/10.1145\/1102120.1102148","DOI":"10.1145\/1102120.1102148"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, 17\u201319 October 2004, Proceedings, pp. 384\u2013393. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.29","DOI":"10.1109\/FOCS.2004.29"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 670\u2013683. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897528","DOI":"10.1145\/2897518.2897528"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230\u2013261 (1988). https:\/\/doi.org\/10.1137\/0217015","journal-title":"SIAM J. Comput."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-030-26948-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Coretti","year":"2019","unstructured":"Coretti, S., Dodis, Y., Karthikeyan, H., Tessaro, S.: Seedless fruit is the sweetest: random number generation, revisited. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 205\u2013234. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_8"},{"key":"19_CR8","unstructured":"Dodis, Y., Guo, S., Stephens-Davidowitz, N., Xie, Z.: No time to hash: on superefficient entropy accumulation (full version). Cryptology ePrint Archive, Report 2021\/523 (2021). https:\/\/eprint.iacr.org\/2021\/523"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Pointcheval, D., Ruhault, S., Vergnaud, D., Wichs, D.: Security analysis of pseudo-random number generators with input: \/dev\/random is not robust. In: CCS (2013). https:\/\/doi.org\/10.1145\/2508859.2516653","DOI":"10.1145\/2508859.2516653"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1007\/s00453-016-0239-3","volume":"79","author":"Y Dodis","year":"2017","unstructured":"Dodis, Y., Shamir, A., Stephens-Davidowitz, N., Wichs, D.: How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs. Algorithmica 79(4), 1196\u20131232 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0239-3","journal-title":"Algorithmica"},{"key":"19_CR11","unstructured":"Ferguson, N.: Private communication (2013)"},{"key":"19_CR12","unstructured":"Ferguson, N.: The windows 10 random number generation infrastructure (2019). https:\/\/www.microsoft.com\/security\/blog\/2019\/11\/25\/going-in-depth-on-the-windows-10-random-number-generation-infrastructure\/. Accessed October 2019"},{"key":"19_CR13","volume-title":"Practical Cryptography","author":"N Ferguson","year":"2003","unstructured":"Ferguson, N., Schneier, B.: Practical Cryptography. Wiley, New York (2003)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-662-49890-3_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P Ga\u017ei","year":"2016","unstructured":"Ga\u017ei, P., Tessaro, S.: Provably robust sponge-based PRNGs and KDFs. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 87\u2013116. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_4"},{"issue":"4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). https:\/\/doi.org\/10.1137\/S0097539793244708","journal-title":"SIAM J. Comput."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-69453-5_21","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"D Hutchinson","year":"2017","unstructured":"Hutchinson, D.: A robust and sponge-like PRNG with improved efficiency. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 381\u2013398. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_21"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jcss.2010.06.014","volume":"77","author":"J Kamp","year":"2011","unstructured":"Kamp, J., Rao, A., Vadhan, S.P., Zuckerman, D.: Deterministic extractors for small-space sources. J. Comput. Syst. Sci. 77(1), 191\u2013220 (2011). https:\/\/doi.org\/10.1016\/j.jcss.2010.06.014","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1038001","volume":"38","author":"AH Karp","year":"1996","unstructured":"Karp, A.H.: Bit reversal on uniprocessors. SIAM Rev. 38(1), 1\u201326 (1996). https:\/\/doi.org\/10.1137\/1038001","journal-title":"SIAM Rev."},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-46513-8_2","volume-title":"Selected Areas in Cryptography","author":"J Kelsey","year":"2000","unstructured":"Kelsey, J., Schneier, B., Ferguson, N.: Yarrow-160: notes on the design and analysis of the yarrow cryptographic pseudorandom number generator. In: Heys, H., Adams, C. (eds.) SAC 1999. LNCS, vol. 1758, pp. 13\u201333. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46513-8_2"},{"issue":"1","key":"19_CR20","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). https:\/\/doi.org\/10.1006\/jcss.1996.0004","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Raz, R., Reingold, O.: On recycling the randomness of states in space bounded computation. In: Vitter, J.S., Larmore, L.L., Leighton, F.T. (eds.) Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, 1\u20134 May 1999, pp. 159\u2013168. ACM (1999). https:\/\/doi.org\/10.1145\/301250.301294","DOI":"10.1145\/301250.301294"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, Redondo Beach, California, USA, 12\u201314 November 2000, pp. 22\u201331. IEEE Computer Society (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892008","DOI":"10.1109\/SFCS.2000.892008"},{"key":"19_CR23","unstructured":"Wikipedia: \/dev\/random (2004). http:\/\/en.wikipedia.org\/wiki\/\/dev\/random. Accessed 09 Feb 2014"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84259-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:05:48Z","timestamp":1723334748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84259-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842581","9783030842598"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84259-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"426","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}