{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T00:17:34Z","timestamp":1769300254190,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030176525","type":"print"},{"value":"9783030176532","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17653-2_16","type":"book-chapter","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T04:42:13Z","timestamp":1557808933000},"page":"467-497","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Tight Time-Memory Trade-Offs for Symmetric Encryption"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Jaeger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,18]]},"reference":[{"key":"16_CR1","unstructured":"Abrego, B.M., Fernandez-Merchant, S., Neubauer, M.G., Watkins, W.: Sum of squares of degrees in a graph. J. Inequalities Pure Appl. Math. 10(3) (2009)"},{"key":"16_CR2","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":"16_CR3","doi-asserted-by":"crossref","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 595\u2013603. ACM Press, June 2015","DOI":"10.1145\/2746539.2746622"},{"key":"16_CR4","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":"16_CR5","doi-asserted-by":"crossref","unstructured":"Babbage, S.H.: Improved \u201cexhaustive search\u201d attacks on stream ciphers. In: European Convention on Security and Detection, pp. 161\u2013166, May 1995","DOI":"10.1049\/cp:19950490"},{"key":"16_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"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0054132","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Krovetz, T., Rogaway, P.: Luby-Rackoff backwards: increasing security by making block ciphers non-invertible. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 266\u2013280. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054132"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"issue":"1\u20133","key":"16_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0012-365X(03)00130-4","volume":"269","author":"C Bey","year":"2003","unstructured":"Bey, C.: An upper bound on the sum of squares of degrees in a hypergraph. Discrete Math. 269(1\u20133), 259\u2013263 (2003)","journal-title":"Discrete Math."},{"issue":"16","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.1016\/j.disc.2006.03.054","volume":"306","author":"SM Cioab","year":"2006","unstructured":"Cioab, S.M.: Note: sums of powers of the degrees of a graph. Discrete Math. 306(16), 1959\u20131964 (2006)","journal-title":"Discrete Math."},{"key":"16_CR11","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (2006)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-319-63697-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"W Dai","year":"2017","unstructured":"Dai, W., Hoang, V.T., Tessaro, S.: Information-theoretic indistinguishability via the chi-squared method. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 497\u2013523. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_17"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-39466-4_19","volume-title":"Cryptography","author":"DW Davies","year":"1983","unstructured":"Davies, D.W., Parkin, G.I.P.: The average cycle size of the key-stream in output feedback encipherment. In: Beth, T. (ed.) EUROCRYPT 1982. LNCS, vol. 149, pp. 263\u2013279. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-39466-4_19"},{"issue":"1\u20133","key":"16_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0012-365X(97)00213-6","volume":"185","author":"D de Caen","year":"1998","unstructured":"de Caen, D.: An upper bound on the sum of squares of degrees in a graph. Discrete Math. 185(1\u20133), 245\u2013248 (1998)","journal-title":"Discrete Math."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-69053-0_17","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201997","author":"JD Goli\u0107","year":"1997","unstructured":"Goli\u0107, J.D.: Cryptanalysis of alleged A5 stream cipher. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 239\u2013255. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_17"},{"key":"16_CR16","unstructured":"Gruslys, V., Letzter, S., Morrison, N.: Hypergraph Lagrangians: resolving the Frankl-F\u00fcredi conjecture. arXiv preprint arXiv:1807.00793 (2018)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11799313_20","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2006","unstructured":"Iwata, T.: New blockcipher modes of operation with beyond the birthday bound security. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 310\u2013327. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_20"},{"key":"16_CR18","unstructured":"Iwata, T., Mennink, B., Viz\u00e1r, D.: CENC is optimally secure. Cryptology ePrint Archive, Report 2016\/1087 (2016). http:\/\/eprint.iacr.org\/2016\/1087"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Jaeger, J., Tessaro, S.: Tight time-memory trade-offs for symmetric encryption. Cryptology ePrint Archive, Report 2019\/??? (2019). https:\/\/eprint.iacr.org\/2019\/???","DOI":"10.1007\/978-3-030-17653-2_16"},{"issue":"24","key":"16_CR20","doi-asserted-by":"publisher","first-page":"3187","DOI":"10.1016\/j.disc.2007.03.019","volume":"307","author":"V Nikiforov","year":"2007","unstructured":"Nikiforov, V.: Note: the sum of the squares of degrees: sharp asymptotics. Discrete Math. 307(24), 3187\u20133193 (2007)","journal-title":"Discrete Math."},{"issue":"4","key":"16_CR21","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)","journal-title":"Combinatorica"},{"key":"16_CR22","unstructured":"Patarin, J.: Mirror theory and cryptography. Cryptology ePrint Archive, Report 2016\/702 (2016). http:\/\/eprint.iacr.org\/2016\/702"},{"issue":"3","key":"16_CR23","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"JM Pollard","year":"1975","unstructured":"Pollard, J.M.: A monte carlo method for factorization. BIT Numer. Math. 15(3), 331\u2013334 (1975)","journal-title":"BIT Numer. Math."},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/0-387-34805-0_38","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 89 Proceedings","author":"J-J Quisquater","year":"1990","unstructured":"Quisquater, J.-J., Delescaille, J.-P.: How easy is collision search. New results and applications to DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 408\u2013413. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_38"},{"key":"16_CR25","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"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-78381-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Matsuda, T., Hanaoka, G., Tanaka, K.: Memory lower bounds of reductions revisited. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 61\u201390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17653-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:50:40Z","timestamp":1709833840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17653-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030176525","9783030176532"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17653-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 April 2019","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":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2019\/","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":"327","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":"76","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":"23% - 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":"19","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)"}}]}}