{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:31:14Z","timestamp":1761294674128,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031464942"},{"type":"electronic","value":"9783031464959"}],"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-46495-9_7","type":"book-chapter","created":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T06:02:56Z","timestamp":1698386576000},"page":"125-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generic Error SDP and\u00a0Generic Error CVE"],"prefix":"10.1007","author":[{"given":"Felice","family":"Manganiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Freeman","family":"Slaughter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,28]]},"reference":[{"key":"7_CR1","unstructured":"NIST\u2019s Post-Quantum Cryptography Standardization Project. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"7_CR2","unstructured":"Aguilar-Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. Cryptology ePrint Archive, Paper 2022\/1645 (2022). https:\/\/eprint.iacr.org\/2022\/1645"},{"key":"7_CR3","unstructured":"Albrecht, M., et al.: Classic McEliece: conservative code-based cryptography: cryptosystem specification (2022), https:\/\/classic.mceliece.org\/nist.html"},{"key":"7_CR4","unstructured":"Attema, T., Fehr, S., Kloo\u00df, M.: Fiat-Shamir transformation of multi-round interactive proofs. Cryptology ePrint Archive, Paper 2021\/1377 (2021). https:\/\/eprint.iacr.org\/2021\/1377"},{"key":"7_CR5","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. IACR Cryptology ePrint Archive 2003, 230 (2003)"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: A finite regime analysis of information set decoding algorithms. Algorithms 12(10) (2019). https:\/\/doi.org\/10.3390\/a12100209, https:\/\/www.mdpi.com\/1999-4893\/12\/10\/209","DOI":"10.3390\/a12100209"},{"key":"7_CR7","unstructured":"Baldi, M., et al.: A new path to code-based signatures via identification schemes with restricted errors. arXiv:abs\/2008.06403 (2020)"},{"issue":"3","key":"7_CR8","first-page":"23","volume":"30","author":"A Barg","year":"1994","unstructured":"Barg, A.: Some new NP-complete coding problems. Problemy Peredachi Informatsii 30(3), 23\u201328 (1994)","journal-title":"Problemy Peredachi Informatsii"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-00434-7_14","volume-title":"Cryptology and Network Security","author":"E Bellini","year":"2018","unstructured":"Bellini, E., Caullery, F., Hasikos, A., Manzano, M., Mateu, V.: Code-based signature schemes from identification protocols in the rank metric. In: Camenisch, J., Papadimitratos, P. (eds.) CANS 2018. LNCS, vol. 11124, pp. 277\u2013298. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00434-7_14"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theory 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7_1","volume-title":"Post-Quantum Cryptography","author":"D Bernstein","year":"2009","unstructured":"Bernstein, D.: Introduction to post-quantum cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_1"},{"key":"7_CR12","unstructured":"Beullens, W.: Sigma protocols for MQ, PKP and SIS, and fishy signature schemes. Cryptology ePrint Archive, Paper 2019\/490 (2019). https:\/\/eprint.iacr.org\/2019\/490"},{"key":"7_CR13","series-title":"LNCS","first-page":"10","volume-title":"C2SI 2023","author":"L Bidoux","year":"2023","unstructured":"Bidoux, L., Gaborit, P.: Compact post-quantum signatures from proofs of knowledge leveraging structure for the PKP, SD and RSD problems. In: El Hajji, S., Mesnager, S., Souidi, E.M. (eds.) C2SI 2023. LNCS, vol. 13874, pp. 10\u201342. Springer, Cham (2023)"},{"key":"7_CR14","unstructured":"Bricout, R., Chailloux, A., Debris-Alazard, T., Lequesne, M.: Ternary syndrome decoding with large weight. Cryptology ePrint Archive, Paper 2019\/304 (2019). https:\/\/eprint.iacr.org\/2019\/304"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-19574-7_12","volume-title":"Selected Areas in Cryptography","author":"P-L Cayrel","year":"2011","unstructured":"Cayrel, P.-L., V\u00e9ron, P., El Yousfi Alaoui, S.M.: A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 171\u2013186. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_12https:\/\/hal.inria.fr\/hal-00674249"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Shared permutation for syndrome decoding: New zero-knowledge protocol and code-based signature. Cryptology ePrint Archive, Paper 2021\/1576 (2021). https:\/\/doi.org\/10.1007\/s10623-022-01116-1, https:\/\/eprint.iacr.org\/2021\/1576","DOI":"10.1007\/s10623-022-01116-1"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Syndrome decoding in the head: shorter signatures from zero-knowledge proofs. Cryptology ePrint Archive, Paper 2022\/188 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_19, https:\/\/eprint.iacr.org\/2022\/188","DOI":"10.1007\/978-3-031-15979-4_19"},{"key":"7_CR18","unstructured":"Feneuil, T., Rivain, M.: Threshold linear secret sharing to the rescue of MPC-in-the-Head. Cryptology ePrint Archive, Paper 2022\/1407 (2022). https:\/\/eprint.iacr.org\/2022\/1407"},{"key":"7_CR19","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. CoRR abs\/1301.1026 (2013)"},{"issue":"12","key":"7_CR20","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Z\u00e9mor, G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inf. Theory 62(12), 7245\u20137252 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2616127","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 1. Cambridge University Press, Cambridge (2001). https:\/\/doi.org\/10.1017\/CBO9780511546891"},{"key":"7_CR22","unstructured":"Goldreich, O.: Zero-knowledge twenty years after its invention. Cryptology ePrint Archive, Paper 2002\/186 (2002). https:\/\/eprint.iacr.org\/2002\/186"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989). https:\/\/doi.org\/10.1137\/0218012","journal-title":"SIAM J. Comput."},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Gorla, E., Manganiello, F., Rosenthal, J.: Spread codes and spread decoding in network coding. In: 2008 IEEE International Symposium on Information Theory. IEEE (2008). https:\/\/doi.org\/10.1109\/isit.2008.4595113","DOI":"10.1109\/isit.2008.4595113"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"443","DOI":"10.3934\/amc.2012.6.443","volume":"6","author":"E Gorla","year":"2012","unstructured":"Gorla, E., Manganiello, F., Rosenthal, J.: An algebraic approach for decoding spread codes. Adv. Math. Commun. 6(4), 443\u2013466 (2012). https:\/\/doi.org\/10.3934\/amc.2012.6.443","journal-title":"Adv. Math. Commun."},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.disc.2004.07.030","volume":"302","author":"G K\u00e1rolyi","year":"2005","unstructured":"K\u00e1rolyi, G.: A compactness argument in the additive theory and the polynomial method. Discret. Math. 302, 124\u2013144 (2005)","journal-title":"Discret. Math."},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.jalgebra.2005.04.021","volume":"290","author":"G K\u00e1rolyi","year":"2005","unstructured":"K\u00e1rolyi, G.: An inverse theorem for the restricted set addition in Abelian groups. J. Algebra 290(2), 557\u2013593 (2005). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0021869305002656","journal-title":"J. Algebra"},{"issue":"6","key":"7_CR28","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1109\/18.641543","volume":"43","author":"HA Loeliger","year":"1997","unstructured":"Loeliger, H.A.: Averaging bounds for lattices and linear codes. IEEE Trans. Inf. Theory 43(6), 1767\u20131773 (1997). https:\/\/doi.org\/10.1109\/18.641543","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-1-4615-2694-0_25","volume-title":"Communications and Cryptography","author":"HA Loeliger","year":"1994","unstructured":"Loeliger, H.A.: On the basic averaging arguments for linear codes. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds.) Communications and Cryptography, pp. 251\u2013261. Springer, Boston (1994). https:\/\/doi.org\/10.1007\/978-1-4615-2694-0_25"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Ravagnani, A.: Whitney numbers of combinatorial geometries and higher-weight dowling lattices (2019). https:\/\/doi.org\/10.48550\/ARXIV.1909.10249","DOI":"10.48550\/ARXIV.1909.10249"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Ravagnani, A., Kschischang, F.: Adversarial network coding (2017). https:\/\/doi.org\/10.48550\/ARXIV.1706.05468","DOI":"10.48550\/ARXIV.1706.05468"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Roth, R.: Introduction to Coding Theory. Cambridge University Press (2006). https:\/\/doi.org\/10.1017\/CBO9780511808968","DOI":"10.1017\/CBO9780511808968"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Silva, D., Kschischang, F.: Security for wiretap networks via rank-metric codes. In: 2008 IEEE International Symposium on Information Theory, pp. 176\u2013180 (2008). https:\/\/doi.org\/10.1109\/ISIT.2008.4594971","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"A Urivskiy","year":"2002","unstructured":"Urivskiy, A., Johansson, T.: New technique for decoding codes in the rank metric and its cryptography applications. Probl. Inf. Trans. 38, 237\u2013246 (2002). https:\/\/doi.org\/10.1023\/A:1020369320078","journal-title":"Probl. Inf. Trans."},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Weger, V., Battaglioni, M., Santini, P., Horlemann-Trautmann, A.L., Persichetti, E.: On the hardness of the Lee syndrome decoding problem. Advances in Mathematics of Communications (2022). https:\/\/doi.org\/10.3934\/amc.2022029","DOI":"10.3934\/amc.2022029"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Weger, V., Gassner, N., Rosenthal, J.: A survey on code-based cryptography (2022). https:\/\/doi.org\/10.48550\/ARXIV.2201.07119","DOI":"10.48550\/ARXIV.2201.07119"}],"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-031-46495-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T06:03:49Z","timestamp":1698386629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46495-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031464942","9783031464959"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46495-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 October 2023","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":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.org\/","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":"23","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":"8","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":"35% - 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":"3.3","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)"}}]}}