对一个格基身份签名方案的分析和改进

杨春丽; 闫建华; 郑世慧; 王励成; 杨榆

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

您当前的位置：

首页 >

文章列表页 >

对一个格基身份签名方案的分析和改进

学术论文 | 更新时间：2024-06-05

- 对一个格基身份签名方案的分析和改进
- Analysis and improvement of an identity-based signature scheme from lattices
- 通信学报 2015年36卷第5期页码：104-111
- 作者机构：
  
  1. 北京邮电大学信息安全中心，北京 100876
  2. 北京邮电大学灾备技术国家工程实验室，北京 100876
  3. 鲁东大学信息与电气工程学院，山东烟台 264025
- 作者简介：
  
  [ "杨春丽（1986-），女，山西忻州人，北京邮电大学博士生，主要研究方向为信息安全、基于格的密码学。" ]
  [ "闫建华（1977-），男，山东聊城人，北京邮电大学博士生，主要研究方向为基于格的密码学、信息安全。" ]
  [ "郑世慧（1979-），女，山东日照人，北京邮电大学讲师，主要研究方向为经典密码和协议的分析与设计。" ]
  [ "王励成（1971-），男，甘肃镇原人，博士，北京邮电大学副教授，主要研究方向为现代密码学、网络安全和可信计算。" ]
  [ "杨榆（1978-），女，云南昆明人，博士，北京邮电大学讲师，主要研究方向为信息安全、信息隐藏和数字水印。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61121061);国家自然科学基金资助项目(61202082);国家自然科学基金资助项目(61370194);国家自然科学基金资助项目(61161140320);中央高校基本科研业务费专项基金资助项目(BUPT2012RC0219);中央高校基本科研业务费专项基金资助项目(BUPT2013RC0311);中央高校基本科研业务费专项基金资助项目(BUPT2013RC0308)
- DOI：10.11959/j.issn.1000-436x.2015136
  中图分类号： TP309
- 网络首发：2015-05，
  
  纸质出版：2015-05-25
- 稿件说明：
移动端阅览
杨春丽, 闫建华, 郑世慧, 等. 对一个格基身份签名方案的分析和改进[J]. 通信学报, 2015,36(5):104-111.

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.
杨春丽, 闫建华, 郑世慧, 等. 对一个格基身份签名方案的分析和改进[J]. 通信学报, 2015,36(5):104-111. DOI： 10.11959/j.issn.1000-436x.2015136.

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 .

浏览量

1428

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

标准模型安全的线性同态聚合签名

基于身份的可穿刺签名方案

素数阶群上基于非对称对的身份基环签名

格上基于身份的增量签名方案

标准模型下可撤销的基于身份的代理重签名方案