期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

标准模型下高效的强不可伪造短签名方案 被引量：5

Efficient and strongly unforgeable short signature scheme in standard model
下载PDF
导出
摘要 针对现有在标准模型下强不可伪造签名方案效率不高的问题,提出了1个新的高效签名方案.利用椭圆曲线上的双线性对,基于计算性Diffie-Hellman数学困难问题假设,证明新方案具有强存在性不可伪造.在新方案中,用户的公/私钥分别包含6个和1个乘法循环群G中的元素,签名中含有2个群G中的元素,在签名阶段需要3个指数运算,在验证阶段需要2个双线性对运算和1个指数运算.结果表明,与现有的标准模型下强不可伪造签名方案相比,新方案具有更短的公/私钥长度和签名长度,降低了签名和验证阶段的计算耗时,具有高效性,适用于资源受限的环境. To solve the low efficiency of existing strongly unforgeable signature schemes in standard model,a new efficient signature scheme was proposed.Based on the computational Diffie-Hellman（CDH） hard problem assumption of bilinear pairing on elliptic curves,the proposed scheme was proved to be strongly unforgeable.For the proposed scheme,the public key contains six group elements with a single group element of secret key,and the signature includes two group elements.There are three exponential computations in the signing algorithm with one exponential and two pairing computations in the verification stage.The results show that compared with the existing strongly unforgeable signature schemes in standard model,the new scheme has a shorter length of public/secret key and signature with decreased computation time of signing and verification algorithms.The proposed scheme is suitable for the constrai-ned resource communication environments with high efficiency.
作者 刘振华 胡予濮 张襄松
机构地区 西安电子科技大学数学系 中国科学院信息工程研究所信息安全国家重点实验室 西安电子科技大学通信工程学院 西安工业大学理学院
出处 《江苏大学学报（自然科学版）》 EI CAS CSCD 北大核心 2013年第3期309-313,共5页 Journal of Jiangsu University：Natural Science Edition
基金 国家自然科学基金资助项目(61100229 61173151 11101321) 信息安全国家重点实验室开放基金资助项目(GW0704127001) 网络与数据安全四川省重点实验室开放基金资助项目(DF0305107001) 中央高校基本科研业务费资助项目(K5051270003) 陕西省教育厅科研计划项目(12JK0852)
关键词 数字签名 哈希函数 强不可伪造 标准模型 双线性对 digital signature hash function strong unforgeability standard model bilinear pairing
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献19

  • 1Goldwasser S, Micali S, Rivest R L. A digital signaturescheme secure against adaptive chosen-messages attacks[J]. SIAM Journal on Computing, 1988,17(2) : 281-308.
  • 2Waters B. Efficient identity-based encryption withoutrandom oracles [C] // Proceedings of the Advances inCryptology-EUROCRYPT 2005. Berlin : Springer-Ver-lag, 2005: 114-127.
  • 3An J H, Dodis Y,Rabin T. On the security of joint sig-nature and encryption [ C] // Proceedings of the Advancesin Cryptology-EUROCRYPT 2002. Berlin : Springer-Ver-lag, 2002: 83 -107.
  • 4Selvi S S D,Vivek S S, Vinayagamurthy D, et al. IDbased signcryption scheme in standard model [ C] //Proceedings of the 6th International Conference on Pro-vable Security-ProvSec 2012. Berlin: Springer-Verlag,2012: 35 -52.
  • 5Park H, Lim S,Yie I,et al. Strong unforgeability ingroup signature schemes [ J]. Computer Standards & In-terfaces ,2009, 31(4) : 856 -862.
  • 6Zhang Jianhong, Liu Xue. An efficient strong ID-basedsignature scheme with unforgeability [ C] // Proceedingsof the 2010 Fifth International Conference on Frontier ofComputer Science and Technology. Piscataway : IEEEComputer Society, 2010 : 239 -245.
  • 7Vivek S S,Selvi S S D, Balasubramanian G, et al.Strongly unforgeable proxy re-signature schemes in thestandard model [ EB/OL]. [ 2012 - 07 - 01]. http : //eprint. iacr. org/2012/080. pdf, 2012.
  • 8Bellare M,Rogaway P. The exact security of digital sig-natures :how to sign with RSA and Rabin [C] //Pro-ceedings of the Advances in Cryptology-EUROCRYPT1996. Berlin: Springer-Verlag, 1996 : 399 -416.
  • 9Boneh D,Lynn B, Shacham H. Short signatures fromthe weil pairing [J]. Journal of Cryptology, 2004,17(4): 297 -319.
  • 10Cramer R, Shoup V. Signature schemes based on thestrong RSA assumption [J], ACM Transactions on Infor-mation and System Security, 2000, 3(3) : 161 - 185.

