{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:27:23Z","timestamp":1761294443320,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030983642"},{"type":"electronic","value":"9783030983659"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98365-9_1","type":"book-chapter","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T07:03:04Z","timestamp":1647068584000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Rank Metric Code-Based Group Signature Scheme"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Blazy","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[]},{"given":"Dang Truong","family":"Mac","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"key":"1_CR1","unstructured":"Aguila, C., et al.: Rank quasi cyclic (RQC) first round submission to the NIST post-quantum cryptography call, November 2017"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar","year":"2018","unstructured":"Aguilar, C., Blazy, O., Deneuville, J.-C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theory 64, 3927\u20133943 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR3","unstructured":"Alam\u00e9lou, Q., Blazy, O., Cauchie, S., and Gaborit, P.: A code-based group signature scheme. Presented at WCC, April 2015"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-55227-9_18","volume-title":"Arithmetic of Finite Fields","author":"Q Alam\u00e9lou","year":"2016","unstructured":"Alam\u00e9lou, Q., Blazy, O., Cauchie, S., Gaborit, P.: A practical group signature scheme based on rank metric. In: Duquesne, S., Petkova-Nikova, S. (eds.) WAIFI 2016. LNCS, vol. 10064, pp. 258\u2013275. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-55227-9_18"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.-P.: A new algorithm for solving the rank syndrome decoding problem. In: EEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, 17\u201322 June 2018, pp. 2421\u20132425 (2018)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","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: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614\u2013629. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_38"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Bettaieb, S., Bidoux, L., Blazy, O., Connan, Y., Gaborit, P.: A gapless code-based hash proof system based on RQC and its applications. Cryptology Eprint https:\/\/eprint.iacr.org\/2021\/026","DOI":"10.1007\/s10623-022-01075-7"},{"key":"1_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-48797-6_12","volume-title":"ASIACRYPT 2015","author":"MF Ezerman","year":"2015","unstructured":"Ezerman, M.F., Lee, H.T., Ling, S., Nguyen, K., Wang, H.: A provably secure group signature scheme from code-based assumptions. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 260\u2013285. Springer, Heidelberg (2015)"},{"key":"1_CR10","unstructured":"Bardet, M., et al.: Algebraic attacks for solving the rank decoding and Minrank problems without Gr\u00f6bner basis (2020). https:\/\/arxiv.org\/pdf\/2002.08322.pdf"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-03326-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"T Debris-Alazard","year":"2018","unstructured":"Debris-Alazard, T., Tillich, J.-P.: Two attacks on rank metric code-based schemes: RankSign and an identity-based-encryption scheme. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 62\u201392. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_3"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_6"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-25405-5_3","volume-title":"Post-Quantum Cryptography","author":"P Gaborit","year":"2011","unstructured":"Gaborit, P., Schrek, J., Z\u00e9mor, G.: Full cryptanalysis of the Chen identification protocol. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 35\u201350. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_3"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-54631-0_20","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Ling, S., Nguyen, K., Wang, H.: Lattice-based group signature scheme with verifier-local revocation. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 345\u2013361. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_20"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-46447-2_18","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"PQ Nguyen","year":"2015","unstructured":"Nguyen, P.Q., Zhang, J., Zhang, Z.: Simpler efficient group signatures from lattices. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 401\u2013426. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_18"},{"issue":"1\u20133","key":"1_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10623-008-9175-9","volume":"49","author":"R Nojima","year":"2008","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. Des. Codes Cryptogr. 49(1\u20133), 289\u2013305 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR17","unstructured":"Pointcheval, D., Vaudenay, S.: On provable security for digital signature algorithms. Technical report LIENS-96-17, Laboratoire d\u2019Informatique de Ecole Normale Superieure (1997)"},{"issue":"6","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.556672","volume":"42","author":"J Stern","year":"1996","unstructured":"Stern, J.: A new paradigm for public key identification. IEEE Trans. Inf. Theory 42(6), 1757\u20131768 (1996)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98365-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T22:21:47Z","timestamp":1674944507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98365-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030983642","9783030983659"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98365-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cbcrypto.dii.univpm.it\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","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":"6","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":"43% - 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":"1","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)"}},{"value":"The workshop was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}