格上基于身份的前向安全签名方案

doi:10.3969/j.issn.1000-3428.2015.09.028

计算机工程

格上基于身份的前向安全签名方案

向新银

(西安财经学院信息学院,西安 710100)

收稿日期:2015-02-05 出版日期:2015-09-15 发布日期:2015-09-15
作者简介:向新银(1979-),男,讲师、硕士,主研方向:格公钥,密码技术。
基金项目:
陕西省自然科学基金资助项目(2012JM8018,2014JM2-6099);国家统计科学研究计划基金资助项目(2013LY052);陕西省教育厅科学计划基金资助项目(2010JK553,2013JK1193);西安财经学院基金资助项目(13XCK01)。

Identity-based Forward Secure Signature Scheme from Lattices

XIANG Xinyin

(School of Information,Xi’an University of Finance and Economics,Xi’an 710100,China)

Received:2015-02-05 Online:2015-09-15 Published:2015-09-15

摘要/Abstract

摘要： 在前向安全签名方案中,即使当前的秘钥泄露,也能保证先前生成的签名具有不可伪造性。针对已有格上基于前向安全签名方案签名长度过长的不足,利用Lyubashevsky无陷门技术,提出一个高效的前向安全签名方案。在随机预言模型下,基于小整数解困难假设证明了其能抵抗适应性选择消息攻击,无需陷门函数和高斯抽样函数。性能分析结果表明,与现有方案相比,该方案具有前向安全的特性,计算效率更高。

关键词: 基于身份签名, 前向安全, 格, 无陷门, 小整数解问题, 后量子密码

Abstract: In a forward secure signature scheme,the scheme can guarantee the unforgeability of the foregoing signatures even if the current signing secret key is revealed.Aiming at the efficiency weakness that exists in the previous forward secure signature schemes from lattices,using the technique (without trapdoors) of Lyubashevsky,an efficient identity-based forward secure signature scheme from lattices is proposed.In the random oracle model,the scheme is existentially unforgeable against adaptive chosen message attacks under the Small Integer Solution(SIS) problem.Performance analysis results show that,compared with other existing schemes,the scheme has the characters of forward secure and can provide better efficiency.

Key words: identity-based signature, forward security, lattice, without trapdoors, Small Integer Solution(SIS) problem, post-quantum cryptography

中图分类号:

TP309