二级参考文献44

  • 1Shamir A. Identity-based cryptosystems and signature schemes[ C]//Proceedings of the Advances in Cryptolo- gy-CRYPTO'1984. Heidelberg: Springer-Verlag, 1985: 47 - 53.
  • 2Yu Y, Yang B, Huang X Y, et al. Efficient identity- based signcryption scheme for multiple reeeiver[ C ]// Proceedings of Autonomic and Trusted Computing4th In- ternational Conference. Heidelberg : Springer-Verlag, 2007 : 13 - 21.
  • 3Lal S, Kushwah P. Anonymous ID based signcryption scheme for multiple receivers [ EB/OL]. [ 2010 - 08 - 291. http://eprint, iacr. org/2009/345.pdf, 2009.
  • 4Selvi S S D, Vivek S S, Gopalkrishnan R, et al. On the provable security of muhi-receiver signcryption schemes [ EB/OL]. [ 2010 - 08 - 29 ]. http://eprint, iacr. org/ 2008/238. pdf.
  • 5Selvi S S D, Vivek S S, Srinivasan R, et al. An effi- cient identity-based signcryption schemes for multiple re- ceivers[ EB/OL]. [ 2010 - 08 - 29]. http://eprint, ia- cr. org/2008/341, pdf.
  • 6Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited[ J ]. Journal of the ACM, 2004, 51 (4) :557 -594.
  • 7Boneh D, Boyen X. Efficient selective-ID secure identi- ty based encryption without random oracles [ C ]//Pro- ceedings of Cryptology EUROCRYPT 2004. Heidelberg : Springer-Verlag, 2004:223-238.
  • 8Waters B. Efficient identity-based encryption without random oracles[ C]//Proceedings of the 24th Annual In- ternational Conference on the Theory and Applications of Cryptographie Techniques. Heidelberg : Springer-Verlag, 2005 : 114 - 127.
  • 9Paterson K G, Schuldt J C N. Efficient identity-based signatures secure in the standard model [ C ] //Procee- dings of the Information Security and Privacy : 11 th Aus- tralasian Conference. Heidelberg : Springer-Verlag, 2006 : 207 - 222.
  • 10Boneh D, Boyen X. Short signatures without random oracles and the SDH assumption in bilinear groups [ J ]. Journal of Cryptology, 2008, 21 (2) : 149 - 177.

共引文献3

同被引文献42

  • 1Hao Shen-gang,Li Zhang, Ghulam Muhammad. A union authenti- cation protocol of cross-domain based on bilinear pairing[ J]. Jour- nal of Software,2013,8(5) :1094-1100.
  • 2Zhang L, Zhang J, Xia A, et al. Domain authentication protocol based on certificate signcryption in Ipv6 network [ C ]. Proceedings of the International Conference on Information Engineering and Ap- plications, Springer-Verlag, 2013 : 213 -220.
  • 3Hong Xuan, Long Yu. A novel unidirectional proxy re-signature scheme and its application for MANETs[ J]. Journal of Computers, 2012,7(7) :1796-1800.
  • 4Ateniese G, Hohenberger S. Proxy re-signatures: new definitions, al- gorithms, and applications [ C ]. Proceedings of Computer and Corn- munications Security, Alexandria, USA, 2005 : 310 -319.
  • 5Shao J, Cao Z, Wang L, et al. Proxy re-signature schemes without random oracles [C ]. Proceedings of Cryptology--INDOCRYPT 2007, Springer-Verlag ,2007 : 197-209.
  • 6Waters B. Efficient identity-based encryption without random ora- cles[ C ]. Proceedings of Advances in Cryptology--EUROCRYPT 2005, Springer-Verlag ,2005 : 114-127.
  • 7Kiate K,Ikkwon Y ,Secogan L. Remark on shao et al's bidirectional proxy re-signature scheme in indocrypt'07[J]. International Journal of Network Security,2009,8 ( 3 ) :308 -311.
  • 8Shao H,Zhang F,Yuan X Z,et al. A proxy signature based on the difficulty of solving equations of higher on quaternion ring[ J]. Ap-plied Mechanics and Materiais ,2014,51 (3) :1951-1954.
  • 9Wang Z, Lv W. Server-aided verification proxy re-signature [ C ]. Proceedings of IEEE Security and Privacy in Computing and Com- munications,2013 : 1704-1707.
  • 10Xiao H, Zhang M. Provably-secure certificateless proxy re-signature scheme[ C]. Proceedings of IEEE Intelligent Networking and Col- laborative Systems,2013:591-594.

引证文献5

二级引证文献10

江苏大学学报（自然科学版）
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部