{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T09:34:50Z","timestamp":1775900090302,"version":"3.50.1"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385445","type":"print"},{"value":"9783031385452","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38545-2_12","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"351-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Lattice Signature with\u00a0Efficient Protocols, Application to\u00a0Anonymous Credentials"],"prefix":"10.1007","author":[{"given":"Corentin","family":"Jeudy","sequence":"first","affiliation":[]},{"given":"Adeline","family":"Roux-Langlois","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC) (1996)","DOI":"10.1145\/237814.237838"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625\u2013635 (1993)","DOI":"10.1007\/BF01445125"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-30574-3_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M Bellare","year":"2005","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: the case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136\u2013153. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_11"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bert, P., Eberhart, G., Prabel, L., Roux-Langlois, A., Sabt, M.: Implementation of lattice trapdoors on modules and applications. In: International Conference on Post-Quantum Cryptography (PQCrypto) (2021)","DOI":"10.1007\/978-3-030-81293-5_11"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: Short, efficient, and round-optimal. IACR Cryptol. ePrint Arch. p. 77 (2023)","DOI":"10.1145\/3576915.3616613"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2007). https:\/\/doi.org\/10.1007\/s00145-007-9005-7","journal-title":"J. Cryptol."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-12612-4_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Eskandarian, S., Fisch, B.: Post-quantum EPID signatures from symmetric primitives. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 251\u2013271. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_13"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-030-26948-7_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Bootle","year":"2019","unstructured":"Bootle, J., Lyubashevsky, V., Seiler, G.: Algebraic techniques for Short(er) exact lattice-based zero-knowledge proofs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 176\u2013202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_7"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: On the hardness of module learning with errors with short distributions. J. Cryptol. 36(1), 1 (2023)","DOI":"10.1007\/s00145-022-09441-3"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Bourse, F., Pointcheval, D., Sanders, O.: Divisible E-cash from constrained pseudo-random functions. In: 25th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) (2019)","DOI":"10.1007\/978-3-030-34578-5_24"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-13013-7_29","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"X Boyen","year":"2010","unstructured":"Boyen, X.: Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_29"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. In: Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society (WPES) (2007)","DOI":"10.1145\/1314333.1314337"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proceedings of ACM Conference on Computer and Communications Security (CCS) (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"J Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93\u2013118. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_7"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J Camenisch","year":"2003","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268\u2013289. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_20"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_4"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-39805-8_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 85","author":"D Chaum","year":"1986","unstructured":"Chaum, D.: Showing credentials without identification. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 241\u2013244. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39805-8_28"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Chen, L., El Kassem, N., Lehmann, A., Lyubashevsky, V.: A framework for efficient lattice-based DAA. In: Proceedings of the 1st ACM Workshop on Workshop on Cyber-Security Arms Race (CYSARM@CCS) (2019)","DOI":"10.1145\/3338511.3357349"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"del Pino, R., Katsumata, S.: A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling. In: Dodis, Y., Shrimpton, T. (eds) Advances in Cryptology - CRYPTO 2022. CRYPTO 2022. Lecture Notes in Computer Science, vol 13508. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_11","DOI":"10.1007\/978-3-031-15979-4_11"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"del Pino, R., Lyubashevsky, V.: and G. Seiler. Lattice-based group signatures and zero-knowledge proofs of automorphism stability. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS) (2018)","DOI":"10.1145\/3243734.3243852"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644\u2013654 (1976)","DOI":"10.1109\/TIT.1976.1055638"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","DOI":"10.1137\/060651380"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"L. Ducas and D. Micciancio. Improved short lattice signatures in the standard model. In: International Cryptology Conference (CRYPTO) (2014)","DOI":"10.1007\/978-3-662-44371-2_19"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Esgin, M.F., Nguyen, N.K., Seiler, G.: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings. In: 26th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) (2020)","DOI":"10.1007\/978-3-030-64834-3_9"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. J. Cryptol. 32(2), 498\u2013546 (2019)","DOI":"10.1007\/s00145-018-9281-4"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"12_CR28","unstructured":"Intel. A cost-effective foundation for end-to-end IoT security, white paper (2016). https:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/white-papers\/intel-epid-iot-security-white-paper.pdf"},{"key":"12_CR29","unstructured":"ISO\/IEC. ISO\/IEC 18370\u20132:2016 information technology - security techniques - blind digital signatures - part 2: Discrete logarithm based mechanisms (2013). https:\/\/www.iso.org\/standard\/62544.html"},{"key":"12_CR30","unstructured":"ISO\/IEC. ISO\/IEC 20008\u20132:2013 information technology - security techniques - anonymous digital signatures - part 2: Mechanisms using a group public key (2013). https:\/\/www.iso.org\/standard\/56916.html"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Lattice signature with efficient protocols, application to anonymous credentials. IACR Cryptol. ePrint Arch. p. 509 (2022)","DOI":"10.1007\/978-3-031-38545-2_12"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. DCC (2015)","DOI":"10.1007\/s10623-014-9938-4"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-53890-6_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 373\u2013403. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_13"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general. IACR Cryptol. ePrint Arch. p. 284 (2022). Version dated from March 07th 2022","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M., Seiler, G.: Shorter lattice-based group signatures via \u201calmost free\u201d encryption and other optimizations. In: International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) (2021)","DOI":"10.1007\/978-3-030-92068-5_8"},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-78381-9_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"V Lyubashevsky","year":"2018","unstructured":"Lyubashevsky, V., Seiler, G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 204\u2013224. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_8"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-40041-4_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with small parameters. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 21\u201339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_2"},{"key":"12_CR41","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","DOI":"10.1137\/S0097539705447360"},{"key":"12_CR42","doi-asserted-by":"publisher","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in $$l_{p}$$ norms. Comput. Complex. 17, 300\u2013351 (2008). https:\/\/doi.org\/10.1007\/s00037-008-0251-3","DOI":"10.1007\/s00037-008-0251-3"},{"key":"12_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-29485-8_7","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"D Pointcheval","year":"2016","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 111\u2013126. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC) (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"12_CR45","unstructured":"TCG (2015). https:\/\/trustedcomputinggroup.org\/authentication\/"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. In: Compressed Sensing (2012)","DOI":"10.1017\/CBO9780511794308.006"},{"key":"12_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-26948-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"R Yang","year":"2019","unstructured":"Yang, R., Au, M.H., Zhang, Z., Xu, Q., Yu, Z., Whyte, W.: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 147\u2013175. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_6"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38545-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:38Z","timestamp":1753567358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38545-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385445","9783031385452"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38545-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"124","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}