格上可编程哈希函数的环签名方案

doi:10.19678/j.issn.1000-3428.0056114

计算机工程 ›› 2020, Vol. 46 ›› Issue (10): 131-136. doi: 10.19678/j.issn.1000-3428.0056114

格上可编程哈希函数的环签名方案

葛炳辉, 赵宗渠, 何铮, 秦攀科

河南理工大学计算机科学与技术学院, 河南焦作 454000

收稿日期:2019-09-25 修回日期:2019-11-14 发布日期:2019-11-29
作者简介:葛炳辉(1995-),男,硕士研究生,主研方向为密码学、信息安全;赵宗渠(通信作者),讲师、博士;何铮,硕士研究生;秦攀科,讲师、博士。
基金资助:
国家自然科学基金（61802117）；"十三五"国家密码发展基金（MMJJ20170122）；河南省科技厅项目（182102310923）；河南理工大学博士基金（B2016-39）。

Ring Signature Scheme of Programmable Hash Function on Lattices

GE Binghui, ZHAO Zongqu, HE Zheng, QIN Panke

College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan 454000, China

Received:2019-09-25 Revised:2019-11-14 Published:2019-11-29

摘要/Abstract

摘要： 针对传统格上环签名方案的签名和密钥长度过长的问题，建立一种改进的格上可编程哈希函数环签名模型。利用MP12陷门函数生成签名密钥，通过可编程哈希函数模拟随机预言机的部分可编程性质，运用格上的分区证明方法，将其应用于环签名方案的构造，从而得到验证密钥和签名。分析结果表明，与其他采用随机矩阵与G矩阵的格上环签名方案相比，该方案所得签名、验证密钥和签名密钥长度更短，在标准模型下满足自适应选择消息攻击的存在不可伪造性（EUF-CMA）安全要求。

关键词: 格, 可编程哈希函数, 环签名, MP12陷门函数, 标准模型

Abstract: To address the problem that the length of signature and key is too long in traditional ring signature schemes on lattices,this paper proposes an improved ring signature model of Programmable Hash Function(PHF) on lattices.The MP12 trapdoor function is used to generate the signature key.The PHF is used to simulate part of the programmable properties of the random oracle machine.The partition proof method on lattices is used for the construction of the ring signature scheme to obtain the verification key and signature.Analysis results show that compared with other lattice-based ring signature schemes using random matrix and G matrix,the proposed scheme reduces the length of the signature,verification key and signature key,and can meet Existential Unforgeability against Adaptive Chosen Messages Attack(EUF-CMA)security requirements in the standard model.

Key words: lattice, Programmable Hash Function(PHF), ring signature, MP12 trapdoor function, standard model

中图分类号:

TP309

葛炳辉, 赵宗渠, 何铮, 秦攀科. 格上可编程哈希函数的环签名方案[J]. 计算机工程, 2020, 46(10): 131-136.

GE Binghui, ZHAO Zongqu, HE Zheng, QIN Panke. Ring Signature Scheme of Programmable Hash Function on Lattices[J]. Computer Engineering, 2020, 46(10): 131-136.

http://www.ecice06.com/CN/Y2020/V46/I10/131

图/表 1

参考文献

[1] RIVEST R L,SHAMIR A,TAUMAN Y.How to leak a secret[C]//Proceedings of the 7th International Conference on Theory and Application of Cryptology and Information Security.Berlin,Germany:Springer,2001:21-28.
[2] DODIS Y,KIAYIAS A,NICOLOSI A,et al.Anonymous identification in ad-hoc groups[C]//Proceedings of EUROCRYPT'04.Berlin,Germany:Springer,2004:609-626.
[3] BENDER A,KATZ J,MORSELLI R.Ring signatures:stronger definitions,and constructions without random oracles[EB/OL].[2019-08-10].https://www.iacr.org/cryptodb/data/paper.php?pubkey=12638.
[4] ABE M,OHKUBO M,SUZUKI K.L-out-of-n signatures from a variety of keys[C]//Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.Berlin,Germany:Springer,2002:65-73.
[5] HERRANZ J,GERMAN S.Forking lemmas for ring signature schemes[J].Journal of Management Studies,2003,2904(2):266-279.
[6] ZHANG F,SAFAVINAINI R,SUSILO W.An efficient signature scheme from bilinear pairings and its applications[C]//Proceedings of PKC'04.Berlin,Germany:Springer,2004:277-290.
[7] SHACHAM H,WATERS B.Efficient ring signatures without random oracles[J].Public Key Cryptography,2007,3352(2):166-180.
[8] NGUYEN L.Accumulators from bilinear pairings and applications[C]//Proceedings of CT-RSA'05.Berlin,Germany:Springer,2005:275-292.
[9] SHOR P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J].SIAM Review,1999,41(2):303-332.
[10] MICCIANCIO D,PEIKERT C.Trapdoors for lattices:simpler,tighter,faster,smaller[C]//Proceedings of EUROCRYPT'12.Berlin,Germany:Springer,2012:700-718.
[11] GENTRY C,PEIKERT C,VAIKUNTANATHAN V.Trapdoors for hard lattices and new cryptographic constructions[C]//Proceedings of the 40th Annual ACM Symposium on Theory of Computing.New York,USA:ACM Press,2008:32-37.
[12] LI Zichen,LIANG Lan,SUN Yafei.Digital certificate scheme based on lattice signature algorithm[J].Journal of Cryptologic Research,2018,5(1):13-20.(in Chinese)李子臣,梁斓,孙亚飞.一种基于格签名算法的数字证书方案[J].密码学报,2018,5(1):13-20.
[13] JIA Xiaoying,HE Debiao,XU Zhiyan,et al.An efficient identity-based ring signature scheme over a lattice[J].Journal of Cryptologic Research,2007,4(4):392-404.(in Chinese)贾小英,何德彪,许芷岩,等.格上高效的基于身份的环签名体制[J].密码学报,2017,4(4):392-404.
[14] CASH D,HOFHEINZ D,KILTZ E,et al.Bonsai trees,or how to delegate a lattice basis[C]//Proceedings of 2010 International Conference on Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2010:62-68.
[15] WANG Jin,SUN Bo.Ring signature schemes from lattice basis delegation[C]//Proceedings of the 13th Conference on Information and Communications Security.Berlin,Germany:Springer,2011:15-28.
[16] TIAN Miaomiao,HUANG Liusheng,YANG Wei.Efficient lattice-based ring signature scheme[J].Chinese Journal of Computers,2012,35(4):712-718.(in Chinese)田苗苗,黄刘生,杨威.高效的基于格的环签名方案[J].计算机学报,2012,35(4):712-718.
[17] Rena Ehmet,ZHANG Juan,LI Wei,et al.An improvement of a ring signature scheme based on lattices[J].Journal of Xiamen University(Natural Science Edtion),2018,57(2):238-242.(in Chinese)热娜·艾合买提,张娟,李伟,等.一个基于格的环签名方案的改进[J].厦门大学学报(自然科学版),2018,57(2):238-242.
[18] HOFHEINZ D,KILTZ E.Programmable Hash functions and their applications[EB/OL].[2019-08-10].https://link.springer.com/article/10.1007/s00145-011-9102-5.
[19] HOFHEINZ D,JAGER T,KILTZ E.Short signatures from weaker assumptions[C]//Proceedings of ASIACRYPT'11.Berlin,Germany:Springer,2011:647-666.
[20] WANG Zhiwei.Short signature based on programmable Hash functions[J].SCIENTIA SINICA Informationis,2013,43(3):335-342.(in Chinese)王志伟.基于可编程Hash函数的短签名[J].中国科学(信息科学),2013,43(3):335-342.
[21] ZHANG Jiang,CHEN Yu,ZHANG Zhenfeng.Programmable Hash functions from lattices:short signatures and IBEs with small key sizes[C]//Proceedings of CRYPTO'16.Berlin,Germany:Springer,2016:303-332.