向新银. 格上基于身份的前向安全签名方案[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2015.09.028.

XIANG Xinyin. Identity-based Forward Secure Signature Scheme from Lattices[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2015.09.028.

参考文献

参考文献［1］Shamir A.Identity-based Cryptosystems and Signature Schemes［C］//Proceedings of Advances in Cryptology-Crypto’84.Santa Barbara,USA:Springer-Verlag,1984:47-53. ［2］Boneh D,Franklin M.Identity Based Encryption from the Weil Pairing［C］//Proceedings of Advances in Cryptology-CRYPTO’01.Santa Barbara,USA:Springer-Verlag,2001:213-229. ［3］Yu Jia,Kong Fanyu,Cheng Xiangguo,et al.One Forward-secure Signature Scheme Using Bilinear Maps and Its Applications［J］.Information Science,2014,279(1):60-76. ［4］Yu Jia,Kong Fanyu,Cheng Xiangguo,et al.Erratum to the Paper:Forward-secure Identity-based Public-key Encryption without Random Oracles［J］.Fundamenta Informaticae,2012,114(1):103. ［5］Anderson R.Two Remarks on Public Key Cryp-tology ［EB/OL］.(2011-11-12).http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-549.pdf. ［6］Bellare M,Miner S.A Forward-secure Digital Signature Scheme［C］//Proceedings of the 19th Annual International Cryptology Conference.Santa Barbara,USA:Springer-Verlag,1999:431-448. ［7］Liu Yali,Yin Xinchun,Qiu Liang.ID-based Forward Secure Signature Scheme from the Bilinear Pairings［C］//Proceedings of International Symposium on Electronic Commerce and Security.Guangzhou,China:［s.n.］,2008:179-183. ［8］Ajtai M.Generating Hard Instances of Lattice Problems［C］//Proceedings of the 28th Annual ACM Symposium on the Theory of Computing.Pennsylvania,USA:［s.n.］,1996:99-108. ［9］王小云,刘明洁.格密码学研究［J］.密码学学报,2014,1(1):13-27. ［10］Lyubashevsky V.Lattice Signatures Without Trap-doors［C］//Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques.Cambridge,UK:［s.n.］,2012:738-755. ［11］Rückert M.Strongly Unforgeable Signatures and Hierarchical Identity-based Signatures from Lattices Without Random Oracles［C］//Proceedings of the International Workshop on Post-quantum Cryptography Darmstadt.［S.1.］:Springer- Verlag,2010:215-222. ［12］Zhang Xiaojun,Xu Chunxiang,Jin Chunhua,et al.Efficient Forward Secure Identity-based Shorter Signature from Lattice［J］.Computers & Electrical Engineering,2014,40(6):1963-1971. ［13］Bellare M,Neven G.Multi-signatures in the Plain Public-key Model and a General Forking Lemma［C］//Proceedings of ACM Conference on Computer and Communications Security.Alexandria,USA:ACM Press,2006:390-399. 编辑索书志

[1]	卢嘉嘉, 杜育松. 整数上离散高斯取样的常数时间实现方法[J]. 计算机工程, 2020, 46(8): 119-123.
[2]	赵宗渠, 黄鹂娟, 范涛, 马少提. 格上基于KEM的认证密钥交换协议[J]. 计算机工程, 2020, 46(7): 122-128.
[3]	党小超, 李月霞, 郝占军, 张彤. 一种基于改进蚁群算法的三维K-栅栏覆盖算法[J]. 计算机工程, 2020, 46(2): 221-229.
[4]	陈敏, 王娆芬. 基于二维图像与迁移卷积神经网络的心律失常分类[J]. 计算机工程, 2020, 46(10): 315-320.
[5]	葛炳辉, 赵宗渠, 何铮, 秦攀科. 格上可编程哈希函数的环签名方案[J]. 计算机工程, 2020, 46(10): 131-136.
[6]	叶青, 王明明, 汤永利, 秦攀科, 王永军. 格上基于可编程哈希函数的HIBE方案[J]. 计算机工程, 2020, 46(1): 129-135,143.
[7]	齐向明, 王佳琦. 网格形变细分的大视差图像拼接算法[J]. 计算机工程, 2020, 46(1): 236-242.
[8]	汪荣峰, 胡敏. 基于扫描线的卫星区域覆盖分析算法[J]. 计算机工程, 2020, 46(1): 243-246,254.
[9]	杨世伟, 蒋国平, 宋玉蓉, 涂潇. 基于GPU的稀疏矩阵存储格式优化研究[J]. 计算机工程, 2019, 45(9): 23-31,39.
[10]	杨贤康, 潘茂东, 童伟华. 基于L₀优化的网格曲面特征线提取算法[J]. 计算机工程, 2019, 45(7): 251-257,263.
[11]	董敏,陈铁桩,杨浩. 基于Mesh的地面激光点云分离方法研究[J]. 计算机工程, 2019, 45(6): 32-36,44.
[12]	杨苗苗,封建湖,程晓晗,冯娟娟. 求解复杂交通流模型的低耗散中心迎风格式[J]. 计算机工程, 2019, 45(6): 37-44.
[13]	倪鸿, 刘鑫. 基于神威·太湖之光的非结构网格众核优化技术[J]. 计算机工程, 2019, 45(6): 45-51.
[14]	李佳佳,臧寅旭,刘向宇,夏秀峰,朱睿. 面向时间依赖路网的空间索引方法[J]. 计算机工程, 2019, 45(5): 127-134.
[15]	孙伟娟,王宁. 基于一致性支持度的实体top-k扩展算法[J]. 计算机工程, 2019, 45(4): 181-188.

格上基于身份的前向安全签名方案

Identity-based Forward Secure Signature Scheme from Lattices

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10