Songshou Dong, Yihua Zhou, Yuguang Yang, Yanqing Yao
{"title":"基于格的无证书环签名方案","authors":"Songshou Dong, Yihua Zhou, Yuguang Yang, Yanqing Yao","doi":"10.1002/cpe.7385","DOIUrl":null,"url":null,"abstract":"For the problems that ring signature needs key escrow, has some security risks, and cannot avoid malicious key generation center (KGC) in the post‐quantum era, we design a certificateless ring signature scheme based on lattice (L‐CRSS). In our scheme, the bimodal Gaussian distribution is used to improve the security and efficiency. Compared with the previous ring signature scheme based on lattice, our design does not need key escrow, does not disclose the signer's identity, can avoid malicious KGC, achieves the constant signature size, and has higher security and efficiency in the post‐quantum era. Finally, under random oracle model (ROM), we prove that our scheme is anonymous against the full‐key exposure, and existentially unforgeable against adaptive chosen message attacks (EUF‐CMA).","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"85 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A certificateless ring signature scheme based on lattice\",\"authors\":\"Songshou Dong, Yihua Zhou, Yuguang Yang, Yanqing Yao\",\"doi\":\"10.1002/cpe.7385\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the problems that ring signature needs key escrow, has some security risks, and cannot avoid malicious key generation center (KGC) in the post‐quantum era, we design a certificateless ring signature scheme based on lattice (L‐CRSS). In our scheme, the bimodal Gaussian distribution is used to improve the security and efficiency. Compared with the previous ring signature scheme based on lattice, our design does not need key escrow, does not disclose the signer's identity, can avoid malicious KGC, achieves the constant signature size, and has higher security and efficiency in the post‐quantum era. Finally, under random oracle model (ROM), we prove that our scheme is anonymous against the full‐key exposure, and existentially unforgeable against adaptive chosen message attacks (EUF‐CMA).\",\"PeriodicalId\":10584,\"journal\":{\"name\":\"Concurrency and Computation: Practice and Experience\",\"volume\":\"85 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation: Practice and Experience\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/cpe.7385\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cpe.7385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A certificateless ring signature scheme based on lattice
For the problems that ring signature needs key escrow, has some security risks, and cannot avoid malicious key generation center (KGC) in the post‐quantum era, we design a certificateless ring signature scheme based on lattice (L‐CRSS). In our scheme, the bimodal Gaussian distribution is used to improve the security and efficiency. Compared with the previous ring signature scheme based on lattice, our design does not need key escrow, does not disclose the signer's identity, can avoid malicious KGC, achieves the constant signature size, and has higher security and efficiency in the post‐quantum era. Finally, under random oracle model (ROM), we prove that our scheme is anonymous against the full‐key exposure, and existentially unforgeable against adaptive chosen message attacks (EUF‐CMA).