选择文件类型/文献管理软件名称

选择包含的内容

格上可编程哈希函数的环签名方案

Ring Signature Scheme of Programmable Hash Function on Lattices

RichHTML

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	饶金涛, 崔喆. 基于SM9盲签名与环签名的安全电子选举协议[J]. 计算机工程, 2023, 49(6): 13-23,33.
[2]	陈治旭, 靳雁霞, 芦烨, 杨晶, 刘亚变, 史志儒. 基于子图卷积神经网络的多精度服装建模方法[J]. 计算机工程, 2023, 49(4): 174-181.
[3]	朱晓强, 陈琦. 基于可控卷积曲面的三维神经元建模[J]. 计算机工程, 2023, 49(3): 231-237.
[4]	蔡瑞初, 吴思宇, 乔杰. 面向故障间格兰杰因果发现的霍克斯过程研究[J]. 计算机工程, 2023, 49(1): 65-72.
[5]	谢柏林, 黎琦, 魏娜, 邝建. 基于用户行为的社交网络人格特质识别方法[J]. 计算机工程, 2023, 49(1): 279-286,294.
[6]	梁登玉, 刘大明. 融合多粒度信息与外部知识的短文本匹配模型[J]. 计算机工程, 2022, 48(8): 129-135,143.
[7]	刘振国, 李钊, 宋滕滕, 何益智. 结合可变形卷积与双边网格的立体匹配网络[J]. 计算机工程, 2022, 48(12): 241-247,254.
[8]	许乐, 安虹, 陈俊仕, 张鹏飞, 武铮. 基于神威·太湖之光的非结构网格计算加速算法[J]. 计算机工程, 2022, 48(12): 45-53.
[9]	王斌, 王忠民, 张荣. 基于多通道脑电信号的因果网络情绪识别[J]. 计算机工程, 2022, 48(1): 69-74.
[10]	叶青, 赵楠楠, 赵宗渠, 秦攀科, 闫玺玺, 汤永利. 格上高效的完全动态群签名方案[J]. 计算机工程, 2021, 47(2): 160-167,175.
[11]	陈志鹏, 郑文秀, 黄琼丹. 基于Sobel滤波器的图像风格转换算法[J]. 计算机工程, 2021, 47(12): 274-277,284.
[12]	陈佳, 董学良, 梁金星, 何儒汉. 基于注意力机制的CycleGAN服装局部风格迁移研究[J]. 计算机工程, 2021, 47(11): 305-312.
[13]	卢嘉嘉, 杜育松. 整数上离散高斯取样的常数时间实现方法[J]. 计算机工程, 2020, 46(8): 119-123.
[14]	张玉磊, 宋婷婷, 张永洁, 王彩芬. 基于无证书密码体制的失败-停止环签名方案[J]. 计算机工程, 2020, 46(8): 106-111.
[15]	赵宗渠, 黄鹂娟, 范涛, 马少提. 格上基于KEM的认证密钥交换协议[J]. 计算机工程, 2020, 46(7): 122-128.

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

格上可编程哈希函数的环签名方案

Ring Signature Scheme of Programmable Hash Function on Lattices

RichHTML

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献

相关文章 15

编辑推荐

Metrics

本文评价