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

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

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

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.

Figures/Tables 1

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	签名验证者的计算开销				签名长度	标准模型	安全属性	安全假设
方案	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

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 17

Related Articles 15

Metrics

Recommended 0

[1]	Youliang TIAN, Maoqing TIAN, Hongfeng GAO, Miao HE, Jinbo XIONG. Cooperation-based location authentication scheme for crowdsensing applications [J]. Journal on Communications, 2022, 43(9): 121-133.
[2]	Xiaodong FU, Xinxin QI, Li LIU, Wei PENG, Jiaman DING, Fei DAI. Detecting and preventing collusion attack in DPoS based on power index [J]. Journal on Communications, 2022, 43(12): 123-133.
[3]	Hongxia HOU, Mingrui ZHANG, Yanqi ZHAO, Xiaoli DONG. ID-based ring signature on prime order group from asymmetric pairing [J]. Journal on Communications, 2021, 42(9): 155-164.
[4]	Shichang XUAN, Hao TANG, Wu YANG. Method for detecting collusion attack node in road condition information sharing based on reputation point [J]. Journal on Communications, 2021, 42(4): 158-168.
[5]	Miaomiao TIAN, Jing CHEN, Hong ZHONG. Identity-based incremental signature scheme from lattices [J]. Journal on Communications, 2021, 42(1): 108-117.
[6]	Lei SUN,Zhiyuan ZHAO,Jianhua WANG,Zhiqiang ZHU. Attribute-based encryption scheme supporting attribute revocation in cloud storage environment [J]. Journal on Communications, 2019, 40(5): 47-56.
[7]	Xiaodong YANG,Yutong LI,Jinli WANG,Tingchun MA,Caifen WANG. Revocable identity-based proxy re-signature scheme in the standard model [J]. Journal on Communications, 2019, 40(5): 153-162.
[8]	Hongyu YANG,Zaiming WANG. Android collusion attack detection model [J]. Journal on Communications, 2018, 39(6): 27-36.
[9]	Qian MENG,Jianfeng MA,Kefei CHEN,Yinbin MIAO,Tengfei YANG. Data comparable encryption scheme based on cloud computing in Internet of things [J]. Journal on Communications, 2018, 39(4): 167-175.
[10]	Xiaodong YANG,Chunlin CHEN,Ping YANG,Faying AN,Tingchun MA,Caifen WANG. Partially blind proxy re-signature scheme with proven security [J]. Journal on Communications, 2018, 39(2): 65-72.
[11]	Yong-li TANG,Ming-xing HU,Kun LIU,Qing YE,Xi-xi YAN. Novel identity-based fully homomorphic encryption scheme from lattice [J]. Journal on Communications, 2017, 38(5): 39-47.
[12]	Shu-fen NIU,Ling NIU,Cai-fen WANG,Ya-hong LI. Certificateless generalized signcryption scheme in the standard model [J]. Journal on Communications, 2017, 38(4): 35-45.
[13]	Qing YE,Ming-xing HU,Yong-li TANG,Kun LIU,Xi-xi YAN. Novel hierarchical identity-based encryption scheme from lattice [J]. Journal on Communications, 2017, 38(11): 54-64.
[14]	ANGChun-li Y,ANJian-hua Y,HENGShi-hui Z,ANGLi-cheng W,ANGYu Y. Analysis and improvement of an identity-based signature scheme from lattices [J]. Journal on Communications, 2015, 36(5): 104-111.
[15]	Yan-qiong LI,Ji-guo LI,Yi-chen ZHANG. Certificateless signature scheme without random oracles [J]. Journal on Communications, 2015, 36(4): 186-194.