摘要
基于Boneh,Lynn和Shacham提出的短签名方案(简称BLS签名方案),并利用有向无环图的拓扑排序,构造一种新的结构化多重签名方案,签名的长度和验证的复杂性等同于单个签名者的签名,方案的构造简单且执行效率较高,经分析,能抵抗常见的各种攻击。
Based on the short signature scheme proposed by Boneh,Lynn and Shacham(BLS for short)and topological sorting of directed acyclic graph,a new structured multisignature scheme was proposed.The size and complexity of the multisignature is the same as the signature by single signer.Moreover,the construction of the scheme is simple and the scheme can be implemented efficiently.We proved that it's secure against all kinds of attacks.
出处
《贵州大学学报(自然科学版)》
2011年第2期67-69,共3页
Journal of Guizhou University:Natural Sciences
基金
贵州省自然科学基金项目(2009-2113)
贵州大学博士基金项目(2007-040)
关键词
GDH群
结构化多重签名
签名结构
拓扑排序
GDH group
structured multisignature
signing structure
topological sorting