阈值群签名方案的改进

Tong Lu, Baoyuan Kang
{"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}
引用次数: 1

摘要

(t,n)门限组签名方案允许签名者确定(t,n)门限策略,并且该组中只有t个或多个签名者可以代表该组签名消息。最近,Li等人提出了一种新的基于离散对数问题的阈值群签名方案,该方案不仅具有阈值签名功能,而且具有阈值验证功能。不幸的是,他们的方案是不安全的,在他们的方案中,指定的组签名者自己可以生成有效的签名,这违反了不可伪造性和阈值特性。然后我们提出了一种改进方案来克服这一安全漏洞。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improvement of Threshold Group Signature Scheme
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信