{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:22:25Z","timestamp":1780053745519,"version":"3.54.0"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122865","type":"print"},{"value":"9783032122872","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12287-2_13","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:17:56Z","timestamp":1764605876000},"page":"369-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Linear-Time Accumulation Schemes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2082-4480","authenticated-orcid":false,"given":"Benedikt","family":"B\u00fcnz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessandro","family":"Chiesa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3702-1780","authenticated-orcid":false,"given":"Giacomo","family":"Fenzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6485-9714","authenticated-orcid":false,"given":"William","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: Reed\u2013Solomon proximity testing with fewer queries. In: CRYPTO 2024 (2024)","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: Reed\u2013Solomon proximity testing with super-fast verification. In: EUROCRYPT 2025 (2025)","DOI":"10.1007\/978-3-031-91134-7_8"},{"key":"13_CR3","unstructured":"Applebaum, B., Haramaty-Krasne, N., Ishai, Y., Kushilevitz, E., Vaikuntananthan, V.: Low-complexity cryptographic hash functions. In: ITCS 2017 (2017)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS 2017 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: STOC 1996 (1996)","DOI":"10.1145\/237814.237838"},{"key":"13_CR6","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed\u2013Solomon interactive oracle proofs of proximity. In: ICALP 2018 (2018)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: generic efficient accumulation\/folding for special-sound protocols. In: ASIACRYPT 2023 (2023)","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"13_CR8","unstructured":"Boneh, D., Chen, B.: LatticeFold: a lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive, Paper 2024\/257 (2024)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Chen, B.: Faster, simpler, shorter lattice-based folding for succinct proof systems. Cryptology ePrint Archive, Paper 2025\/247 (2025)","DOI":"10.1007\/978-3-032-01907-3_11"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKs and proof-carrying data. In: STOC 2013 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R.D., Zeilberger, H.: Blaze: fast SNARKs from interleaved RAA codes. In: EUROCRYPT 2025 (2025)","DOI":"10.1007\/978-3-031-91134-7_5"},{"key":"13_CR12","unstructured":"B\u00fcnz, B., Chiesa, A., Fenzi, G., Wang, W.: Linear-time accumulation schemes. Cryptology ePrint Archive, Paper 2025\/753 (2025)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 90\u2013108. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-70700-6_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"J Bootle","year":"2017","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 336\u2013365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-030-36033-7_19","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Goldberg, L., Gur, T., Riabzev, M., Spooner, N.: Linear-size constant-query IOPs for delegating computation. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 494\u2013521. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_19"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: TCC 2020 (2020)","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Boyle, E., Cohen, R., Goel, A.: Breaking the $$O(\\sqrt{n})$$-bit barrier: byzantine agreement with polylog bits per party. J. Cryptol. (2024)","DOI":"10.1007\/s00145-023-09484-0"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for Reed\u2013Solomon codes. In: FOCS 2020 (2020)","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-030-84242-0_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"B B\u00fcnz","year":"2021","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 681\u2013710. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Liu, S.: Zero-knowledge IOPs with linear- time prover and polylogarithmic-time verifier. In: EUROCRYPT 2022 (2022)","DOI":"10.1007\/978-3-031-07085-3_10"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: TCC 2020 (2020)","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"13_CR22","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":"13_CR23","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: CRYPTO 2014 (2014)","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"13_CR24","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019)"},{"key":"13_CR25","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: ITCS 2020 (2020)"},{"key":"13_CR26","unstructured":"Baweja, A., Mishra, P., Mopuri, T., Shtepel, M.: FICS and FACS: fast IOPPs and accumulation via code-switching. Cryptology ePrint Archive, Report 2025\/737 (2025)"},{"key":"13_CR27","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. In: ITCS 2025 (2025)"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: ARC: accumulation for Reed\u2013Solomon codes. In: CRYPTO 2025 (2025)","DOI":"10.1007\/978-3-032-01907-3_5"},{"key":"13_CR29","unstructured":"Bonneau, J., Meckler, I., Rao, V., Shapiro, E.: Coda: decentralized cryptocurrency at scale. Cryptology ePrint Archive, Report 2020\/352 (2020)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: EUROCRYPT 2023 (2023)","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"13_CR31","unstructured":"Chen, W., Chiesa, A., Dauterman, E., Ward, N.P.: Reducing participation costs via incremental verification for ledger systems. Cryptology ePrint Archive, Report 2020\/1522 (2020)"},{"key":"13_CR32","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D.: Fiat\u2013Shamir from simpler assumptions. Cryptology ePrint Archive, Report 2018\/1004 (2018)"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-36033-7_1","volume-title":"Theory of Cryptography","author":"A Chiesa","year":"2019","unstructured":"Chiesa, A., Manohar, P., Spooner, N.: Succinct arguments in the quantum random oracle model. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 1\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_1"},{"key":"13_CR34","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: ICS 2010 (2010)"},{"key":"13_CR35","unstructured":"Chong, S., Tromer, E., Vaughan, J.A.: Enforcing language semantics using proof-carrying data. Cryptology ePrint Archive, Report 2013\/513 (2013)"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-662-46803-6_13","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"A Chiesa","year":"2015","unstructured":"Chiesa, A., Tromer, E., Virza, M.: Cluster computing in zero knowledge. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 371\u2013403. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_13"},{"key":"13_CR37","unstructured":"Chiesa, A., Yogev, E.: Building Cryptographic Proofs from Hash Functions (2024). https:\/\/github.com\/hash-based-snargs-book"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the Gilbert\u2013 Varshamov bound and their cryptographic applications. In: ITCS 2014 (2014)","DOI":"10.1145\/2554797.2554815"},{"key":"13_CR39","unstructured":"Dellepere, M., Mishra, P., Shirzad, A.: Garuda and Pari: faster and smaller SNARKs via equifficient polynomial commitments. Cryptology ePrint Archive, Paper 2024\/1245 (2024)"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Diamond, B.E., Posen, J.: Proximity testing with logarithmic randomness. In: IACR Communications in Cryptology (2024)","DOI":"10.62056\/aksdkp10"},{"key":"13_CR41","unstructured":"Eagen, L., Gabizon, A.: ProtoGalaxy: efficient ProtoStar-style folding of multiple instances. Cryptology ePrint Archive, Report 2023\/1106 (2023)"},{"key":"13_CR42","doi-asserted-by":"crossref","unstructured":"Fenzi, G., Knabenhans, C., Nguyen, N.K., Pham, D.T.: Lova: lattice-based folding scheme from unstructured lattices. In: ASIACRYPT 2024 (2024)","DOI":"10.1007\/978-981-96-0894-2_10"},{"key":"13_CR43","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Indyk, P.: Linear-time encodable\/decodable codes with near-optimal rate. IEEE Trans. Inf. Theory (2005). Preliminary version appeared in STOC \u201903","DOI":"10.1109\/TIT.2005.855587"},{"key":"13_CR44","unstructured":"Gao, Y., Kan, H., Li, Y.: Linear proximity gap for linear codes within the 1.5 Johnson bound. Cryptology ePrint Archive, Report 2024\/1810 (2024)"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: CRYPTO 2023 (2023)","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"13_CR46","unstructured":"Guruswami, V., Rudra, A., Sudan, M.: Essential coding theory, vol. 2.1 (2012)"},{"key":"13_CR47","unstructured":"Kattis, A., Bonneau, J.: Proof of necessary work: succinct state verification with fairness guarantees. Cryptology ePrint Archive, Report 2020\/190 (2020)"},{"key":"13_CR48","doi-asserted-by":"crossref","unstructured":"Kothapalli, A., Setty, S.T.V.: HyperNova: recursive arguments for customizable constraint systems. In: CRYPTO 2024 (2024)","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"13_CR49","doi-asserted-by":"crossref","unstructured":"Kothapalli, A., Setty, S.T.V., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: CRYPTO 2022 (2022)","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"13_CR50","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":"13_CR51","unstructured":"Mina. https:\/\/minaprotocol.com\/"},{"key":"13_CR52","doi-asserted-by":"crossref","unstructured":"Nguyen, W.D., Datta, T., Chen, B., Tyagi, N., Boneh, D.: Mangrove: a scalable framework for folding-based SNARKs. In: CRYPTO 2024 (2024)","DOI":"10.1007\/978-3-031-68403-6_10"},{"key":"13_CR53","unstructured":"Nguyen, W., Setty, S.: Neo: lattice-based folding scheme for CCS over small fields and pay-per-bit commitments. Cryptology ePrint Archive, Paper 2025\/294 (2025)"},{"key":"13_CR54","doi-asserted-by":"crossref","unstructured":"Naveh, A., Tromer, E.: PhotoProof: cryptographic image authentication for any set of permissible transformations. In: SP 2016 (2016)","DOI":"10.1109\/SP.2016.23"},{"key":"13_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"13_CR56","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM J. Comput. (1980)","DOI":"10.1137\/0209022"},{"key":"13_CR57","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. In: STOC 2022 (2022)","DOI":"10.1145\/3519935.3519956"},{"key":"13_CR58","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, R., Rothblum, G.: Constant-round interactive proofs for delegating computation. In: STOC 2016 (2016)","DOI":"10.1145\/2897518.2897652"},{"key":"13_CR59","doi-asserted-by":"crossref","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory (1996). Preliminary version appeared in STOC \u201995","DOI":"10.1145\/225058.225165"},{"key":"13_CR60","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive, Report 2023\/552 (2023)"},{"key":"13_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1"},{"key":"13_CR62","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: CRYPTO 2024, vol. 14929 (2024)","DOI":"10.1007\/978-3-031-68403-6_5"},{"key":"13_CR63","unstructured":"Zeilberger, H.: Khatam: Reducing the Communication Complexity of Code-Based SNARKs. Cryptology ePrint Archive, Report 2024\/1843 (2024)"},{"key":"13_CR64","unstructured":"Zhang, C., Yang, X., Oswald, D., Ryan, M., Jovanovic, P.: Eva: Efficient IVC-Based Authentication of Lossy-Encoded Videos. Cryptology ePrint Archive, Report 2024\/1436 (2024)"}],"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-032-12287-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:18:16Z","timestamp":1764605896000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12287-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122865","9783032122872"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12287-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"2 December 2025","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}