{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:12:25Z","timestamp":1778022745072,"version":"3.51.4"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253323","type":"print"},{"value":"9783032253330","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-25333-0_19","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:39:13Z","timestamp":1778020753000},"page":"544-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HQC Beyond the\u00a0Standard: Ciphertext Compression and\u00a0Refined DFR Analysis"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Bitzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Christophe","family":"Deneuville","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emma","family":"Munisamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bharath","family":"Purtipli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Ritterhoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"issue":"12","key":"19_CR1","doi-asserted-by":"publisher","first-page":"4511","DOI":"10.1007\/s10623-024-01507-6","volume":"92","author":"C Aguilar Melchor","year":"2024","unstructured":"Aguilar Melchor, C., Aragon, N., Deneuville, J.C., Gaborit, P., Lacan, J., Z\u00e9mor, G.: Efficient error-correcting codes for the HQC post-quantum cryptosystem. Des. Codes Crypt. 92(12), 4511\u20134530 (2024)","journal-title":"Des. Codes Crypt."},{"issue":"5","key":"19_CR2","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar Melchor","year":"2018","unstructured":"Aguilar Melchor, C., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theory 64(5), 3927\u20133943 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings, pp. 298\u2013307. IEEE (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"19_CR4","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: NewHope without reconciliation. Cryptology ePrint Archive, Report 2016\/1157 (2016). https:\/\/eprint.iacr.org\/2016\/1157"},{"issue":"7","key":"19_CR5","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051\u20133073 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Baldi, M., Bitzer, S., Lilla, N., Santini, P.: HQC beyond the BSC: towards error structure-aware decoding. In: Code-Based Cryptography Workshop, pp. 1\u201324. Springer (2025)","DOI":"10.1007\/978-3-031-90229-1_1"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 719\u2013737. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"19_CR8","unstructured":"Bitzer, S., Deneuville, J.C., Munisamy, E., Purtipli, B., Ritterhoff, S., Wachter-Zeh, A.: Accompanying repository. https:\/\/gitlab.com\/HQCCiphertextCompression\/hqc-with-ciphertext-compression (2025)"},{"key":"19_CR9","unstructured":"Bitzer, S., Deneuville, J.C., Munisamy, E., Purtipli, B., Ritterhoff, S., Wachter-Zeh, A.: HQC beyond the standard: ciphertext compression and refined DFR analysis. Cryptology ePrint Archive (2025)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bombar, M., Resch, N., Wiedijk, E.: On the independence assumption in quasi-cyclic code-based cryptography. In: ISIT, pp.\u00a01\u20136. IEEE (2025)","DOI":"10.1109\/ISIT63088.2025.11195347"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS&P), pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Leveraging linear decryption: Rate-1 fully-homomorphic encryption and time-lock puzzles. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019, Part\u00a0II. LNCS, vol. 11892, pp. 407\u2013437. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_16","DOI":"10.1007\/978-3-030-36033-7_16"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TIT.2007.913261","volume":"54","author":"D Burshtein","year":"2008","unstructured":"Burshtein, D.: On the error correction of regular LDPC codes using the flipping algorithm. IEEE Trans. Inf. Theory 54(2), 517\u2013530 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"19_CR15","unstructured":"Damg\u00e5rd, I., Park, S.: How practical is public-key encryption based on LPN and ring-LPN? Cryptology ePrint Archive (2012)"},{"issue":"5","key":"19_CR16","doi-asserted-by":"publisher","first-page":"3426","DOI":"10.1109\/TIT.2022.3143620","volume":"68","author":"T Debris-Alazard","year":"2022","unstructured":"Debris-Alazard, T., Ducas, L., Van Woerden, W.P.: An algorithmic reduction theory for binary codes: LLL and more. IEEE Trans. Inf. Theory 68(5), 3426\u20133444 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR17","unstructured":"Elias, P.: Coding for noisy channels. In: IRE WESCON Convention Record (1955)"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1236463.1236468","volume":"33","author":"L Fousse","year":"2007","unstructured":"Fousse, L., Hanrot, G., Lef\u00e8vre, V., P\u00e9lissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2), 13 (2007)","journal-title":"ACM Trans. Math. Softw."},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M.J. (ed.) CRYPTO\u201999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34","DOI":"10.1007\/3-540-48405-1_34"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s00145-011-9114-1","volume":"26","author":"E Fujisaki","year":"2011","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. J. Cryptol. 26(1), 80\u2013101 (2011). https:\/\/doi.org\/10.1007\/s00145-011-9114-1","journal-title":"J. Cryptol."},{"key":"19_CR21","unstructured":"Gaborit, P., et al.: HQC. Tech. rep., National Institute of Standards and Technology (2025), version of August (2025). https:\/\/pqc-hqc.org\/doc\/hqc_specifications_2025_08_22.pdf"},{"key":"19_CR22","unstructured":"Gallager, R.G.: Information theory and reliable communication. Springer (1968)"},{"key":"19_CR23","unstructured":"Glabush, L., H\u00f6velmanns, K., Stebila, D.: Tight multi-challenge security reductions for key encapsulation mechanisms. Cryptology ePrint Archive, Report 2025\/343 (2025). https:\/\/eprint.iacr.org\/2025\/343"},{"key":"19_CR24","first-page":"657","volume":"37","author":"MJ Golay","year":"1949","unstructured":"Golay, M.J.: Notes on digital coding. Proc. IEEE 37, 657 (1949)","journal-title":"Proc. IEEE"},{"key":"19_CR25","unstructured":"Green, R.: A serial orthogonal decoder. JPL Space Programs Summary 37 (1966)"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: A key recovery attack on MDPC with CCA security using decoding errors. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT\u00a02016, Part\u00a0I. LNCS, vol. 10031, pp. 789\u2013815. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_29","DOI":"10.1007\/978-3-662-53887-6_29"},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Techn. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Techn. J."},{"key":"19_CR28","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) TCC\u00a02017, Part\u00a0I. LNCS, vol. 10677, pp. 341\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"19_CR29","unstructured":"HQC Team: Official HQC implementation. https:\/\/gitlab.com\/pqc-hqc\/hqc (2025)"},{"key":"19_CR30","unstructured":"H\u00fclsing, A., et al.: SPHINCS+. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"19_CR31","unstructured":"Kawachi, A.: Hamming weight of product of random sparse polynomials. In: International Symposium on Information Theory and Its Applications. IEEE (2020)"},{"issue":"4","key":"19_CR32","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","volume":"56","author":"SB Korada","year":"2010","unstructured":"Korada, S.B., Urbanke, R.L.: Polar codes are optimal for lossy source coding. IEEE Trans. Inf. Theory 56(4), 1751\u20131768 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Liu, S., Sakzad, A.: Semi-compressed CRYSTALS-Kyber. In: International Conference on Provable Security, pp. 65\u201382. Springer (2024)","DOI":"10.1007\/978-981-96-0957-4_4"},{"key":"19_CR34","first-page":"1","volume-title":"Lattice codes for CRYSTALS-Kyber","author":"S Liu","year":"2025","unstructured":"Liu, S., Sakzad, A.: Lattice codes for CRYSTALS-Kyber, pp. 1\u201325. Designs, Codes and Cryptography (2025)"},{"key":"19_CR35","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"19_CR36","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes, vol.\u00a016. Elsevier (1977)"},{"issue":"195","key":"19_CR37","first-page":"403","volume":"57","author":"JA Maiorana","year":"1991","unstructured":"Maiorana, J.A.: A classification of the cosets of the Reed-Muller code $$\\cal{R} (1, 6)$$. Math. Comput. 57(195), 403\u2013414 (1991)","journal-title":"Math. Comput."},{"issue":"9","key":"19_CR38","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/TIT.2003.815805","volume":"49","author":"Y Matsunaga","year":"2003","unstructured":"Matsunaga, Y., Yamamoto, H.: A coding theorem for lossy data compression by LDPC codes. IEEE Trans. Inf. Theory 49(9), 2225\u20132229 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR39","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. The deep space network progress report 42-44, Jet Propulsion Laboratory, California Institute of Technology (1978). https:\/\/ipnpr.jpl.nasa.gov\/progress_report2\/42-44\/44N.PDF"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Mesnard, A., Tillich, J.P., Vasseur, V.: The syndrome weight distribution in quasi-cyclic codes, applications to BIKE and HQC. Accepted to: PQCrypto 2026 (2025). https:\/\/eprint.iacr.org\/2025\/2218","DOI":"10.1007\/978-3-032-22695-2_6"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Schultz, M.: Error correction and ciphertext quantization in lattice cryptography. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 648\u2013681. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_21","DOI":"10.1007\/978-3-031-38554-4_21"},{"key":"19_CR42","unstructured":"Moody, D., Alperin-Sheriff, D., Campagna, M.D., McKay, K.: Status report on the third round of the NIST PQC standardization process. NIST Interagency or Internal Report NIST IR 8545, National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/pubs\/ir\/8545\/final"},{"key":"19_CR43","unstructured":"Naehrig, M., et al.: FrodoKEM. Tech. rep., National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"19_CR44","unstructured":"National Institute of Standards and Technology: Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf"},{"key":"19_CR45","doi-asserted-by":"crossref","unstructured":"Ordentlich, O.: The Voronoi spherical CDF for lattices and linear codes: new bounds for quantization and coding. arXiv preprint arXiv:2506.19791 (2025)","DOI":"10.1109\/TIT.2026.3667652"},{"key":"19_CR46","doi-asserted-by":"publisher","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 333\u2013342. STOC \u201909, Association for Computing Machinery, New York (2009).https:\/\/doi.org\/10.1145\/1536414.1536461","DOI":"10.1145\/1536414.1536461"},{"key":"19_CR47","unstructured":"P\u00f6ppelmann, T., et al.: NewHope. Tech. rep., National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-2-submissions"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"P\u00f6ppelmann, T., G\u00fcneysu, T.: Towards practical lattice-based public-key encryption on reconfigurable hardware. In: International Conference on Selected Areas in Cryptography, pp. 68\u201385. Springer (2013)","DOI":"10.1007\/978-3-662-43414-7_4"},{"key":"19_CR49","unstructured":"Prest, T., et al.: FALCON. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"issue":"8","key":"19_CR50","doi-asserted-by":"publisher","first-page":"5075","DOI":"10.1109\/TIT.2022.3167629","volume":"68","author":"S Puchinger","year":"2022","unstructured":"Puchinger, S., Renner, J., Rosenkilde, J.: Generic decoding in the sum-rank metric. IEEE Trans. Inf. Theory 68(8), 5075\u20135097 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"19_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"19_CR52","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"19_CR53","doi-asserted-by":"publisher","unstructured":"Sendrier, N., Vasseur, V.: On the decoding failure rate of QC-MDPC bit-flipping decoders. In: Ding, J., Steinwandt, R. (eds.) Post-Quantum Cryptography - 10th International Conference, PQCrypto 2019, pp. 404\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_22","DOI":"10.1007\/978-3-030-25510-7_22"},{"issue":"142\u2013163","key":"19_CR54","first-page":"1","volume":"4","author":"CE Shannon","year":"1959","unstructured":"Shannon, C.E.: Coding theorems for a discrete source with a fidelity criterion. IRE Nat. Conv. Rec 4(142\u2013163), 1 (1959)","journal-title":"IRE Nat. Conv. Rec"},{"key":"19_CR55","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"19_CR56","unstructured":"Vasseur, V.: Post-quantum cryptography: a study of the decoding of QC-MDPC codes. Ph.D. thesis, Universit\u00e9 Paris Cit\u00e9 (2021)"},{"issue":"3","key":"19_CR57","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1109\/TIT.2009.2039160","volume":"56","author":"MJ Wainwright","year":"2010","unstructured":"Wainwright, M.J., Maneva, E., Martinian, E.: Lossy source compression using low-density generator matrix codes: analysis and algorithms. IEEE Trans. Inf. Theory 56(3), 1351\u20131368 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR58","doi-asserted-by":"crossref","unstructured":"Zamir, R.: Lattice coding for signals and networks: a structured coding approach to quantization, modulation, and multiuser information theory. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781139045520"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25333-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:39:38Z","timestamp":1778020778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25333-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253323","9783032253330"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25333-0_19","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":"6 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}