Analysis and improvement of an identity-based signature scheme from lattices

ANGChun-li Y; ANJian-hua Y; HENGShi-hui Z; ANGLi-cheng W; ANGYu Y

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

您当前的位置：

首页 >

文章列表页 >

Analysis and improvement of an identity-based signature scheme from lattices

Academic paper | 更新时间：2024-06-05

- Analysis and improvement of an identity-based signature scheme from lattices
- Journal on Communications Vol. 36, Issue 5, Pages: 104-111(2015)
- 作者机构：
  
  1. 北京邮电大学信息安全中心，北京 100876
  2. 北京邮电大学灾备技术国家工程实验室，北京 100876
  3. 鲁东大学信息与电气工程学院，山东烟台 264025
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61121061);The National Natural Science Foundation of China(61202082);The National Natural Science Foundation of China(61370194);The National Natural Science Foundation of China(61161140320);The Fundamental Research Funds for the Central Universities(BUPT2012RC0219);The Fundamental Research Funds for the Central Universities(BUPT2013RC0311);The Fundamental Research Funds for the Central Universities(BUPT2013RC0308)
- DOI：10.11959/j.issn.1000-436x.2015136
  CLC： TP309
- Online First：2015-05，
  
  Published：25 May 2015
- 稿件说明：
移动端阅览
ANGChun-li Y, ANJian-hua Y, HENGShi-hui Z, et al. Analysis and improvement of an identity-based signature scheme from lattices[J]. Journal on Communications, 2015, 36(5): 104-111.
DOI：

ANGChun-li Y, ANJian-hua Y, HENGShi-hui Z, et al. Analysis and improvement of an identity-based signature scheme from lattices[J]. Journal on Communications, 2015, 36(5): 104-111. DOI： 10.11959/j.issn.1000-436x.2015136.

摘要

首先分析了Liu等人2013年给出的一个格基身份签名（IBS）方案在安全性证明中存在的问题，进而说明方案的证明达不到作者所宣称的选择身份和自适应选择消息攻击下的强不可伪造性。其次，使用Boyen10签名技术（PKC 2010）对此方案中签名算法进行改进，并在标准模型下证明了改进方案在选择身份和自适应选择消息攻击下具有强不可伪造性的安全性质。另外，对比分析了改进的方案和其他IBS方案的效率和安全性。

Abstract

Liu et al proposed an identity-based signature from lattices in 2013

and proved that it can achieve strong un-forgeability in the standard model.Through analysis

the security proof of this scheme has some defect

and then show that the scheme cannot prove the strong unforgeability under selective identity and adaptive chosen-message attacks.Then

using Boyen signing technique (PKC 2010) inpoves the signing algorithm

and proves the strong unforgeability under selective identity and adaptive chosen-message attacks (SU-sID-CMA) in the standard model.In addition

it com-pares the efficiency and security of the scheme and the other identity-based signatures from lattices.

关键词

Keywords

references

SHAMIR A . Identity-based cryptosystems and signature schemes [A ] . Advances in Cryptology [C ] . Springer Berlin Heidelberg , 1985 . 47 - 53 .

BONEH D , FRANKLIN M . Identity-based cryptosystems and signature schemes [A ] . Advances in Cryptology CRYPTO 2001 [C ] . Springer Berlin Heidelberg , 2001 . 213 - 229 .

WATERS B . Efficient identity-based encryption without random oracles [A ] . Advances in Cryptology–EUROCRYPT 2005 [C ] . Springer Berlin Heidelberg , 2005 . 114 - 127 .

PATERSON K G , SCHULDT J C N . Efficient identity-based signatures secure in the standard model [A ] . Information Security and Privacy [C ] . Springer Berlin Heidelberg , 2006 . 207 - 222 .

SHOR P W . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [J ] . SIAM Journal on Computing , 1997 , 26 ( 5 ): 1484 - 1509 .

AJTAI M . Generating hard instances of lattice problems [A ] . Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing [C ] . ACM , 1996 . 99 - 108 .

