全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2013 

高效的可证明安全的无证书聚合签名方案

DOI: 10.3969/j.issn.0372-2112.2013.01.014, PP. 72-76

Keywords: 无证书公钥密码体制,聚合签名,计算Diffie-Hellman难题,双线性对

Full-Text   Cite this paper   Add to My Lib

Abstract:

利用双线性对构造了一个高效的无证书聚合签名方案,在随机预言机模型下给出了方案的安全性证明,其安全性基于计算Diffie-Hellman难题.与已有的无证书聚合签名方案相比,本文方案更能提高签名验证与传输效率,因聚合签名的验证只需要计算4个双线性对,签名的长度是固定的,仅有320bits,是目前最短的无证书聚合签名.

References

[1]  A Shamir.Identity-based cryptosystems and signature schemes[A].Advances in Cryptology-CRYPTO 1984[C].Berlin:Springer,1984.47-53.
[2]  王竹,戴一奇,叶顶锋.普适安全的基于身份的签名机制[J].电子学报,2011,39(7):1613-1617.WANG Zhu,DAI Yi-qi,YE Ding-feng.Universally composable identity-based signature[J].Acta Electronica Sinica,2011,39(7):1613-1617.(in Chinese)
[3]  Du Hongzhen,Wen Qiaoyan.An efficient identity-based short signature scheme from bilinear pairings[A].Proceedings of CIS 2007[C].USA:IEEE,2007,725-729.
[4]  蔡永泉,张雪迪,姜 楠.一种新的基于身份的门限签名方案[J].电子学报,2009,37(4A):102-105.CAI Yong-quan,ZHANG Xue-di,JIANG Nan.A novel identity-based threshold signature [J].Acta Electronica Sinica,2009,37(4A):102-105.(in Chinese)
[5]  李进,张方国,王燕鸣.两个高效的基于分级身份的签名方案[J].电子学报,2007,35(1):150-152.LI Jin,ZHANG Fang-guo,WANG Yan-ming.Two efficient hierarchical identity-based signature schemes [J].Acta Electronica Sinica,2007,35(1):150-152.(in Chinese)
[6]  S S Al-Riyami,KG Paterson.Certificateless Public Key Cryptography[A].Advances in Cryptology-Asiacrypt 2003[C].Berlin:Springer,2003.452-474.
[7]  D Boneh,C Gentry,B Lynn,et al.Aggregate and verifiably encrypted signatures from bilinear maps[A].Proceedings of Cryptology-Eurocrypt 2003[C].Berlin:Springer,2003.416-432.
[8]  Z Gong,Y Long,et al.Two certificateless aggregate signatures from bilinear maps[A].Proceedings of IEEE SNPD 2007[C].USA:IEEE,2007.188-193.
[9]  L Zhang,F T Zhang,A new certificateless aggregate signature scheme[J].Computer Communications,2009,32(6):1079-1085.
[10]  L Zhang,Q Bo,et al. Efficient many-to-one authentication with certificateless aggregate signatures[J].Computer Networks,2010,54(14):2482-2491.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133