{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T13:18:27Z","timestamp":1776086307506,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385445","type":"print"},{"value":"9783031385452","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38545-2_15","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"453-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Revisiting Time-Space Tradeoffs for\u00a0Function Inversion"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Golovnev","sequence":"first","affiliation":[]},{"given":"Siyao","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Spencer","family":"Peters","sequence":"additional","affiliation":[]},{"given":"Noah","family":"Stephens-Davidowitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory 38(2), 509\u2013516 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Barkan, E., Biham, E., Shamir, A.: Rigorous bounds on cryptanalytic time\/memory tradeoffs. In: CRYPTO (2006)","DOI":"10.1007\/11818175_1"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Chawin, D., Haitner, I., Mazor, N.: Lower bounds on the time\/memory tradeoff of function inversion. In: TCC (2020)","DOI":"10.1007\/978-3-030-64381-2_11"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Guo, S., Liu, Q., Qian, L.: Tight quantum time-space tradeoffs for function inversion. In: FOCS (2020)","DOI":"10.1109\/FOCS46700.2020.00068"},{"key":"15_CR5","unstructured":"Chung, K.M., Liao, T.N., Qian, L.: Lower bounds for function inversion with quantum advice. In: ITC (2020)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Coretti, S., Dodis, Y., Guo, S.: Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96884-1_23"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Coretti, S., Dodis, Y., Guo, S., Steinberger, J.: Random oracles and non-uniformity. In: Eurocrypt (2018)","DOI":"10.1007\/978-3-319-78381-9_9"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Kogan, D.: The function-inversion problem: barriers and opportunities. In: TCC (2019)","DOI":"10.1007\/978-3-030-36030-6_16"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: CRYPTO (2010)","DOI":"10.1007\/978-3-642-14623-7_35"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Guo, S., Katz, J.: Fixing cracks in the concrete: random oracles with auxiliary input, revisited. In: EUROCRYPT (2017)","DOI":"10.1007\/978-3-319-56614-6_16"},{"key":"15_CR11","unstructured":"Dvo\u0159\u00e1k, P., Kouck\u00fd, M., Kr\u00e1l, K., Sl\u00edvov\u00e1, V.: Data structures lower bounds and popular conjectures. In: ESA (2021)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Fiat, A., Naor, M.: Rigorous time\/space tradeoffs for inverting functions. In: STOC (1991)","DOI":"10.1145\/103418.103473"},{"key":"15_CR13","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: FOCS (2000)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Guo, S., Horel, T., Park, S., Vaikuntanathan, V.: Data structures meet cryptography: 3SUM with preprocessing. In: STOC (2020)","DOI":"10.1145\/3357713.3384342"},{"key":"15_CR15","unstructured":"Golovnev, A., Guo, S., Peters, S., Stephens-Davidowitz, N.: Revisiting time-space tradeoffs for function inversion (2022). https:\/\/eccc.weizmann.ac.il\/report\/2022\/145\/"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Gravin, N., Guo, S., Kwok, T.C., Lu, P.: Concentration bounds for almost $$k$$-wise independence with applications to non-uniform security. In: SODA (2021)","DOI":"10.1137\/1.9781611976465.143"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M Hellman","year":"1980","unstructured":"Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26(4), 401\u2013406 (1980)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"15_CR18","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J Justesen","year":"1972","unstructured":"Justesen, J.: Class of constructive asymptotically good algebraic codes. IEEE Trans. Inf. Theory 18(5), 652\u2013656 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR19","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. Elsevier (1977)"},{"key":"15_CR20","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge University Press (2017)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: STOC (1987)","DOI":"10.1145\/28395.383347"},{"issue":"11\u201312","key":"15_CR22","first-page":"901","volume":"15","author":"A Nayebi","year":"2015","unstructured":"Nayebi, A., Aaronson, S., Belovs, A., Trevisan, L.: Quantum lower bound for inverting a permutation with advice. Quantum Inf. Comput. 15(11\u201312), 901\u2013913 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Newman, I.: Private vs. common random bits in communication complexity. Inf. Process. Lett. 39(2), 67\u201371 (1991)","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Rao, A., Yehudayoff, A.: Communication Complexity and Applications. Cambridge University Press (2020)","DOI":"10.1017\/9781108671644"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. In: STOC (1995)","DOI":"10.1145\/225058.225165"},{"key":"15_CR26","unstructured":"Ta-Shma, N.: A simple proof of the isolation lemma (2015). https:\/\/eccc.weizmann.ac.il\/\/report\/2015\/080\/"},{"key":"15_CR27","unstructured":"Unruh, D.: Random oracles and auxiliary input. In: CRYPTO (2007)"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. In: STOC (1985)","DOI":"10.1145\/22145.22196"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: STOC (2005)","DOI":"10.1145\/1060590.1060669"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Coherent functions and program checkers. In: STOC (1990)","DOI":"10.1145\/100216.100226"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38545-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:04Z","timestamp":1753567384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38545-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385445","9783031385452"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38545-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","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":"479","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":"124","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":"26% - 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":"15","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)"}}]}}