{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:16:32Z","timestamp":1781259392954,"version":"3.54.1"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01855-7_20","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:32Z","timestamp":1755373292000},"page":"617-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hardness Along the\u00a0Boundary: Towards One-Way Functions from\u00a0the\u00a0Worst-Case Hardness of\u00a0Time-Bounded Kolmogorov Complexity"],"prefix":"10.1007","author":[{"given":"Yanyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Laplante, S., Miltersen, P.B.: New bounds for the language compression problem. In: Proceedings 15th Annual IEEE Conference on Computational Complexity, pp. 126\u2013130. IEEE (2000)","DOI":"10.1109\/CCC.2000.856742"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s00037-005-0199-5","volume":"14","author":"H Buhrman","year":"2005","unstructured":"Buhrman, H., Lee, T., van Melkebeek, D.: Language compression and pseudorandom generators. Comput. complexity 14(3), 228\u2013255 (2005)","journal-title":"Comput. complexity"},{"key":"20_CR3","unstructured":"Blum, M.: Coin flipping by telephone - a protocol for solving impossible problems. In: COMPCON\u201982, Digest of Papers, Twenty-Fourth IEEE Computer Society International Conference, San Francisco, California, USA, 22-25 February 1982, pp. 133\u2013137. IEEE Computer Society (1982)"},{"issue":"4","key":"20_CR4","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."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Chen, L., Tell, R.: Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 283\u2013291 (2021)","DOI":"10.1145\/3406325.3451059"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Chen, L., Tell, R.: When arthur has neither random coins nor time to spare: Superfast derandomization of proof systems. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 60\u201369 (2023)","DOI":"10.1145\/3564246.3585215"},{"issue":"6","key":"20_CR7","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"},{"issue":"6","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3555307","volume":"69","author":"D Doron","year":"2022","unstructured":"Doron, D., Moshkovitz, D., Justin, O., Zuckerman, D.: Nearly optimal pseudorandomness from hardness. J. ACM 69(6), 1\u201355 (2022)","journal-title":"J. ACM"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC 1990, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. In: FOCS (1984)","DOI":"10.1109\/SFCS.1984.715949"},{"key":"20_CR11","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)"},{"issue":"2","key":"20_CR12","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":"20_CR13","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Sipser, M.: Compression and ranking. In: Proceedings of the seventeenth annual ACM Symposium on Theory of Computing, pp. 440\u2013448 (1985)","DOI":"10.1145\/22145.22194"},{"key":"20_CR14","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":"20_CR15","doi-asserted-by":"crossref","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 (Nov 1983)","DOI":"10.1109\/SFCS.1983.21"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Ilango, R., Lu, Z., Nanashima, M., Oliveira, I.C.: A duality between one-way functions and average-case symmetry of information. Cryptology ePrint Archive (2023)","DOI":"10.1145\/3564246.3585138"},{"issue":"4","key":"20_CR17","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":"20_CR18","doi-asserted-by":"crossref","unstructured":"Hirahara, S.: Non-black-box worst-case to average-case reductions within NP. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pp. 247\u2013258 (2018)","DOI":"10.1109\/FOCS.2018.00032"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Hirahara, S.: Average-case hardness of np from exponential worst-case hardness assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 292\u2013302 (2021)","DOI":"10.1145\/3406325.3451065"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Hirahara, S.: Np-hardness of learning programs and partial mcsp. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 968\u2013979. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00095"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Ilango, R., Williams, R.: Beating brute force for compression problems. Electronic Colloquium on Computational Complexity (2024). https:\/\/eccc.weizmann.ac.il\/report\/2023\/171\/","DOI":"10.1145\/3618260.3649778"},{"key":"20_CR22","unstructured":"Hirahara, S., Nanashima, M.: Finding errorless pessiland in error-prone heuristica. In: 37th Computational Complexity Conference (CCC 2022). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2022)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Nanashima, M.:On worst-case learning in relativized heuristica. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 751\u2013758. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00078"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Nanashima, M.: Learning in pessil and via inductive inference (2023)","DOI":"10.1109\/FOCS57990.2023.00033"},{"key":"20_CR25","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":"20_CR26","unstructured":"Ilango, R.:Approaching MCSP from above and below: Hardness for a conditional variant and AC$$\\hat{\\,}$$0[p]. In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, pp. 34:1\u201334:26 (2020)"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Ilango, R.: The minimum formula size problem is (eth) hard. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 427\u2013432. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00050"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Ilango, R.: Constant depth formula and partial function versions of mcsp are hard. SIAM J. Comput. FOCS20\u2013317 (2022)","DOI":"10.1137\/20M1383562"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Ilango, R.: Sat reduces to the minimum circuit size problem with a random oracle. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 733\u2013742 (2023)","DOI":"10.1109\/FOCS57990.2023.00048"},{"key":"20_CR30","unstructured":"Ilango, R., Loff, B., Oliveira, I.C.: NP-hardness of circuit minimization for multi-output functions. In: 35th Computational Complexity Conference, CCC 2020, pp. 22:1\u201322:36 (2020)"},{"key":"20_CR31","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":"20_CR32","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Relativized separations of worst-case and average-case complexities for np. In: 2011 IEEE 26th Annual Conference on Computational Complexity, pp. 104\u2013114. IEEE (2011)","DOI":"10.1109\/CCC.2011.34"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if e requires exponential circuits: derandomizing the xor lemma. In: STOC 1997, pp. 220\u2013229 (1997)","DOI":"10.1145\/258533.258590"},{"issue":"3","key":"20_CR34","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","volume":"48","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: On the notion of infinite pseudorandom sequences. Theor. Comput. Sci. 48(3), 9\u201333 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20134","key":"20_CR35","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."},{"issue":"5","key":"20_CR36","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"AR Klivans","year":"2002","unstructured":"Klivans, A.R., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31(5), 1501\u20131526 (2002)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR37","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1023\/A:1023634616182","volume":"39","author":"LA Levin","year":"2003","unstructured":"Levin, L.A.: The tale of one-way functions. Probl. Inf. Transm. 39(1), 92\u2013103 (2003)","journal-title":"Probl. Inf. Transm."},{"key":"20_CR38","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). SchlossDagstuhl-Leibniz-Zentrum fur Informatik (2022)"},{"key":"20_CR39","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-19 November 2020, pp. 1243\u20131254. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: Cryptography from sublinear time hardness of time-bounded kolmogorov complexity. In: STOC (2021)","DOI":"10.1145\/3406325.3451121"},{"key":"20_CR41","unstructured":"Liu, Y., Pass, R.: Leakage-resilient hardness vs randomness. Electronic Colloquium Comput. Complex. (2022). https:\/\/eccc.weizmann.ac.il\/report\/2022\/113\/"},{"key":"20_CR42","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":"20_CR43","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and the worst-case hardness of time-bounded kolmogorov complexity. Cryptology ePrint Archive, 1086 (2023)","DOI":"10.1007\/978-3-031-78011-0_8"},{"key":"20_CR44","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: One-way functions and the hardness of (probabilistic) time-bounded kolmogorov complexity w.r.t. samplable distributions. In: CRYPTO 2023 (2023)","DOI":"10.1007\/978-3-031-38545-2_21"},{"key":"20_CR45","unstructured":"Mazor, N., Pass, R.: The non-uniform perebor conjecture for time-bounded kolmogorov complexity is false. Cryptology ePrint Archive (2023)"},{"issue":"3","key":"20_CR46","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s00037-005-0197-7","volume":"14","author":"PB Miltersen","year":"2005","unstructured":"Miltersen, P.B., Vinodchandran, N.V.: Derandomizing arthur-merlin games using hitting sets. Comput. Complexity 14(3), 256\u2013279 (2005)","journal-title":"Comput. Complexity"},{"issue":"2","key":"20_CR47","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."},{"issue":"2","key":"20_CR48","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"20_CR49","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR50","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":"1","key":"20_CR51","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1983","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)","journal-title":"Commun. ACM"},{"issue":"1","key":"20_CR52","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discret. Math. 13(1), 2\u201324 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"20_CR53","unstructured":"Santhanam, R.: An algorithmic approach to uniform lower bounds. In: 38th Computational Complexity Conference (CCC 2023). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2023)"},{"key":"20_CR54","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-27 April, 1983, Boston, Massachusetts, USA, pp. 330\u2013335. ACM (1983)","DOI":"10.1145\/800061.808762"},{"issue":"2","key":"20_CR55","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M Sudan","year":"2001","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the xor lemma. J. Comput. Syst. Sci. 62(2), 236\u2013266 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"20_CR56","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)"},{"issue":"4","key":"20_CR57","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/s00037-007-0218-9","volume":"15","author":"R Shaltiel","year":"2006","unstructured":"Shaltiel, R., Umans, C.: Pseudorandomness for approximate counting and sampling. Comput. Complexity 15(4), 298\u2013341 (2006)","journal-title":"Comput. Complexity"},{"issue":"4","key":"20_CR58","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. Annals History Comput. 6(4), 384\u2013400 (1984)","journal-title":"Annals History Comput."},{"issue":"4","key":"20_CR59","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48(4), 860\u2013879 (2001)","journal-title":"J. ACM"},{"key":"20_CR60","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: Pseudorandomness. Foundations and Trends\u00ae in Theoretical Computer Sci. 7(1\u20133):1\u2013336 (2012)","DOI":"10.1561\/0400000010"},{"key":"20_CR61","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, 3-5 November 1982, Chicago, Illinois, USA, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01855-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:49Z","timestamp":1768850509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}