{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:43:33Z","timestamp":1743151413273,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031180668"},{"type":"electronic","value":"9783031180675"}],"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-031-18067-5_3","type":"book-chapter","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T07:07:51Z","timestamp":1664348871000},"page":"32-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Digital Signature Scheme to\u00a0Match Generalized Reed-Solomon Code over\u00a0GF(q)"],"prefix":"10.1007","author":[{"given":"Yong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4338-8394","authenticated-orcid":false,"given":"Hao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruyi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"3_CR1","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic. Coding Thv 4244, 114\u2013116 (1978)","journal-title":"Coding Thv"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10"},{"issue":"10","key":"3_CR3","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"JC Faugere","year":"2013","unstructured":"Faugere, J.C., Gauthier-Umana, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high-rate mceliece cryptosystems. IEEE Trans. Inf. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"TP Berger","year":"2005","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Des. Codes Crypt. 35(1), 63\u201379 (2005)","journal-title":"Des. Codes Crypt."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"TP Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 77\u201397. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_6"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"R Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 376\u2013392. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_24"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-014-9187-8","volume":"29","author":"M Baldi","year":"2016","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced public key security for the McEliece cryptosystem. J. Cryptol. 29(1), 1\u201327 (2016)","journal-title":"J. Cryptol."},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1049\/iet-ifs.2018.5207","volume":"13","author":"M Baldi","year":"2019","unstructured":"Baldi, M., Chiaraluce, F., Rosenthal, J., Santini, P., Schipani, D.: Security of generalised Reed-Solomon code-based cryptosystems. IET Inf. Secur. 13(4), 404\u2013410 (2019)","journal-title":"IET Inf. Secur."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-19574-7_11","volume-title":"Selected Areas in Cryptography","author":"M Finiasz","year":"2011","unstructured":"Finiasz, M.: Parallel-CFS. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 159\u2013170. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_11"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"177506","DOI":"10.1109\/ACCESS.2020.3026989","volume":"8","author":"Y Lee","year":"2020","unstructured":"Lee, Y., Lee, W., Kim, Y.S., No, J.S.: Modified pqsigRM: RM code-based signature scheme. IEEE Access 8, 177506\u2013177518 (2020)","journal-title":"IEEE Access"},{"key":"3_CR11","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/978-3-030-25128-4_118","volume-title":"International Conference on Applications and Techniques in Cyber Intelligence ATCI 2019","author":"Y Zhou","year":"2020","unstructured":"Zhou, Y., Zeng, P., Chen, S.: An improved code-based encryption scheme with a new construction of public key. In: Abawajy, J.H., Choo, K.-K.R., Islam, R., Xu, Z., Atiquzzaman, M. (eds.) ATCI 2019. AISC, vol. 1017, pp. 959\u2013968. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-25128-4_118"},{"issue":"04","key":"3_CR12","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1142\/S0129054119400173","volume":"30","author":"X Liu","year":"2019","unstructured":"Liu, X., Yang, X., Han, Y., Wang, X.A.: A secure and efficient code-based signature scheme. Int. J. Found. Comput. Sci. 30(04), 635\u2013645 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Pellikaan, R., M\u00e1rquez-Corbella, I.: Error-correcting pairs for a public-key cryptosystem. In: Journal of Physics: Conference Series, vol. 855, p. 012032. IOP Publishing (2017)","DOI":"10.1088\/1742-6596\/855\/1\/012032"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-88353-1_6","volume-title":"Research in Cryptology","author":"L Dallot","year":"2008","unstructured":"Dallot, L.: Towards a concrete security proof of courtois, finiasz and sendrier signature scheme. In: Lucks, S., Sadeghi, A.-R., Wolf, C. (eds.) WEWoRC 2007. LNCS, vol. 4945, pp. 65\u201377. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88353-1_6"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Chen, S., Zeng, P., Choo, K.K.R.: A provably secure blind signature based on coding theory. In: 2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS), pp. 376\u2013382. IEEE (2016)","DOI":"10.1109\/ICPADS.2016.0058"},{"key":"3_CR16","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive 2004\/332 (2004)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-59879-6_5","volume-title":"Post-Quantum Cryptography","author":"G Kachigar","year":"2017","unstructured":"Kachigar, G., Tillich, J.-P.: Quantum information set decoding algorithms. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 69\u201389. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_5"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-29360-8_10","volume-title":"Post-Quantum Cryptography","author":"R Canto Torres","year":"2016","unstructured":"Canto Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over F$$_{q}$$. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 81\u201394. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_7"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Gaborit, P., Gauthier-Uma\u00f1a, V., Otmani, A., Tillich, J.P.: Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. Des. Codes Crypt. 73(2), 641\u2013666 (2014)","journal-title":"Des. Codes Crypt."},{"key":"3_CR21","unstructured":"Gauthier, V., Otmani, A., Tillich, J.P.: A distinguisher-based attack on a variant of McEliece\u2019s cryptosystem based on Reed-Solomon codes. arXiv preprint arXiv:1204.6459 (2012)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-46447-2_8","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"A Couvreur","year":"2015","unstructured":"Couvreur, A., Otmani, A., Tillich, J.-P., Gauthier\u2013Uma\u00f1a, V.: A polynomial-time attack on the BBCRS scheme. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 175\u2013193. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_8"},{"key":"3_CR23","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced public key security for the McEliece cryptosystem. submitted. arXiv preprint arxiv:1108.2462 (2011)"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"17854","DOI":"10.1109\/ACCESS.2020.2967789","volume":"8","author":"Y Ren","year":"2020","unstructured":"Ren, Y., Zhao, Q., Guan, H., Lin, Z.: On design of single-layer and multilayer code-based linkable ring signatures. IEEE Access 8, 17854\u201317862 (2020)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Cyberspace Safety and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18067-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T23:10:44Z","timestamp":1664493044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18067-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031180668","9783031180675"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18067-5_3","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":"29 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyberspace Safety and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"css2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/css2021.compute.dtu.dk\/index.html","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":"35","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":"9","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":"5","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":"4","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)"}}]}}