强不可伪造的基于身份服务器辅助验证签名方案

doi:10.11959/j.issn.1000-436x.2016115

通信学报 ›› 2016, Vol. 37 ›› Issue (6): 49-55.doi: 10.11959/j.issn.1000-436x.2016115

强不可伪造的基于身份服务器辅助验证签名方案

杨小东,杨苗苗,高国娟,李亚楠,鲁小勇,王彩芬

西北师范大学计算机科学与工程学院，甘肃兰州 730070

出版日期:2016-06-25 发布日期:2017-08-04
基金资助:
国家自然科学基金资助项目;甘肃省科技计划基金资助项目;国家档案局科技基金资助项目;甘肃省高等学校科研基金资助项目;兰州市科技计划基金资助项目;西北师范大学青年教师科研能力提升计划基金资助项目;西北师范大学青年教师科研能力提升计划基金资助项目

ID-based server-aided verification signature scheme with strong unforgeability

Xiao-dong YANG,Miao-miao YANG,Guo-juan GAO,Ya-nan LI,Xiao-yong LU,Cai-fen WANG

College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China

Online:2016-06-25 Published:2017-08-04
Supported by:
The National Natural Science Foundation of China;The Natural Science Foundation of Gansu Province;The Science and Technology Project of State Archives Administration of China;Research Fund of Higher Education of Gansu Province;Science and Technology Project of Lanzhou City of China;The Foundation for Excellent Young Teachers by Northwest Normal University;The Foundation for Excellent Young Teachers by Northwest Normal University

摘要/Abstract

摘要：

标准模型下的基于身份签名方案大多数是存在性不可伪造的，无法阻止攻击者对已经签名过的消息重新伪造一个合法的签名，并且验证签名需要执行耗时的双线性对运算。为了克服已有基于身份签名方案的安全性依赖强和计算代价大等缺陷，提出了一个强不可伪造的基于身份服务器辅助验证签名方案，并在标准模型下证明了新方案在合谋攻击、自适应选择身份和消息攻击下是安全的。分析结果表明，新方案有效减少了双线性对的计算量，大大降低了签名验证算法的计算复杂度，在效率上优于已有的基于身份签名方案。

关键词: 基于身份服务器辅助验证签名, 强不可伪造性, 合谋攻击, 标准模型

Abstract:

Most identity-based signature schemes in the standard model are existentially unforgeable,which cannot prevent adversaries from forging valid signatures on messages that have previously been signed.However,signature verification algorithms of ID-based signature schemes in the standard model require expensive bilinear pairing operations.In order to overcome the shortcomings of the existing ID-based signature schemes such as strong security assumption and high computation cost，a strongly unforgeable ID-based server-aided verification signature scheme was presented.This scheme was proven to be secure under collusion attacks,adaptive chosen identity and message attacks in the standard model.Analysis results show that the proposed scheme effectively reduces computation cost of pairing operation,and it greatly reduces computational complexity of signature verification algorithm.The proposed scheme is more efficient than the existing ID-based signature schemes.

Key words: ID-based server-aided verification signature, strong unforgeability, collusion attack, standard model

杨小东,杨苗苗,高国娟,李亚楠,鲁小勇,王彩芬. 强不可伪造的基于身份服务器辅助验证签名方案[J]. 通信学报, 2016, 37(6): 49-55.

Xiao-dong YANG,Miao-miao YANG,Guo-juan GAO,Ya-nan LI,Xiao-yong LU,Cai-fen WANG. ID-based server-aided verification signature scheme with strong unforgeability[J]. Journal on Communications, 2016, 37(6): 49-55.

图/表 1

参考文献 17

[1]	SHAMIR A , . Identity-based cryptosystems and signature schemes[C]// CRYPTO 1984,LNCS 0196. Springer Berlin Heidelberg, 1984: 47-53.
[2]	BONEH D , FRANKLIN M . Identity-based encryption from the Weil pairing[C]// CRYPTO 2001,LNCS 2139. Springer Berlin Heidelberg, 2001: 213-229.
[3]	KAR J . Provably secure on-line/off-line identity-based signature scheme for wireless sensor network[J]. IJ Network Security, 2014,16(1): 29-39.
[4]	TIAN M , HUANG L . Efficient identity-based signature from lattices[M]. ICT Systems Security and Privacy Protection,Springer Berlin Heidelberg, 2014: 321-329.
[5]	TSENG Y M , TSAI T T , HUANG S S . Leakage-free ID-based signature[J]. The Computer Journal, 2015,58(4): 750-757.
[6]	ATTRAPADUNG N , EMURA K , HANAOKA G ,et al. A revocable group signature scheme from identity-based revocation techniques:achieving constant-size revocation list[C]// Applied Cryptography and Network Security. 2014: 419-437.
[7]	HAO S G , LI Z , GHULAM M . A union authentication protocol of cross-domain based on bilinear pairing[J]. Journal of Software, 2013,8(5): 1094-1100.
[8]	ZHANG J , SUN Z . An ID-based server-aided verification short signature scheme avoid key escrow[J]. Journal of Information Science and Engineering, 2013,29(3): 459-473.
[9]	CANETTI R , GOLDREICH O , HALEVI S . The random oracle methodology,revisited[J]. Journal of the ACM, 2004,51(4): 557-594.
[10]	PATERSON K G , SCHULDT J C N . Efficient identity-based signatures secure in the standard model[C]// ACISP,LNCS 4058. Springer Berlin Heidelberg, 2006: 207-222.
[11]	WU Q , ZHANG L Y . New strongly unforgeable identity-based signature scheme in the standard model[J]. Journal of Beijing University of Posts and Telecommunications, 2011,34(3): 71-74.
[12]	TSAI T T , TSENG Y M , HUANG S S . Efficient strongly unforgeable ID-based signature without random oracles[J]. Informatica, 2014,25(3): 505-521.
[13]	HUNG Y H , TSAI T T , TSENG Y M ,et al. Strongly secure revocable ID-based signature without random oracles[J]. Information Technology and Control, 2014,43(3): 264-276.
[14]	KWON S . An identity-based strongly unforgeable signature without random oracles from bilinear pairings[J]. Information Sciences, 2014,276(1): 1-9.
[15]	WU W , MU Y , SUSILO W ,et al. Provably secure server-aided verification signatures[J]. Computers ＆Mathematics with Applications, 2011,61(7): 1705-1723.
[16]	WANG Z , WANG L , YANG Y ,et al. 's server-aided verification signature schemes[J]. IJ Network Security, 2010,10(2): 158-160.
[17]	WU H , XU C X , DENG J ,et al. On the security of server-aided verification signature schemes[J]. Journal of Computational Information System, 2013,9(4): 1449-1454.

