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

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

您当前的位置：

首页 >

文章列表页 >

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

Papers | 更新时间：2024-06-05

- ID-based server-aided verification signature scheme with strong unforgeability
- Journal on Communications Vol. 37, Issue 6, Pages: 49-55(2016)
- 作者机构：
  
  西北师范大学计算机科学与工程学院，甘肃兰州 730070
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61262057);The Natural Science Foundation of Gansu Province(145RJDA325);The Science and Technology Project of State Archives Administration of China(2014-X-33);Research Fund of Higher Education of Gansu Province(2014-A011);Science and Technology Project of Lanzhou City of China(2013-4-22);The Foundation for Excellent Young Teachers by Northwest Normal University(NWNU-LKQN-13-23);The Foundation for Excellent Young Teachers by Northwest Normal University(NWNU-LKON-14-7)
- DOI：10.11959/j.issn.1000-436x.2016115
  CLC： TP309
- Online First：2016-06，
  
  Published：25 June 2016
- 稿件说明：
移动端阅览
Xiao-dong YANG, Miao-miao YANG, Guo-juan GAO, et al. ID-based server-aided verification signature scheme with strong unforgeability[J]. Journal on Communications, 2016, 37(6): 49-55.
DOI：

Xiao-dong YANG, Miao-miao YANG, Guo-juan GAO, et al. ID-based server-aided verification signature scheme with strong unforgeability[J]. Journal on Communications, 2016, 37(6): 49-55. DOI： 10.11959/j.issn.1000-436x.2016115.

摘要

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

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.

关键词

Keywords

references

SHAMIR A , . Identity-based cryptosystems and signature schemes [C ] // CRYPTO 1984,LNCS 0196 . Springer Berlin Heidelberg , 1984 : 47 - 53 .

BONEH D , FRANKLIN M . Identity-based encryption from the Weil pairing [C ] // CRYPTO 2001,LNCS 2139 . Springer Berlin Heidelberg , 2001 : 213 - 229 .

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 .

TIAN M , HUANG L . Efficient identity-based signature from lattices [M ] . ICT Systems Security and Privacy Protection,Springer Berlin Heidelberg , 2014 : 321 - 329 .

TSENG Y M , TSAI T T , HUANG S S . Leakage-free ID-based signature [J ] . The Computer Journal , 2015 , 58 ( 4 ): 750 - 757 .

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 .

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 .

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 .

CANETTI R , GOLDREICH O , HALEVI S . The random oracle methodology,revisited [J ] . Journal of the ACM , 2004 , 51 ( 4 ): 557 - 594 .

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 .

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 .

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 .

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 .

KWON S . An identity-based strongly unforgeable signature without random oracles from bilinear pairings [J ] . Information Sciences , 2014 , 276 ( 1 ): 1 - 9 .

WU W , MU Y , SUSILO W , et al . Provably secure server-aided verification signatures [J ] . Computers ＆Mathematics with Applications , 2011 , 61 ( 7 ): 1705 - 1723 .

WANG Z , WANG L , YANG Y , et al . 's server-aided verification signature schemes [J ] . IJ Network Security , 2010 , 10 ( 2 ): 158 - 160 .

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 .

Views

1161

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Linearly homomorphic aggregate signature secure in the standard model

ID-based ring signature on prime order group from asymmetric pairing

Identity-based incremental signature scheme from lattices

Revocable identity-based proxy re-signature scheme in the standard model

Attribute-based encryption scheme supporting attribute revocation in cloud storage environment

Related Author

HAN Yiliang

LI Ruifeng

ZHOU Tanping

WANG Jingjing

YANG Xiaoyuan

Hongxia HOU

Mingrui ZHANG

Yanqi ZHAO

Related Institution

Key Laboratory of Counter-Terrorism Command & Information Engineering of Ministry of Education, Engineering University of PAP

Key Lab of the Armed Police Force for Network and Information Security

School of Cryptography and Engineering, Engineering University of PAP

Guangxi Key Laboratory of Cryptography and Information Security

School of Computer Science, Shaanxi Normal University

AI问答

⁰