{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:21:46Z","timestamp":1778127706232,"version":"3.51.4"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486203","type":"print"},{"value":"9783031486210","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-48621-0_17","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"486-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["How to\u00a0Compile Polynomial IOP into\u00a0Simulation-Extractable SNARKs: A Modular Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8660-9663","authenticated-orcid":false,"given":"Markulf","family":"Kohlweiss","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5317-5535","authenticated-orcid":false,"given":"Mahak","family":"Pancholi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8556-3053","authenticated-orcid":false,"given":"Akira","family":"Takahashi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-46035-7_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"M Abdalla","year":"2002","unstructured":"Abdalla, M., An, J.H., Bellare, M., Namprempre, C.: From identification to signatures via the Fiat-Shamir transform: minimizing assumptions for security and forward-security. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 418\u2013433. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_28"},{"key":"17_CR2","unstructured":"Abdolmaleki, B., Glaeser, N., Ramacher, S., Slamanig, D.: Universally composable NIZKs: circuit-succinct, non-malleable and CRS-updatable. Cryptology ePrint Archive, Paper 2023\/097 (2023). https:\/\/eprint.iacr.org\/2023\/097"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Abdolmaleki, B., Ramacher, S., Slamanig, D.: Lift-and-shift: obtaining simulation extractable subversion and updatable SNARKs generically. In: ACM CCS 2020, November 2020","DOI":"10.1145\/3372297.3417228"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R.: Compressed $$\\varSigma $$-protocol theory and\u00a0practical application\u00a0to\u00a0plug\u00a0 &\u00a0play secure algorithmics. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 513\u2013543. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-662-64322-8_22","volume-title":"Financial Cryptography and Data Security","author":"K Baghery","year":"2021","unstructured":"Baghery, K., Kohlweiss, M., Siim, J., Volkhov, M.: Another look at extraction and\u00a0randomization of Groth\u2019s zk-SNARK. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12674, pp. 457\u2013475. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64322-8_22"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-92548-2_28","volume-title":"Cryptology and Network Security","author":"K Baghery","year":"2021","unstructured":"Baghery, K., Sedaghat, M.: Tiramisu: black-box simulation extractable NIZKs in\u00a0the\u00a0updatable CRS model. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 531\u2013551. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_28"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, May 2014","DOI":"10.1109\/SP.2014.36"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Bitan, D., Canetti, R., Goldwasser, S., Wexler, R.: Using zero-knowledge to reconcile law enforcement secrecy and fair trial rights in criminal cases. In: Weitzner, D.J., Feigenbaum, J., Yoo, C.S. (eds.) Proceedings of the 2022 Symposium on Computer Science and Law, CSLAW 2022, Washington DC, USA, 1\u20132 November 2022, pp. 9\u201322. ACM (2022). https:\/\/doi.org\/10.1145\/3511265.3550452","DOI":"10.1145\/3511265.3550452"},{"key":"17_CR11","unstructured":"Bonneau, J., Meckler, I., Rao, V., Shapiro, E.: Coda: decentralized cryptocurrency at scale. Cryptology ePrint Archive, Report 2020\/352 (2020). https:\/\/eprint.iacr.org\/2020\/352"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-030-51280-4_23","volume-title":"Financial Cryptography and Data Security","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Agrawal, S., Zamani, M., Boneh, D.: Zether: towards privacy in a smart contract world. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 423\u2013443. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_23"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92078-4_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Campanelli","year":"2021","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Querol, A., Rodr\u00edguez, H.: Lunar: a\u00a0toolbox for\u00a0more efficient universal and\u00a0updatable zkSNARKs and\u00a0commit-and-prove extensions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 3\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Chase","year":"2006","unstructured":"Chase, M., Lysyanskaya, A.: On signatures of knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78\u201396. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_5"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Dao, Q., Grubbs, P.: Spartan and bulletproofs are simulation-extractable (for free!). In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, 23\u201327 April 2023, Proceedings, Part II. LNCS, vol. 14005, pp. 531\u2013562. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_18","DOI":"10.1007\/978-3-031-30617-4_18"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"A De Santis","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566\u2013598. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_33"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Faonio, A., Fiore, D., Kohlweiss, M., Russo, L., Zajac, M.: From polynomial IOP and commitments to non-malleable zksnarks. Cryptology ePrint Archive, Paper 2023\/569 (2023). https:\/\/eprint.iacr.org\/2023\/569","DOI":"10.1007\/978-3-031-48621-0_16"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-34931-7_5","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"S Faust","year":"2012","unstructured":"Faust, S., Kohlweiss, M., Marson, G.A., Venturi, D.: On the non-malleability of the Fiat-Shamir transform. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 60\u201379. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_5"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Fiore, D., Fournet, C., Ghosh, E., Kohlweiss, M., Ohrimenko, O., Parno, B.: Hash first, argue later: adaptive verifiable computations on outsourced data. In: ACM CCS 2016, October 2016","DOI":"10.1145\/2976749.2978368"},{"key":"17_CR24","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Khoshakhlagh, H., Kohlweiss, M., Nitulescu, A., Zajac, M.: What makes Fiat-Shamir zksnarks (updatable SRS) simulation extractable? In: Galdi, C., Jarecki, S. (eds.) SCN 2022. LNCS, vol. 13409, pp. 735\u2013760. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_32","DOI":"10.1007\/978-3-031-14791-3_32"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Kondi, Y., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Witness-succinct universally-composable snarks. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, 23\u201327 April 2023, Proceedings, Part II. LNCS, vol. 14005, pp. 315\u2013346. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_11","DOI":"10.1007\/978-3-031-30617-4_11"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model). In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276. Springer, Cham, pp. 397\u2013426 (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_14","DOI":"10.1007\/978-3-031-07085-3_14"},{"key":"17_CR28","unstructured":"Ganesh, C., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Fiat-Shamir bulletproofs are non-malleable (in the random oracle model). Cryptology ePrint Archive, Paper 2023\/147 (2023). https:\/\/eprint.iacr.org\/2023\/147"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Garay, J.A., MacKenzie, P.D., Yang, K.: Strengthening zero-knowledge protocols using signatures. J. Cryptol. 19(2), 169\u2013209 (2006)","DOI":"10.1007\/s00145-005-0307-3"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Garman, C., Green, M., Miers, I.: Decentralized anonymous credentials. In: NDSS 2014, February 2014","DOI":"10.14722\/ndss.2014.23253"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-319-63715-0_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Groth","year":"2017","unstructured":"Groth, J., Maller, M.: Snarky signatures: minimal signatures of knowledge from simulation-extractable SNARKs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 581\u2013612. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_20"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-319-10879-7_25","volume-title":"Security and Cryptography for Networks","author":"A Jain","year":"2014","unstructured":"Jain, A., Pandey, O.: Non-malleable zero knowledge: black-box constructions and definitional relationships. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 435\u2013454. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_25"},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Kohlweiss, M., Pancholi, M., Takahashi, A.: How to compile polynomial IOP into simulation-extractable snarks: a modular approach. Cryptology ePrint Archive, Paper 2023\/1067 (2023). https:\/\/eprint.iacr.org\/2023\/1067","DOI":"10.1007\/978-3-031-48621-0_17"},{"key":"17_CR35","unstructured":"Kosba, A., et al.: C$$\\emptyset $$c$$\\emptyset $$: a framework for building composable zero-knowledge proofs. Cryptology ePrint Archive, Report 2015\/1093 (2015). https:\/\/eprint.iacr.org\/2015\/1093"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Kosba, A.E., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. In: 2016 IEEE Symposium on Security and Privacy, May 2016","DOI":"10.1109\/SP.2016.55"},{"key":"17_CR37","unstructured":"Lysyanskaya, A., Rosenbloom, L.N.: Efficient and universally composable non-interactive zero-knowledge proofs of knowledge with security against adaptive corruptions. Cryptology ePrint Archive, Paper 2022\/1484 (2022). https:\/\/eprint.iacr.org\/2022\/1484"},{"key":"17_CR38","unstructured":"Lysyanskaya, A., Rosenbloom, L.N.: Universally composable sigma-protocols in the global random-oracle model. Cryptology ePrint Archive, Report 2022\/290 (2022). https:\/\/eprint.iacr.org\/2022\/290"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: ACM CCS 2019, November 2019","DOI":"10.1145\/3319535.3339817"},{"key":"17_CR40","doi-asserted-by":"crossref","unstructured":"Naveh, A., Tromer, E.: PhotoProof: cryptographic image authentication for any set of permissible transformations. In: 2016 IEEE Symposium on Security and Privacy, May 2016","DOI":"10.1109\/SP.2016.23"},{"key":"17_CR41","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: 37th ACM STOC, May 2005","DOI":"10.1145\/1060590.1060670"},{"key":"17_CR42","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th FOCS, October 1999"},{"key":"17_CR43","unstructured":"StarkWare: ethSTARK documentation. Cryptology ePrint Archive, Report 2021\/582 (2021). https:\/\/eprint.iacr.org\/2021\/582"}],"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-48621-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:31Z","timestamp":1764119011000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48621-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486203","9783031486210"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48621-0_17","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":"27 November 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}