方案	签名验证者的计算开销				签名长度	标准模型	安全属性	安全假设
方案	G₁中的幂运算	G₂中的幂运算	双线性对运算	计算复杂度	签名长度	标准模型	安全属性	安全假设
PS方案	0	0	3	3P	3\|G₁\|	是	存在不可伪造性	CDH假设
TTS方案	0	1	4	M₂+4P	3\|G₁\|	是	强不可伪造性	CDH和CRH假设
Kwon方案	1	0	3	M₁+3P	3\|G₁\|	是	强不可伪造性	CDH假设
ZS-SAVIDS-1方案	1	4	1	M₁+4M₂+P	2\|G₁\|	否	存在不可伪造性	BDH假设
ZS-SAVIDS-2方案	1	4	0	M₁+4M₂	2\|G₁\|	否	存在不可伪造性	BDH假设
本文方案	1	1	0	M₁+M₂	3\|G₁\|	是	强不可伪造性	CDH假设

强不可伪造的基于身份服务器辅助验证签名方案

ID-based server-aided verification signature scheme with strong unforgeability

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献 17

相关文章 15

Metrics

推荐阅读 0

[1]	侯红霞, 张明瑞, 赵艳琦, 董晓丽. 素数阶群上基于非对称对的身份基环签名[J]. 通信学报, 2021, 42(9): 155-164.
[2]	田苗苗, 陈静, 仲红. 格上基于身份的增量签名方案[J]. 通信学报, 2021, 42(1): 108-117.
[3]	孙磊,赵志远,王建华,朱智强. 云存储环境下支持属性撤销的属性基加密方案[J]. 通信学报, 2019, 40(5): 47-56.
[4]	杨小东,李雨潼,王晋利,麻婷春,王彩芬. 标准模型下可撤销的基于身份的代理重签名方案[J]. 通信学报, 2019, 40(5): 153-162.
[5]	孟倩,马建峰,陈克非,苗银宾,杨腾飞. 基于云计算平台的物联网加密数据比较方案[J]. 通信学报, 2018, 39(4): 167-175.
[6]	杨小东,陈春霖,杨平,安发英,麻婷春,王彩芬. 可证安全的部分盲代理重签名方案[J]. 通信学报, 2018, 39(2): 65-72.
[7]	汤永利,胡明星,刘琨,叶青,闫玺玺. 新的格上基于身份的全同态加密方案[J]. 通信学报, 2017, 38(5): 39-47.
[8]	牛淑芬,牛灵,王彩芬,李亚红. 标准模型下可证明安全的无证书广义签密[J]. 通信学报, 2017, 38(4): 35-45.
[9]	叶青,胡明星,汤永利,刘琨,闫玺玺. 新的格上基于身份的分级加密方案[J]. 通信学报, 2017, 38(11): 54-64.
[10]	杨春丽,闫建华,郑世慧,王励成,杨榆. 对一个格基身份签名方案的分析和改进[J]. 通信学报, 2015, 36(5): 104-111.
[11]	李艳琼,李继国,张亦辰. 标准模型下安全的无证书签名方案[J]. 通信学报, 2015, 36(4): 186-194.
[12]	应作斌,马建峰,崔江涛. 支持动态策略更新的半策略隐藏属性加密方案[J]. 通信学报, 2015, 36(12): 1-221.
[13]	陈桢,张文芳,王小敏. 基于属性的抗合谋攻击可变门限环签名方案[J]. 通信学报, 2015, 36(12): 212-222.
[14]	李琦,马建峰,熊金波,刘西蒙. 快速解密的自适应安全KP-ABE方案[J]. 通信学报, 2014, 35(Z2): 26-32.
[15]	李琦，马建峰，熊金波，刘西蒙. 快速解密的自适应安全KP-ABE方案[J]. 通信学报, 2014, 35(Z2): 5-32.