{"title":"一种新的基于码的秩度量盲签名","authors":"Yanhong Qi, Xindong Liu, Li-Ping Wang","doi":"10.1109/ICPADS53394.2021.00049","DOIUrl":null,"url":null,"abstract":"Blind signatures are widely used in Internet banking, e-voting and blockchains. In this paper, we propose the first code-based blind signature scheme under rank metric which is based on a variation of Durandal signature algorithm. We prove that our scheme can satisfy blindness and provide the security proof of our scheme in the random oracle model. Our scheme enjoys the advantages of short signature size. We give the instantiation of our scheme and the experimental results show that our scheme is feasible in practical applications.","PeriodicalId":309508,"journal":{"name":"2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Code-based Blind Signature in Rank Metric\",\"authors\":\"Yanhong Qi, Xindong Liu, Li-Ping Wang\",\"doi\":\"10.1109/ICPADS53394.2021.00049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Blind signatures are widely used in Internet banking, e-voting and blockchains. In this paper, we propose the first code-based blind signature scheme under rank metric which is based on a variation of Durandal signature algorithm. We prove that our scheme can satisfy blindness and provide the security proof of our scheme in the random oracle model. Our scheme enjoys the advantages of short signature size. We give the instantiation of our scheme and the experimental results show that our scheme is feasible in practical applications.\",\"PeriodicalId\":309508,\"journal\":{\"name\":\"2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)\",\"volume\":\"138 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS53394.2021.00049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS53394.2021.00049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Blind signatures are widely used in Internet banking, e-voting and blockchains. In this paper, we propose the first code-based blind signature scheme under rank metric which is based on a variation of Durandal signature algorithm. We prove that our scheme can satisfy blindness and provide the security proof of our scheme in the random oracle model. Our scheme enjoys the advantages of short signature size. We give the instantiation of our scheme and the experimental results show that our scheme is feasible in practical applications.