{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:34:13Z","timestamp":1768912453109,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"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_21","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"645-673","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["One-Way Functions and\u00a0the\u00a0Hardness of\u00a0(Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions"],"prefix":"10.1007","author":[{"given":"Yanyi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"21_CR1","unstructured":"Blum, M.: Coin flipping by telephone - A protocol for solving impossible problems. In: COMPCON1982, Digest of Papers, Twenty-Fourth IEEE Computer Society International Conference, San Francisco, California, USA, 22\u201325 February 1982, pp. 133\u2013137. IEEE Computer Society (1982)"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L Carter","year":"1979","unstructured":"Carter, L., Wegman, M.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/321526.321530","volume":"16","author":"GJ Chaitin","year":"1969","unstructured":"Chaitin, G.J.: On the simplicity and speed of programs for computing infinite sets of natural numbers. J. ACM 16(3), 407\u2013422 (1969)","journal-title":"J. ACM"},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC 1990, pp. 416\u2013426 (1990). http:\/\/doi.acm.org\/10.1145\/100216.100272","DOI":"10.1145\/100216.100272"},{"key":"21_CR7","unstructured":"Goldberg, H., Kabanets, V., Lu, Z., Oliveira, I.C.: Probabilistic Kolmogorov complexity with applications to average-case complexity. In: 37th Computational Complexity Conference (CCC 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions. In: CRYPTO, pp. 276\u2013288 (1984)","DOI":"10.1007\/3-540-39568-7_22"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR10","unstructured":"Gurevich, Y.: The challenger-solver game: variations on the theme of p=np. In: Logic in Computer Science Column, The Bulletin of EATCS (1989)"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Hartmanis, J.: Generalized Kolmogorov complexity and the structure of feasible computations. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 439\u2013445 (1983). https:\/\/doi.org\/10.1109\/SFCS.1983.21","DOI":"10.1109\/SFCS.1983.21"},{"issue":"4","key":"21_CR12","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)","journal-title":"SIAM J. Comput."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Ilango, R., Ren, H., Santhanam, R.: Robustness of average-case meta-complexity via pseudorandomness. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1575\u20131583 (2022)","DOI":"10.1145\/3519935.3520051"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Structure in Complexity Theory 1995, pp. 134\u2013147 (1995)","DOI":"10.1109\/SCT.1995.514853"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., LA, L.: No better ways to generate hard np instances than picking uniformly at random. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp. 812\u2013821. IEEE (1990)","DOI":"10.1109\/FSCS.1990.89604"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Ko, K.: On the notion of infinite pseudorandom sequences. Theor. Comput. Sci. 48(3), 9\u201333 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90081-2","DOI":"10.1016\/0304-3975(86)90081-2"},{"issue":"1\u20134","key":"21_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207166808803030","volume":"2","author":"AN Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2(1\u20134), 157\u2013168 (1968)","journal-title":"Int. J. Comput. Math."},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Levin, L.A.: The tale of one-way functions. Prob. Inf. Trans. 39(1), 92\u2013103 (2003). https:\/\/doi.org\/10.1023\/A:1023634616182","DOI":"10.1023\/A:1023634616182"},{"key":"21_CR20","unstructured":"Levin, L.A.: Universal search problems (Russian), translated into English by BA Trakhtenbrot in [32]. Prob. Inf. Transmission 9(3), 265\u2013266 (1973)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and Kolmogorov complexity. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 1243\u20131254. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"21_CR22","unstructured":"Liu, Y., Pass, R.: A note on one-way functions and sparse languages. Cryptology ePrint Archive (2021)"},{"key":"21_CR23","unstructured":"Liu, Y., Pass, R.: On one-way functions from np-complete problems. In: Proceedings of the 37th Computational Complexity Conference, pp. 1\u201324 (2022)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-54945-5_75","volume-title":"ISA\u201991 Algorithms","author":"L Longpr\u00e9","year":"1991","unstructured":"Longpr\u00e9, L., Mocas, S.: Symmetry of information and one-way functions. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 308\u2013315. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54945-5_75"},{"key":"21_CR25","unstructured":"Lu, Z., Oliveira, I.C., Zimand, M.: Optimal coding theorems in time-bounded Kolmogorov complexity. In: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"2","key":"21_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991). https:\/\/doi.org\/10.1007\/BF00196774","journal-title":"J. Cryptol."},{"key":"21_CR27","doi-asserted-by":"publisher","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems (reprint). Commun. ACM 26(1), 96\u201399 (1983). https:\/\/doi.org\/10.1145\/357980.358017","DOI":"10.1145\/357980.358017"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"issue":"2","key":"21_CR29","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/1059513.1059516","volume":"52","author":"R Shaltiel","year":"2005","unstructured":"Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM (JACM) 52(2), 172\u2013216 (2005)","journal-title":"J. ACM (JACM)"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25\u201327 April 1983, Boston, Massachusetts, USA, pp. 330\u2013335. ACM (1983)","DOI":"10.1145\/800061.808762"},{"key":"21_CR31","doi-asserted-by":"publisher","unstructured":"Solomonoff, R.: A formal theory of inductive inference, part I. Inf. Control 7(1), 1\u201322 (1964). https:\/\/doi.org\/10.1016\/S0019-9958(64)90223-2","DOI":"10.1016\/S0019-9958(64)90223-2"},{"issue":"4","key":"21_CR32","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"BA Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of Russian approaches to Perebor (brute-force searches) algorithms. Annal. History Comput. 6(4), 384\u2013400 (1984)","journal-title":"Annal. History Comput."},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"issue":"6","key":"21_CR34","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"AK Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 25(6), 83\u2013124 (1970). https:\/\/doi.org\/10.1070\/RM1970v025n06ABEH001269","journal-title":"Russ. Math. Surv."}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:24Z","timestamp":1753567404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38545-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385445","9783031385452"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38545-2_21","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)"}}]}}