{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:15:42Z","timestamp":1781259342397,"version":"3.54.1"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780103","type":"print"},{"value":"9783031780110","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"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-031-78011-0_8","type":"book-chapter","created":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T19:25:38Z","timestamp":1733081138000},"page":"222-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On One-Way Functions, the\u00a0Worst-Case Hardness of\u00a0Time-Bounded Kolmogorov Complexity, and\u00a0Computational Depth"],"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":[[2024,12,2]]},"reference":[{"issue":"6","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/050628994","volume":"35","author":"E Allender","year":"2006","unstructured":"Allender, E., Buhrman, H., Kouck\u1ef3, M., Van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(6), 1467\u20131493 (2006)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M. and Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Leighton, F.T., Shor, P.W. (eds.) Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pp. 284\u2013293. ACM (1997)","DOI":"10.1145\/258533.258604"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Antunes, L., Fortnow, L.: Worst-case running times for average-case algorithms. In: 2009 24th Annual IEEE Conference on Computational Complexity, pp. 298\u2013303. IEEE (2009)","DOI":"10.1109\/CCC.2009.12"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.tcs.2005.11.033","volume":"354","author":"L Antunes","year":"2006","unstructured":"Antunes, L., Fortnow, L., Van Melkebeek, D., Vinodchandran, N.V.: Computational depth: concept and applications. Theor. Comput. Sci. 354(3), 391\u2013404 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: STOC 2006, pp. 701\u2013710 (2006)","DOI":"10.1145\/1132516.1132614"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Gary\u00a0L. Miller (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45294-X_1","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"E Allender","year":"2001","unstructured":"Allender, E.: When worlds collide: derandomization, lower bounds, and kolmogorov complexity. In: Hariharan, R., Vinay, V., Mukund, M. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 1\u201315. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45294-X_1"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-319-63688-7_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., Degwekar, A., Vaikuntanathan, V.: Structure vs. hardness through the obfuscation lens. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 696\u2013723. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_23"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Blum, M., Impagliazzo, R.: Generic oracles and oracle classes. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 118\u2013126. IEEE (1987)","DOI":"10.1109\/SFCS.1987.30"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Ball, M., Liu, Y., Mazor, N., Pass, R.: On interactive Kolmogorov complexity and key-agreement, Kolmogorov comes to cryptomania (2023)","DOI":"10.1109\/FOCS57990.2023.00034"},{"key":"8_CR11","unstructured":"Blum, M.: Coin flipping by telephone - a protocol for solving impossible problems. In: COMPCON 1982, Digest of Papers, Twenty-Fourth IEEE Computer Society International Conference, San Francisco, California, USA, February 22-25, 1982, pp. 133\u2013137. IEEE Computer Society (1982)"},{"issue":"4","key":"8_CR12","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":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1109\/TIT.1983.1056754","volume":"29","author":"G Brassard","year":"1983","unstructured":"Brassard, G.: Relativized cryptography. IEEE Trans. Inf. Theory 29(6), 877\u2013893 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Trevisan, L.: On worst-case to average-case reductions for np problems. In: FOCS 2003, pp. 308\u2013317 (2003)","DOI":"10.1109\/SFCS.2003.1238205"},{"key":"8_CR15","unstructured":"Chen, L., Hirahara, S., Oliveira, I.C., Pich, J., Rajgopal, N., Santhanam, R.: Beyond natural proofs: Hardness magnification and locality. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Chen, L., Jin, C., Williams, R.R.: Hardness magnification for all sparse NP languages. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1240\u20131255. IEEE, (2019)","DOI":"10.1109\/FOCS.2019.00077"},{"key":"8_CR17","unstructured":"Chen, L., McKay, D.M., Murray, C.D., Williams, R.R.: Relations and equivalences between circuit lower bounds and karp-lipton theorems. In: 34th Computational Complexity Conference (CCC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Chen, L., Tell, R.: Bootstrapping results for threshold circuits \u201cjust beyond\u201d known lower bounds. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 34\u201341 (2019)","DOI":"10.1145\/3313276.3316333"},{"issue":"6","key":"8_CR19","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":"8_CR20","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"},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci. 60(3), 540\u2013563 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR22","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. In: FOCS (1984)"},{"issue":"2","key":"8_CR23","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":"8_CR24","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":"8_CR25","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 (1983)","DOI":"10.1109\/SFCS.1983.21"},{"issue":"4","key":"8_CR26","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":"8_CR27","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":"8_CR28","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":"8_CR29","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Nanashima, M.: Learning in pessiland via inductive inference (2023)","DOI":"10.1109\/FOCS57990.2023.00033"},{"key":"8_CR30","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":"8_CR31","unstructured":"Ilango, R.: Approaching MCSP from above and below: hardness for a conditional variant and AC$$^{\\wedge }$$0[p]. In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, pp. 34:1\u201334:26 (2020)"},{"key":"8_CR32","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":"8_CR33","doi-asserted-by":"crossref","unstructured":"Ilango, R.: Constant depth formula and partial function versions of MCSP are hard. SIAM J. Comput. (0), FOCS20\u2013317 (2022)","DOI":"10.1137\/20M1383562"},{"key":"8_CR34","unstructured":"Ilango, R., Loff, B., Carboni Oliveira, I.: NP-hardness of circuit minimization for multi-output functions. In: 35th Computational Complexity Conference, CCC 2020, pp. 22:1\u201322:36 (2020)"},{"key":"8_CR35","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":"8_CR36","first-page":"82","volume":"28","author":"R Ilango","year":"2021","unstructured":"Ilango, R., Ren, H., Santhanam, R.: Hardness on any samplable distribution suffices: new characterizations of one-way functions by meta-complexity. Electron. Colloquium Comput. Complex. 28, 82 (2021)","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Kabanets, V., Cai, J.Y.: Circuit minimization problem. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 21-23 May 2000, Portland, OR, USA, pp. 73\u201379 (2000)","DOI":"10.1145\/335305.335314"},{"issue":"3","key":"8_CR38","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":"8_CR39","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":"1","key":"8_CR40","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":"8_CR41","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, November 16-19, 2020, pp. 1243\u20131254. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"8_CR42","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":"8_CR43","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.:. On the possibility of basing cryptography on EXP $$\\ne $$ BPP. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84242-0_2"},{"key":"8_CR44","unstructured":"Liu, Y., Pass, R.: Leakage-resilient hardness vs randomness. Electron. Colloquium Comput. Complexity (2022). https:\/\/eccc.weizmann.ac.il\/report\/2022\/113\/"},{"key":"8_CR45","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":"8_CR46","doi-asserted-by":"crossref","unstructured":"McKay, D.M., Murray, C.D., Williams, R.R.: Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 1215\u20131225 (2019)","DOI":"10.1145\/3313276.3316396"},{"issue":"2","key":"8_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. Cryptology 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"8_CR48","unstructured":"Oliveira, I.C.: Randomness and intractability in kolmogorov complexity. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"8_CR49","unstructured":"Oliveira, I.C., Pich, J., Santhanam, R.: Hardness magnification near state-of-the-art lower bounds (2019)"},{"key":"8_CR50","doi-asserted-by":"crossref","unstructured":"Oliveira, I.C., Santhanam, R.: Hardness magnification for natural problems. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 65\u201376. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00016"},{"issue":"6","key":"8_CR51","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O Regev","year":"2004","unstructured":"Regev, O.: New lattice based cryptographic constructions. J. ACM 51(6), 899\u2013942 (2004)","journal-title":"J. ACM"},{"key":"8_CR52","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":"8_CR53","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"},{"key":"8_CR54","unstructured":"Rudich, S.: Limits on the Provable Consequences of One-Way Functions. University of California at Berkeley (1988)"},{"key":"8_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-63248-4_8","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"S Rudich","year":"1997","unstructured":"Rudich, S.: Super-bits, demi-bits, and NP\/qpoly-natural proofs. In: Rolim, J. (ed.) RANDOM 1997. LNCS, vol. 1269, pp. 85\u201393. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63248-4_8"},{"key":"8_CR56","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":"4","key":"8_CR57","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. Ann. Hist. Comput. 6(4), 384\u2013400 (1984)","journal-title":"Ann. Hist. Comput."},{"issue":"1","key":"8_CR58","first-page":"75","volume":"2","author":"S Yablonski","year":"1959","unstructured":"Yablonski, S.: The algorithmic difficulties of synthesizing minimal switching circuits. Problemy Kibernetiki 2(1), 75\u2013121 (1959)","journal-title":"Problemy Kibernetiki"},{"key":"8_CR59","unstructured":"Yablonski, S.V.: On the impossibility of eliminating perebor in solving some problems of circuit theory. Doklady Akademii Nauk SSSR 124(1), 44\u201347 (1959)"},{"key":"8_CR60","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-5 November 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78011-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T20:02:41Z","timestamp":1733083361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78011-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"ISBN":["9783031780103","9783031780110"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78011-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}