{"title":"阈值群签名方案的改进","authors":"Tong Lu, Baoyuan Kang","doi":"10.1109/ISCCS.2011.48","DOIUrl":null,"url":null,"abstract":"A (t,n) threshold group signature scheme allows a singer to determine a (t,n) threshold strategy and only t or more signers of the group can sign messages on behalf of the group. Recently, Li et al. proposed a new threshold group signature scheme based on discrete logarithm problem, which is not only threshold-signing but also threshold-verifying. Unfortunately, their scheme are not secure, in their scheme the appointed group signer himself can generate a valid signature, which voilates unforgeability and threshold characteristics. Then we propose an improvement to overcome this security flaw.","PeriodicalId":326328,"journal":{"name":"2011 International Symposium on Computer Science and Society","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improvement of Threshold Group Signature Scheme\",\"authors\":\"Tong Lu, Baoyuan Kang\",\"doi\":\"10.1109/ISCCS.2011.48\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A (t,n) threshold group signature scheme allows a singer to determine a (t,n) threshold strategy and only t or more signers of the group can sign messages on behalf of the group. Recently, Li et al. proposed a new threshold group signature scheme based on discrete logarithm problem, which is not only threshold-signing but also threshold-verifying. Unfortunately, their scheme are not secure, in their scheme the appointed group signer himself can generate a valid signature, which voilates unforgeability and threshold characteristics. Then we propose an improvement to overcome this security flaw.\",\"PeriodicalId\":326328,\"journal\":{\"name\":\"2011 International Symposium on Computer Science and Society\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Symposium on Computer Science and Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCCS.2011.48\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Symposium on Computer Science and Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCCS.2011.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A (t,n) threshold group signature scheme allows a singer to determine a (t,n) threshold strategy and only t or more signers of the group can sign messages on behalf of the group. Recently, Li et al. proposed a new threshold group signature scheme based on discrete logarithm problem, which is not only threshold-signing but also threshold-verifying. Unfortunately, their scheme are not secure, in their scheme the appointed group signer himself can generate a valid signature, which voilates unforgeability and threshold characteristics. Then we propose an improvement to overcome this security flaw.