{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:31:14Z","timestamp":1786368674202,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354266","type":"print"},{"value":"9783032354242","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-35424-2_5","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:00:27Z","timestamp":1786366827000},"page":"125-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pairing-Based SNARGs with Two Group Elements"],"prefix":"10.1007","author":[{"given":"Gal","family":"Arnon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesko","family":"Dujmovic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: Reed\u2013Solomon proximity testing with fewer queries. In: Proceedings of the 44th Annual International Cryptology Conference, CRYPTO 2024, pp. 380\u2013413 (2024)","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: Reed-Solomon proximity testing with super-fast verification. In: Fehr, S., Fouque, P. (eds.) 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2025, pp. 214\u2013243 (2025)","DOI":"10.1007\/978-3-031-91134-7_8"},{"key":"5_CR3","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, pp. 752\u2013761. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00050"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Arnon, G., Dujmovic, J., Ishai, Y.: Designated-verifier SNARGs with one group element. In: Annual International Cryptology Conference, pp. 192\u2013224. Springer (2025)","DOI":"10.1007\/978-3-032-01907-3_7"},{"key":"5_CR5","unstructured":"Arnon, G., Dujmovic, J., Yogev, E.: Pairing-based SNARGs with two group elements. In: Cryptology ePrint Archive (2025)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Fenzi, G., Lapiha, O., Nguyen, N.K.: SLAP: succinct lattice-based polynomial commitments from standard assumptions. In: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques. EUROCRYPT 2024, pp. 90\u2013 119. Springer (2024)","DOI":"10.1007\/978-3-031-58754-2_4"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Proceedings of the 24th ACM Conference on Computer and Communications Security. CCS 2017, pp. 2087\u20132104 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3) (1998). Preliminary version in FOCS 1992, pp. 501\u2013555","DOI":"10.1145\/278298.278306"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: Proceedings of the 39th IEEE Symposium on Security and Privacy. S&P 2018, pp. 315\u2013334 (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"5_CR10","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed\u2013Solomon interactive oracle proofs of proximity. In: Proceedings of the 45th International Colloquium on Automata, Languages and Programming. ICALP 2018, pp. 14:1\u201314:17 (2018)"},{"key":"5_CR11","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":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: Proceedings of the 10th Theory of Cryptography Conference, TCC 2013, pp. 315\u2013333 (2013)","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Proceedings of the 14th Theory of Cryptography Conference, TCC 2016-B, pp. 31\u201360 (2016)","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: IACR Cryptology ePrint Archive, p. 400 (2013)","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Harsha, P., Ishai, Y., Rothblum, R.D., Wu, D.J.: Dot-product proofs and their applications. In: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pp. 806\u2013825. IEEE (2024)","DOI":"10.1109\/FOCS61266.2024.00057"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-030-56784-2_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"O Barta","year":"2020","unstructured":"Barta, O., Ishai, Y., Ostrovsky, R., Wu, D.J.: On succinct arguments and witness encryption from groups. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 776\u2013806. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_26"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-56617-7_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Lattice-based SNARGs and their application to more efficient obfuscation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 247\u2013277. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_9"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In: 43rd Annual International Cryptology Conference. CRYPTO 2023, pp. 518\u2013548. Springer (2023)","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"5_CR20","unstructured":"Chiesa, A., Guan, Z., Knabenhans, C., Yu, Z.: On the Fiat-Shamir security of succinct arguments from functional commitments. In: IACR Cryptology ePrint Archive, p. 902 (2025). https:\/\/eprint.iacr.org\/2025\/902"},{"key":"5_CR21","unstructured":"Chiesa, A., Yogev, E.: Building Cryptographic Proofs from Hash Functions (2024). https:\/\/github.com\/hash-based-snargs-book"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-662-45611-8_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"G Danezis","year":"2014","unstructured":"Danezis, G., Fournet, C., Groth, J., Kohlweiss, M.: Square span programs with applications to succinct NIZK arguments. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 532\u2013550. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_28"},{"key":"5_CR23","unstructured":"Dellepere, M., Mishra, P., Shirzad, A.: Garuda and pari: faster and smaller SNARKs via equifficient polynomial commitments. In: IACR Cryptology ePrint Archive, p. 1245 (2024)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"5_CR25","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":"5_CR26","unstructured":"Galbraith, S.: New discrete logarithm records and the death of Type 1 pairings. EllipticNews Blog (2014). https:\/\/ellipticnews.wordpress.com\/2014\/02\/01\/new-discrete-logarithm-records-andthe-death-of-type-1-pairings\/"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"key":"5_CR28","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: Proceedings of the 43rd Annual International Cryptology Conference, CRYPTO 2023 (2023)","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 321\u2013340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Haitner, I., Nukrai, D., Yogev, E.: Lower bound on SNARGs in the random oracle model. In: 42nd Annual International Cryptology Conference. CRYPTO 2022, pp. 97\u2013127. Springer (2022)","DOI":"10.1007\/978-3-031-15982-4_4"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-30576-7_24","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2005","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Sufficient conditions for collision-resistant hashing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 445\u2013456. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_24"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Efficient arguments without short PCPs. In: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity. CCC 2007, pp. 278\u2013291 (2007)","DOI":"10.1109\/CCC.2007.10"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Luo, J., Wichs, D.: The pseudorandom oracle model and ideal obfuscation. In: 43rd Annual International Cryptology Conference, CRYPTO 2023, vol. 14084, pp. 233\u2013262. Springer (2023)","DOI":"10.1007\/978-3-031-38551-3_8"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, p. 25. IEEE Computer Society (2002)","DOI":"10.1109\/CCC.2002.1004334"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing. STOC 1992, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In: Proceedings of the 9th Theory of Cryptography Conference on Theory of Cryptography. TCC 2012, pp. 169\u2013189 (2012)","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: Polymath: groth16 is not the limit. In: 44th Annual International Cryptology Conference, CRYPTO 2024, vol. 14929, pp. 170\u2013206. Springer (2024)","DOI":"10.1007\/978-3-031-68403-6_6"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-26948-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"RWF Lai","year":"2019","unstructured":"Lai, R.W.F., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 530\u2013560. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_19"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"U Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4) (2000). A version appeared in FOCS 1994, pp. 1253\u20131298","DOI":"10.1137\/S0097539795284959"},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"VI Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Math. Notes 55, 165\u2013172 (1994)","journal-title":"Math. Notes"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptographic Techniques. EUROCRYPT 1997, pp. 256\u2013266 (1997)","DOI":"10.1007\/3-540-69053-0_18"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Steinfeld, R., Sakzad, A., Esgin, M.F., Kuchta, V., Yassi, M., Zhao, R.K.: LUNA: quasi-optimally succinct designated-verifier zero-knowledge arguments from lattices. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. CCS 2024, pp. 3167\u20133181. ACM (2024)","DOI":"10.1145\/3658644.3670345"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Samorodnitsky, A., Trevisan, L.: Gowers uniformity, influence of variables, and PCPs. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 11\u201320 (2006)","DOI":"10.1145\/1132516.1132519"},{"key":"5_CR46","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. In: IACR Cryptology ePrint Archive, p. 552 (2023)"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: Adaptively-sound succinct arguments for NP from indistinguishability obfuscation. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. STOC 2024, pp. 387\u2013398. ACM (2024)","DOI":"10.1145\/3618260.3649671"},{"key":"5_CR49","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for sfNP. In: Proceedings of the 45th Annual International Cryptology Conference, CRYPTO 2025, vol. 16006, pp. 292\u2013326. Springer (2025)","DOI":"10.1007\/978-3-032-01907-3_10"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Waters, B., Zhandry, M.: Adaptive security in SNARGs via iO and lossy functions. In: 44th Annual International Cryptology Conference, CRYPTO 2024, vol. 14929, pp. 72\u2013104 (2024)","DOI":"10.1007\/978-3-031-68403-6_3"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: Proceedings of the 44th Annual International Cryptology Conference, CRYPTO 2024, vol. 14929, pp. 138\u2013169 (2024)","DOI":"10.1007\/978-3-031-68403-6_5"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35424-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:00:31Z","timestamp":1786366831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35424-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354266","9783032354242"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35424-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"11 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}