{"title":"Blind Signature Scheme Based on QC-MDPC Codes","authors":"Fang Ren, Haiyan Xiu, Anqi Gao, Xuan Shi","doi":"10.1109/NaNA56854.2022.00086","DOIUrl":null,"url":null,"abstract":"In this paper, we construct a new blind signature scheme based on Quasi-cyclic Moderate Density Parity-Check (QC-MDPC) codes. This scheme is realized by using QC-MDPC codes and bit flipping decoding algorithm under Courtois-Finiasz-Sendrier (CFS) signature system. The security of our blind signature scheme relies on the difficulty of the syndrome decoding problem in coding theory, which has been shown to be NP-complete and secure against quantum attacks. This scheme greatly reduces the public key size as well as the signature length compared to other code-based blind signature schemes. To achieve security level 2^80, the public key size in our blind signature scheme is 4801bits and the signature length is 1029.05bits, which are better than almost other schemes.","PeriodicalId":113743,"journal":{"name":"2022 International Conference on Networking and Network Applications (NaNA)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA56854.2022.00086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we construct a new blind signature scheme based on Quasi-cyclic Moderate Density Parity-Check (QC-MDPC) codes. This scheme is realized by using QC-MDPC codes and bit flipping decoding algorithm under Courtois-Finiasz-Sendrier (CFS) signature system. The security of our blind signature scheme relies on the difficulty of the syndrome decoding problem in coding theory, which has been shown to be NP-complete and secure against quantum attacks. This scheme greatly reduces the public key size as well as the signature length compared to other code-based blind signature schemes. To achieve security level 2^80, the public key size in our blind signature scheme is 4801bits and the signature length is 1029.05bits, which are better than almost other schemes.