REGEV O . On lattices,learning with errors,random linear codes,and cryptography [J ] . Journal of the ACM (JACM) , 2009 , 56 ( 6 ): 34 - .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller [A ] . Advances in Cryptology–EUROCRYPT 2012 [C ] . Springer Berlin Heidelberg , 2012 . 700 - 718 .

GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions [A ] . Proceedings of the 40th Annual ACM Symposium on Theory of Computing [C ] . ACM , 2008 . 197 - 206 .

BOYEN X . Lattice mixing and vanishing trapdoors:a framework for fully secure short signatures and more [A ] . Public Key Cryptography–PKC 2010 [C ] . Springer Berlin Heidelberg , 2010 . 499 - 517 .

CASH D , HOFHEINZ D , KILTZ E , et al . Bonsai trees,or how to delegate a lattice basis [J ] . Journal of Cryptology , 2012 , 25 ( 4 ): 601 - 639 .

AGRAWAL S , BONEH D , BOYEN X . Efficient Lattice (H) IBE in the Standard Model [M ] . Advances in Cryptology–EUROCRYPT 2010 . Springer Berlin Heidelberg , 2010 : 553 - 572 .

BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard) LWE [A ] . Foundations of Computer Science (FOCS),2011 IEEE 52nd Annual Symposium on [C ] . IEEE , 2011 . 97 - 106 .

BRAKERSKI Z , GENTRY C , VAIKUNTANATHAN V . (Leveled) Fully homomorphic encryption without bootstrapping [A ] . Proceedings of the 3rd Innovations in Theoretical Computer Science Conference [C ] . ACM , 2012 . 309 - 325 .

LEURENT Z , NGUYEN P . How risky is the random-oracle model [A ] . Advances in Cryptology-CRYPTO 2009 [C ] . Springer Berlin Heidelberg , 2009 . 445 - 464 .

Lyubashevsky V . Lattice signatures without trapdoors [A ] . Advances in Cryptology EUROCRYPT 2012 [C ] . Springer Berlin Heidelberg , 2012 . 738 - 755 .

DUCAS L , DURMUS A , LEPOINT T , et al . Lattice signatures and bimodal Gaussians [A ] . Advances in Cryptology–CRYPTO 2013 [C ] . Springer Berlin Heidelberg , 2013 . 40 - 56 .

RÜCKERT M . Strongly unforgeable signatures and hierarchical identitybased signatures from lattices without random oracles [A ] . Post-Quantum Cryptography [C ] . Springer Berlin Heidelberg , 2010 . 182 - 200 .

XIA F , YANG B , SUN W . An efficient identity-based signature from lattice in the random oracle model [J ] . Journal of Computational Information Systems , 2011 , 7 ( 11 ): 3963 - 3971 .

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

TIAN M , HUANG L , YANG W . A new hierarchical identity-based signature scheme from lattices in the standard model [J ] . IJ Network Security , 2012 , 14 ( 6 ): 310 - 315 .

LIU Z , HU Y , ZHANG X , et al . Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model [J ] . Security and Communication Networks , 2013 , 6 ( 1 ): 69 - 77 .

MICCIANCIO D , GOLDWASSER S . Complexity of Lattice Problems:a Cryptographic Perspective [M ] . Springer , 2002 .

MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on Gaussian measures [J ] . SIAM Journal on Computing , 2007 , 37 ( 1 ): 267 - 302 .

ALWEN J , PEIKERT C . Generating shorter bases for hard random lattices [J ] . Theory of Computing Systems , 2011 , 48 ( 3 ): 535 - 553 .

Views

1497

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Linearly homomorphic aggregate signature secure in the standard model

Identity-based puncturable signature scheme

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

Related Author

HAN Yiliang

LI Ruifeng

ZHOU Tanping

WANG Jingjing

YANG Xiaoyuan

Dongmei YANG

Yue CHEN

Jianghong WEI

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

School of Data and Target Engineering， Information Engineering University

School of Computer Science, Shaanxi Normal University

AI问答

⁰