{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T08:46:28Z","timestamp":1780044388197,"version":"3.53.1"},"publisher-location":"Cham","reference-count":50,"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_12","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:18:07Z","timestamp":1764605887000},"page":"335-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear Prover IOPs in\u00a0Log Star Rounds"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0533-4954","authenticated-orcid":false,"given":"Noor","family":"Athamnah","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8416-893X","authenticated-orcid":false,"given":"Noga","family":"Ron-Zewi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5481-7276","authenticated-orcid":false,"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"12_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-031-68403-6_12","volume-title":"Advances in Cryptology - CRYPTO 2024, Part X","author":"G Arnon","year":"2024","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: reed-solomon proximity testing with fewer queries. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part X. LNCS, vol. 14929, pp. 380\u2013413. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_12"},{"key":"12_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-031-91134-7_8","volume-title":"Advances in Cryptology - EUROCRYPT 2025, Part IV","author":"G Arnon","year":"2025","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: reed-solomon proximity testing with super-fast verification. In: Fehr, S., Fouque, P.-A. (eds.) EUROCRYPT 2025, Part IV. LNCS, vol. 15604, pp. 214\u2013243. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_8"},{"key":"12_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-031-07085-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2022, Part II","author":"G Arnon","year":"2022","unstructured":"Arnon, G., Chiesa, A., Yogev, E.: A PCP theorem for interactive proofs and applications. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 64\u201394. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_3"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Yogev, E.: IOPs with inverse polynomial soundness error. In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, 6\u20139 November 2023, pp. 752\u2013761. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00050"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Alon, N., Edmonds, J., Luby, M.: Linear time erasure codes with nearly optimal recovery. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 512\u2013519. IEEE Computer Society (1995)","DOI":"10.1109\/SFCS.1995.492581"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, 30 October\u201303 November 2017, pp. 2087\u20132104. ACM (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"12_CR7","unstructured":"Athamnah, N., Ron-Zewi, N., Rothblum, R.: Linear prover IOPs in log star rounds. Electron. Colloquium Comput. Complex. TR25-090 (2025)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14\u201317 October 2001, Las Vegas, Nevada, USA, pp. 106\u2013115. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-030-36033-7_20","volume-title":"Theory of Cryptography","author":"J Bartusek","year":"2019","unstructured":"Bartusek, J., Bronfman, L., Holmgren, J., Ma, F., Rothblum, R.D.: On the (in)security of kilian-based SNARGs. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 522\u2013551. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_20"},{"key":"12_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-031-91134-7_5","volume-title":"Advances in Cryptology - EUROCRYPT 2025, Part IV","author":"M Brehm","year":"2025","unstructured":"Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R.D., Zeilberger, H.: Blaze: fast SNARKs from interleaved RAA codes. In: Fehr, S., Fouque, P.-A. (eds.) EUROCRYPT 2025, Part IV. LNCS, vol. 15604, pp. 123\u2013152. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_5"},{"key":"12_CR11","unstructured":"B\u00fcnz, B., Chiesa, A., Fenzi, G., Wang, W.: Linear-time accumulation schemes. Cryptology ePrint Archive, Paper 2025\/753 (2025)"},{"key":"12_CR12","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":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-64378-2_2","volume-title":"Theory of Cryptography","author":"J Bootle","year":"2020","unstructured":"Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 19\u201346. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_2"},{"key":"12_CR14","unstructured":"Bootle, J., Chiesa, A., Guan, Z., Liu, S.: Linear-time probabilistic proofs with sublinear verification for algebraic automata over every field. IACR Cryptol. ePrint Arch. 1056 (2022)"},{"key":"12_CR15","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":"12_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-031-68403-6_9","volume-title":"Advances in Cryptology - CRYPTO 2024, Part X","author":"AR Block","year":"2024","unstructured":"Block, A.R., Fang, Z., Katz, J., Thaler, J., Waldner, H., Zhang, Y.: Field-agnostic SNARKs from expand-accumulate codes. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part X. LNCS, vol. 14929, pp. 276\u2013307. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_9"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 5\u20138 May 1991, New Orleans, Louisiana, USA, pp. 21\u201331 (1991)","DOI":"10.1145\/103418.103428"},{"key":"12_CR18","unstructured":"Baweja, A., Mishra, P., Mopuri, T., Shtepel, M.: FICS and FACS: fast IOPPs and accumulation via code-switching. Cryptology ePrint Archive, Paper 2025\/737 (2025)"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050646445","volume":"38","author":"E Ben-Sasson","year":"2008","unstructured":"Ben-Sasson, E., Sudan, M.: Short PCPs with polylog query complexity. SIAM J. Comput. 38(2), 551\u2013607 (2008)","journal-title":"SIAM J. Comput."},{"key":"12_CR20","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D.: Fiat-Shamir from simpler assumptions. IACR Cryptol. ePrint Arch. 1004 (2018)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, 23\u201326 June 2019, pp. 1082\u20131090. ACM (2019)","DOI":"10.1145\/3313276.3316380"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. J. ACM 54(3), 12 (2007)","journal-title":"J. ACM"},{"key":"12_CR23","unstructured":"Diamond, B.E., Posen, J.: Polylogarithmic proofs for multilinears over binary towers. Cryptology ePrint Archive (2024)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11830924_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I Dinur","year":"2006","unstructured":"Dinur, I., Sudan, M., Wigderson, A.: Robust local testability of tensor products of LDPC codes. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX\/RANDOM -2006. LNCS, vol. 4110, pp. 304\u2013315. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11830924_29"},{"key":"12_CR25","unstructured":"Dao, Q., Thaler, J.: More optimizations to sum-check proving. IACR Cryptol. ePrint Arch. 1210 (2024)"},{"key":"12_CR26","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":"12_CR27","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11\u201314 October 2003, Cambridge, MA, USA, Proceedings, pp. 102\u2013113. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"12_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-031-38545-2_7","volume-title":"Advances in Cryptology - CRYPTO 2023, Part II","author":"A Golovnev","year":"2023","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 193\u2013226. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7"},{"key":"12_CR29","unstructured":"Gur, T., Ramnarayan, G., Rothblum, R.: Relaxed locally correctable codes. In: 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, 11\u201314 January 2018, Cambridge, MA, USA, pp. 27:1\u201327:11 (2018)"},{"key":"12_CR30","unstructured":"Gruen, A.: Some improvements for the PIOP for zerocheck. IACR Cryptol. ePrint Arch. 108 (2024)"},{"key":"12_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-031-15802-5_17","volume-title":"Advances in Cryptology - CRYPTO 2022, Part I","author":"J Holmgren","year":"2022","unstructured":"Holmgren, J., Rothblum, R.D.: Faster sounder succinct arguments and IOPs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 474\u2013503. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_17"},{"key":"12_CR32","unstructured":"Holmgren, J., Rothblum, R.: Linear-size Boolean circuits for multiselection. In: Santhanam, R. (ed.) 39th Computational Complexity Conference, CCC 2024, 22\u201325 July 2024, Ann Arbor, MI, USA. LIPIcs, vol. 300, pp. 11:1\u201311:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Khovratovich, D., Rothblum, R.D., Soukhanov, L.: How to prove false statements: practical attacks on Fiat-Shamir. IACR Cryptol. ePrint Arch. 118 (2025)","DOI":"10.1007\/978-3-032-01887-8_1"},{"issue":"4","key":"12_CR34","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","journal-title":"J. ACM"},{"issue":"1","key":"12_CR35","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/110829660","volume":"42","author":"O Meir","year":"2013","unstructured":"Meir, O.: IP = PSPACE using error-correcting codes. SIAM J. Comput. 42(1), 380\u2013403 (2013)","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"12_CR36","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10472-009-9169-y","volume":"56","author":"T Mie","year":"2009","unstructured":"Mie, T.: Short PCPPs verifiable in polylogarithmic time with O(1) queries. Ann. Math. Artif. Intell. 56(3\u20134), 313\u2013338 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"key":"12_CR37","unstructured":"Nair, V., Sharma, A., Thankey, B.: BrakingBase - a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme. IACR Cryptol. ePrint Arch. 1825 (2024)"},{"issue":"3","key":"12_CR38","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/3661483","volume":"71","author":"N Ron-Zewi","year":"2024","unstructured":"Ron-Zewi, N., Rothblum, R.: Local proofs approaching the witness length. J. ACM 71(3), 18 (2024)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3721477","volume":"72","author":"Noga Ron-Zewi","year":"2025","unstructured":"Ron-Zewi, Noga, Rothblum, Ron: Proving as fast as computing: succinct arguments with constant prover overhead. J. ACM 72(2), 1\u201354 (2025)","journal-title":"J. ACM"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. SIAM J. Comput. 50(3) (2021)","DOI":"10.1137\/16M1096773"},{"key":"12_CR41","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-031-68403-6_4","volume-title":"Advances in Cryptology - CRYPTO 2024, Part X","author":"N Ron-Zewi","year":"2024","unstructured":"Ron-Zewi, N., Weiss, M.: Zero-knowledge IOPs approaching witness length. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part X. LNCS, vol. 14929, pp. 105\u2013137. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_4"},{"issue":"6","key":"12_CR42","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"DA Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR43","unstructured":"Succinct. SP1 hardware acceleration. Accessed 17 June 2025"},{"key":"12_CR44","unstructured":"Sudan, M.: Algorithmic introduction to coding theory (lecture notes) (2001)"},{"issue":"2\u20134","key":"12_CR45","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/3300000030","volume":"4","author":"J Thaler","year":"2022","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge. Found. Trends Priv. Secur. 4(2\u20134), 117\u2013660 (2022)","journal-title":"Found. Trends Priv. Secur."},{"issue":"3","key":"12_CR46","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1002\/rsa.20498","volume":"46","author":"M Viderman","year":"2015","unstructured":"Viderman, M.: A combination of testability and decodability by tensor products. Random Struct. Algorithms 46(3), 572\u2013598 (2015)","journal-title":"Random Struct. Algorithms"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Vu, V., Setty, S., Blumberg, A.J., Walfish, M.: A hybrid architecture for interactive verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, USA, 19\u201322 May 2013, pp. 223\u2013237. IEEE Computer Society (2013)","DOI":"10.1109\/SP.2013.48"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139856065"},{"issue":"4","key":"12_CR49","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1080\/00150517.1988.12429608","volume":"26","author":"D Wiedemann","year":"1988","unstructured":"Wiedemann, D.: An iterated quadratic extension of GF(2). Fibonacci Quart. 26(4), 290\u2013295 (1988)","journal-title":"Fibonacci Quart."},{"key":"12_CR50","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-031-15985-5_11","volume-title":"Advances in Cryptology - CRYPTO 2022, Part IV","author":"T Xie","year":"2022","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: zero knowledge proof with linear prover time. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part IV. LNCS, vol. 13510, pp. 299\u2013328. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11"}],"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_12","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_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122865","9783032122872"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12287-2_12","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"}}]}}