{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T17:37:59Z","timestamp":1790185079490,"version":"4.1.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030457204","type":"print"},{"value":"9783030457211","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45721-1_15","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T04:17:18Z","timestamp":1588306638000},"page":"405-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications"],"prefix":"10.1007","author":[{"given":"Itai","family":"Dinur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BFb0055743","volume-title":"Advances in Cryptology \u2014 CRYPTO 1998","author":"W Aiello","year":"1998","unstructured":"Aiello, W., Bellare, M., Crescenzo, G.D., Venkatesan, R.: Security amplification by composition: the case of doubly-iterated, ideal ciphers. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 390\u2013407. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055743"},{"issue":"1","key":"15_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-56617-7_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Alwen","year":"2017","unstructured":"Alwen, J., Chen, B., Pietrzak, K., Reyzin, L., Tessaro, S.: Scrypt is maximally memory-hard. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 33\u201362. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_2"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 595\u2013603. ACM (2015)","DOI":"10.1145\/2746539.2746622"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-63688-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Auerbach","year":"2017","unstructured":"Auerbach, B., Cash, D., Fersch, M., Kiltz, E.: Memory-tight reductions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 101\u2013132. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_4"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11818175_1","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"E Barkan","year":"2006","unstructured":"Barkan, E., Biham, E., Shamir, A.: Rigorous bounds on cryptanalytic time\/memory tradeoffs. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 1\u201321. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_1"},{"issue":"2","key":"15_CR7","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0220017","volume":"20","author":"P Beame","year":"1991","unstructured":"Beame, P.: A general sequential time-space tradeoff for finding unique elements. SIAM J. Comput. 20(2), 270\u2013277 (1991)","journal-title":"SIAM J. Comput."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Beame, P., Clifford, R., Machmouchi, W.: Element distinctness, frequency moments, and sliding windows. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October, 2013, Berkeley, CA, USA, pp. 290\u2013299. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.39"},{"issue":"2","key":"15_CR9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1145\/636865.636867","volume":"50","author":"P Beame","year":"2003","unstructured":"Beame, P., Saks, M.E., Sun, X., Vee, E.: Time-space trade-off lower bounds for randomized computation of decision problems. J. ACM 50(2), 154\u2013195 (2003)","journal-title":"J. ACM"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-57568-5_251","volume-title":"Algorithms and Computation","author":"A Borodin","year":"1993","unstructured":"Borodin, A.: Time space tradeoffs (getting closer to the barrier?). In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 209\u2013220. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57568-5_251"},{"issue":"2","key":"15_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0211022","volume":"11","author":"A Borodin","year":"1982","unstructured":"Borodin, A., Cook, S.A.: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation. SIAM J. Comput. 11(2), 287\u2013297 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR12","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0022-0000(81)90037-4","volume":"22","author":"A Borodin","year":"1981","unstructured":"Borodin, A., Fischer, M.J., Kirkpatrick, D.G., Lynch, N.A., Tompa, M.: A time-space tradeoff for sorting on non-oblivious machines. J. Comput. Syst. Sci. 22(3), 351\u2013364 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology \u2014 CRYPTO 1997","author":"C Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292\u2013306. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052243"},{"key":"15_CR14","unstructured":"Chakrabarti, A., Chen, Y.: Time-space tradeoffs for the memory game. CoRR, abs\/1712.01330 (2017)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Cobham, A.: The recognition problem for the set of perfect squares. In: 7th Annual Symposium on Switching and Automata Theory, Berkeley, California, USA, 23\u201325 October 1966, pp. 78\u201387. IEEE Computer Society (1966)","DOI":"10.1109\/SWAT.1966.30"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Delaplace, C., Esser, A., May, A.: Improved low-memory subset sum and LPN algorithms via multiple collisions. IACR Cryptology ePrint Archive 2019, 804 (2019)","DOI":"10.1007\/978-3-030-35199-1_9"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-32009-5_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Dinur","year":"2012","unstructured":"Dinur, I., Dunkelman, O., Keller, N., Shamir, A.: Efficient dissection of composite problems, with applications to cryptanalysis, knapsacks, and combinatorial search problems. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 719\u2013740. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_42"},{"key":"15_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11535218_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"C Dwork","year":"2005","unstructured":"Dwork, C., Naor, M., Wee, H.: Pebbling and proofs of work. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 37\u201354. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_3"},{"issue":"6","key":"15_CR20","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1145\/1101821.1101822","volume":"52","author":"L Fortnow","year":"2005","unstructured":"Fortnow, L., Lipton, R.J., van Melkebeek, D., Viglas, A.: Time-space lower bounds for satisfiability. J. ACM 52(6), 835\u2013865 (2005)","journal-title":"J. ACM"},{"issue":"4","key":"15_CR21","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"ME Hellman","year":"1980","unstructured":"Hellman, M.E.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4), 401\u2013406 (1980)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-17653-2_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Jaeger","year":"2019","unstructured":"Jaeger, J., Tessaro, S.: Tight time-memory trade-offs for symmetric encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 467\u2013497. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_16"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-10366-7_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"A Joux","year":"2009","unstructured":"Joux, A., Lucks, S.: Improved generic algorithms for 3-collisions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 347\u2013363. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_21"},{"key":"15_CR24","volume-title":"The Art of Computer Programming, Volume II: Seminumerical Algorithms","author":"DE Knuth","year":"1969","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume II: Seminumerical Algorithms. Addison-Wesley, Boston (1969)"},{"issue":"1","key":"15_CR25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(93)90257-T","volume":"107","author":"Y Mansour","year":"1993","unstructured":"Mansour, Y., Nisan, N., Tiwari, P.: The computational complexity of universal hashing. Theor. Comput. Sci. 107(1), 121\u2013133 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"15_CR26","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/358699.358718","volume":"24","author":"RC Merkle","year":"1981","unstructured":"Merkle, R.C., Hellman, M.E.: On the security of multiple encryption. Commun. ACM 24(7), 465\u2013467 (1981)","journal-title":"Commun. ACM"},{"issue":"4","key":"15_CR27","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N Nisan","year":"1992","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449\u2013461 (1992). https:\/\/doi.org\/10.1007\/BF01305237","journal-title":"Combinatorica"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-540-45146-4_36","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"P Oechslin","year":"2003","unstructured":"Oechslin, P.: Making a faster cryptanalytic time-memory trade-off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 617\u2013630. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_36"},{"key":"15_CR29","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01683275","volume":"10","author":"WJ Paul","year":"1977","unstructured":"Paul, W.J., Tarjan, R.E., Celoni, J.R.: Space bounds for a game on graphs. Math. Syst. Theory 10, 239\u2013251 (1977). https:\/\/doi.org\/10.1007\/BF01683275","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"15_CR30","first-page":"3:1","volume":"66","author":"R Raz","year":"2019","unstructured":"Raz, R.: Fast learning requires good memory: a time-space lower bound for parity learning. J. ACM 66(1), 3:1\u20133:18 (2019)","journal-title":"J. ACM"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03807-6_1","volume-title":"Theory of Cryptography","author":"S Tessaro","year":"2018","unstructured":"Tessaro, S., Thiruvengadam, A.: Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 3\u201332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_1"},{"issue":"1","key":"15_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999). https:\/\/doi.org\/10.1007\/PL00003816","journal-title":"J. Cryptol."},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Probabilistic computations: toward a unified measure of complexity (extended abstract). In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October\u20131 November, pp. 222\u2013227. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.24"},{"issue":"5","key":"15_CR35","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1137\/S0097539788148959","volume":"23","author":"AC Yao","year":"1994","unstructured":"Yao, A.C.: Near-optimal time-space tradeoff for element distinctness. SIAM J. Comput. 23(5), 966\u2013975 (1994)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR36","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0022-0000(84)90029-1","volume":"29","author":"Y Yesha","year":"1984","unstructured":"Yesha, Y.: Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer. J. Comput. Syst. Sci. 29(2), 183\u2013197 (1984)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45721-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:04:16Z","timestamp":1682899456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45721-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457204","9783030457211"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45721-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2020\/","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":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"81","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":"22% - 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","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}