{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T01:34:48Z","timestamp":1775871288501,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":53,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609437","type":"print"},{"value":"9789819609444","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0944-4_10","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T05:59:11Z","timestamp":1733896751000},"page":"299-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Reducing the\u00a0Number of\u00a0Qubits in\u00a0Quantum Information Set Decoding"],"prefix":"10.1007","author":[{"given":"Cl\u00e9mence","family":"Chevignard","sequence":"first","affiliation":[]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Schrottenloher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"10_CR1","unstructured":"Aguilar\u00a0Melchor, C., Aragon, N., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.C., Gaborit, P., Persichetti, E., , Z\u00e9mor, G., Bos, J., Dion, A., Lacan, J., Robert, J.M., V\u00e9ron, P.: Hamming quasi-cyclic (HQC). Submission to the NIST PQC process, Round 4 (2022), https:\/\/pqc-hqc.org\/"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An O(n log n) sorting network. In: STOC. pp.\u00a01\u20139. ACM (1983). https:\/\/doi.org\/10.1145\/800061.808726","DOI":"10.1145\/800061.808726"},{"key":"10_CR3","unstructured":"Aragon, N., Barreto, P., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.C., Gaborit, P., Gueron, S., G\u00fcneysu, T., Aguilar\u00a0Melchor, C., Misoczki, R., Persichetti, E., Sendrier, N., Tillich, J.P., Z\u00e9mor, G., Vasseur, V., Ghosh, S., Richter-Brokmann, J.: BIKE: bit flipping key encapsulation. Submission to the NIST PQC process, Round 4 (2022), https:\/\/bikesuite.org\/"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Eidenbenz, S.J.: Short-depth circuits for Dicke state preparation. In: QCE. pp. 87\u201396. IEEE (2022). https:\/\/doi.org\/10.1109\/QCE53715.2022.00027","DOI":"10.1109\/QCE53715.2022.00027"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference. AFIPS Conference Proceedings, vol.\u00a032, pp. 307\u2013314. Thomson Book Company, Washington D.C. (1968). https:\/\/doi.org\/10.1145\/1468075.1468121","DOI":"10.1145\/1468075.1468121"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$: How $$1 + 1 = 0$$ improves information set decoding. In: EUROCRYPT. Lecture Notes in Computer Science, vol.\u00a07237, pp. 520\u2013536. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31","DOI":"10.1007\/978-3-642-29011-4_31"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18(4), 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"key":"10_CR8","unstructured":"Berlekamp, E.R.: Algebraic coding theory. McGraw-Hill series in systems science, McGraw-Hill (1968), https:\/\/www.worldcat.org\/oclc\/00256659"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Grover vs. mceliece. In: PQCrypto. Lecture Notes in Computer Science, vol.\u00a06061, pp. 73\u201380. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_6","DOI":"10.1007\/978-3-642-12929-2_6"},{"key":"10_CR11","unstructured":"Bernstein, D.J.: Verified fast formulas for control bits for permutation networks. IACR Cryptol. ePrint Arch. p.\u00a01493 (2020), https:\/\/eprint.iacr.org\/2020\/1493"},{"key":"10_CR12","unstructured":"Bernstein, D.J., Chou, T., Cid, C., Gilcher, J., Lange, T., Maram, V., von Maurich, I., Misoczki, R., Niederhagen, R., Persichetti, E., Peters, C., Sendrier, N., Szefer, J., Tjhai, C.J., Tomlinson, M., Wang, W.: Classic McEliece: conservative code-based cryptography. Submission to the NIST PQC process, Round 4 (2022), https:\/\/classic.mceliece.org"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Yang, B.: Asymptotically faster quantum algorithms to solve multivariate quadratic equations. In: PQCrypto. Lecture Notes in Computer Science, vol. 10786, pp. 487\u2013506. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_23","DOI":"10.1007\/978-3-319-79063-3_23"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Bonnetain, X., Jaques, S.: Quantum period finding against symmetric primitives in practice. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1), 1\u201327 (2022). https:\/\/doi.org\/10.46586\/TCHES.V2022.I1.1-27","DOI":"10.46586\/TCHES.V2022.I1.1-27"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: PQCrypto. Lecture Notes in Computer Science, vol. 10786, pp. 25\u201346. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_2","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemporary Mathematics 305, 53\u201374 (2002). https:\/\/doi.org\/10.1090\/conm\/305\/05215","journal-title":"Contemporary Mathematics"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Brent, R.P., Gaudry, P., Thom\u00e9, E., Zimmermann, P.: Faster multiplication in gf(2)[x]. In: ANTS. Lecture Notes in Computer Science, vol.\u00a05011, pp. 153\u2013166. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-79456-1_10","DOI":"10.1007\/978-3-540-79456-1_10"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Cantor, D.G.: On arithmetical algorithms over finite fields. J. Comb. Theory, Ser. A 50(2), 285\u2013300 (1989). https:\/\/doi.org\/10.1016\/0097-3165(89)90020-4","DOI":"10.1016\/0097-3165(89)90020-4"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Chailloux, A., Debris-Alazard, T., Etinski, S.: Classical and quantum algorithms for generic syndrome decoding problems and applications to the lee metric. In: PQCrypto. Lecture Notes in Computer Science, vol. 12841, pp. 44\u201362. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_3","DOI":"10.1007\/978-3-030-81293-5_3"},{"key":"10_CR20","unstructured":"Chevignard, C., Fouque, P., Schrottenloher, A.: Reducing the number of qubits in quantum information set decoding. IACR Cryptol. ePrint Arch. p.\u00a0907 (2024), https:\/\/eprint.iacr.org\/2024\/907"},{"issue":"3\u20134","key":"10_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<197::AID-RSA2>3.0.CO;2-K","volume":"17","author":"C Cooper","year":"2000","unstructured":"Cooper, C.: On the distribution of rank of a random matrix over a finite field. Random Struct. Algorithms 17(3-4), 197\u2013212 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"10_CR22","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit (2004)"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Czumaj, A.: Random permutations using switching networks. In: STOC. pp. 703\u2013712. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746629","DOI":"10.1145\/2746539.2746629"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Dornstetter, J.: On the equivalence between Berlekamp\u2019s and Euclid\u2019s algorithms (corresp.). IEEE transactions on information theory 33(3), 428\u2013431 (1987)","DOI":"10.1109\/TIT.1987.1057299"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Ducas, L., Esser, A., Etinski, S., Kirshanova, E.: Asymptotics and improvements of sieving for codes. In: EUROCRYPT (6). Lecture Notes in Computer Science, vol. 14656, pp. 151\u2013180. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-58754-2_6","DOI":"10.1007\/978-3-031-58754-2_6"},{"key":"10_CR26","unstructured":"Esser, A., Ramos-Calderer, S., Bellini, E., Latorre, J.I., Manzano, M.: An optimized quantum implementation of ISD on scalable quantum resources. IACR Cryptol. ePrint Arch. p.\u00a01608 (2021), https:\/\/eprint.iacr.org\/2021\/1608"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Esser, A., Ramos-Calderer, S., Bellini, E., Latorre, J.I., Manzano, M.: Hybrid decoding - classical-quantum trade-offs for information set decoding. In: PQCrypto. Lecture Notes in Computer Science, vol. 13512, pp. 3\u201323. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_1","DOI":"10.1007\/978-3-031-17234-2_1"},{"key":"10_CR28","unstructured":"Faug\u00e8re, J., Horan, K., Kahrobaei, D., Kaplan, M., Kashefi, E., Perret, L.: Fast quantum algorithm for solving multivariate quadratic equations. CoRR abs\/1712.07211 (2017), http:\/\/arxiv.org\/abs\/1712.07211"},{"key":"10_CR29","unstructured":"Gidney, C.: Asymptotically efficient quantum karatsuba multiplication. arXiv preprint arXiv:1904.07356 (2019)"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Gidney, C., Eker\u00e5, M.: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, \u00a0433 (2021). https:\/\/doi.org\/10.22331\/Q-2021-04-15-433, https:\/\/doi.org\/10.22331\/q-2021-04-15-433","DOI":"10.22331\/Q-2021-04-15-433"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC. pp. 212\u2013219. ACM (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"10_CR32","unstructured":"Guo, Q., Johansson, T., Nguyen, V.: A new sieving-style information-set decoding algorithm. IACR Cryptol. ePrint Arch. p.\u00a0247 (2023), https:\/\/eprint.iacr.org\/2023\/247"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing grover oracles for quantum key search on AES and LowMC. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol. 12106, pp. 280\u2013310. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_10","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Kachigar, G., Tillich, J.: Quantum information set decoding algorithms. In: PQCrypto. Lecture Notes in Computer Science, vol. 10346, pp. 69\u201389. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_5","DOI":"10.1007\/978-3-319-59879-6_5"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Kimura, N., Takayasu, A., Takagi, T.: Memory-efficient quantum information set decoding algorithm. In: ACISP. Lecture Notes in Computer Science, vol. 13915, pp. 452\u2013468. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-35486-1_20","DOI":"10.1007\/978-3-031-35486-1_20"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Kirshanova, E.: Improved quantum information set decoding. In: PQCrypto. Lecture Notes in Computer Science, vol. 10786, pp. 507\u2013527. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_24","DOI":"10.1007\/978-3-319-79063-3_24"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: EUROCRYPT. Lecture Notes in Computer Science, vol.\u00a0330, pp. 275\u2013280. Springer (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_25","DOI":"10.1007\/3-540-45961-8_25"},{"issue":"1","key":"10_CR38","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122\u2013127 (1969). https:\/\/doi.org\/10.1109\/TIT.1969.1054260","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR39","doi-asserted-by":"publisher","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$\\cal O\\it (2^{0.054n})$$. In: ASIACRYPT. Lecture Notes in Computer Science, vol.\u00a07073, pp. 107\u2013124. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_6","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: EUROCRYPT (1). Lecture Notes in Computer Science, vol.\u00a09056, pp. 203\u2013228. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.: Quantum computation and quantum information (2002)","DOI":"10.1119\/1.1463744"},{"key":"10_CR42","unstructured":"NIST: 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":"10_CR43","unstructured":"NIST: Post-quantum cryptography: Digital signature schemes - round 1 additional signatures (2023), https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"10_CR44","unstructured":"NIST: Round 4 standardisation results for the post-quantum cryptography standardization process (2024), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"10_CR45","unstructured":"Perriello, S.: Design and development of a quantum circuit to solve the information set decoding problem (2017)"},{"issue":"4","key":"10_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3607256","volume":"4","author":"S Perriello","year":"2023","unstructured":"Perriello, S., Barenghi, A., Pelosi, G.: Improving the efficiency of quantum circuits for information set decoding. ACM Transactions on Quantum Computing 4(4), 1\u201340 (2023)","journal-title":"ACM Transactions on Quantum Computing"},{"issue":"5","key":"10_CR47","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), \u00a05\u20139 (1962). https:\/\/doi.org\/10.1109\/TIT.1962.1057777","journal-title":"IRE Trans. Inf. Theory"},{"key":"10_CR48","doi-asserted-by":"publisher","unstructured":"Qiskit contributors: Qiskit: An open-source framework for quantum computing (2023). https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"10_CR49","doi-asserted-by":"publisher","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.E.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: ASIACRYPT (2). Lecture Notes in Computer Science, vol. 10625, pp. 241\u2013270. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9","DOI":"10.1007\/978-3-319-70697-9_9"},{"key":"10_CR50","doi-asserted-by":"publisher","unstructured":"Sendrier, N.: Decoding one out of many. In: PQCrypto. Lecture Notes in Computer Science, vol.\u00a07071, pp. 51\u201367. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_4","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"10_CR51","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: FOCS. pp. 124\u2013134. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"10_CR52","doi-asserted-by":"publisher","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Coding Theory and Applications. Lecture Notes in Computer Science, vol.\u00a0388, pp. 106\u2013113. Springer (1988). https:\/\/doi.org\/10.1007\/BFB0019850","DOI":"10.1007\/BFB0019850"},{"issue":"1","key":"10_CR53","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"DH Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32(1), 54\u201362 (1986). https:\/\/doi.org\/10.1109\/TIT.1986.1057137","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0944-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T06:12:07Z","timestamp":1733897527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0944-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609437","9789819609444"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0944-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}