期刊文献+

基于格的数字签名及其聚合类变体的综述

An Overview of Lattice-based Signature and Its Variants Supporting Aggregation
下载PDF
导出
摘要 数字签名作为一项重要的认证技术,使得人们能够在数字信息时代进行便捷的数字办公,在信息安全、身份认证、数据完整性、不可否认性等方面应用广泛.多重签名和聚合签名将数字签名压缩技术和批处理技术进行整合,极大节省了存储空间和传输带宽的消耗,适用于区块链比特币交易、电子投票、证书链认证等实际业务.随着量子计算机的快速发展,许多传统密码体制的安全性受到严重威胁,而格中的困难问题被认为是能够抵抗量子计算攻击的数学问题,所以格密码成为目前备受关注的一类能够抵抗量子计算攻击的公钥密码体制.因此,研究基于格的数字签名方案是使数字签名能够抵抗量子计算攻击的有效举措.本文主要围绕基于格的数字签名,包括普通数字签名、多重签名和聚合签名,对近些年的主要研究成果进行介绍和分析,对基于格的数字签名及其未来的研究方向进行了总结. As an important authentication technology,digital signature enables people to carry out convenient digital office in the digital information age.It is widely used in information security,identity authentication,data integrity,non-repudiation and so on.As the extensions of digital signature,multi-signature and aggregate signature integrate digital signature compression technology and batch processing technology,which greatly saves the consumption of storage space and transmission bandwidth.And they are widely used in blockchain bitcoin transactions,electronic voting,certificate chains authentication and so on.With the rapid development of quantum computers,the security of many traditional cryptosystems has been seriously threatened.Fortunately,lattice-based cryptography is a type of public-key cryptosystem that can withstand quantum computing attacks,because the hard problem on lattice is considered to be resistant to the attacks of quantum computers.Therefore,research on lattice-based digital signature schemes is an effective measure to make digital signatures resistant against quantum computing attacks.This paper mainly focuses on lattice-based digital signatures,including general digital signature,multi-signature and aggregate signature,introduces and analyzes the main research results in recent years.Finally,lattice-based signatures and their future research directions are summarized.
作者 陈新坚 黄建业 黄琼 CHEN Xin-Jian;HUANG Jian-Ye;HUANG Qiong(College of Mathematics and Informatics,South China Agricultural University,Guangzhou 510642,China;Guangzhou Key Lab of Intelligent Agriculture,Guangzhou 510642,China;School of Computing and Information Technology,University of Wollongong,Wollongong,NSW 2500,Australia)
出处 《密码学报》 CSCD 2023年第1期1-19,共19页 Journal of Cryptologic Research
基金 广东省基础与应用基础研究重大项目(2019B030302008) 国家自然科学基金(62272174,61872152) 广州市科技计划(201902010081)。
关键词 格密码 数字签名 多重签名 聚合签名 lattice-based cryptography digital signature multi-signature aggregate signature
  • 相关文献

参考文献5

二级参考文献44

  • 1张卷美,曹杰,刘年义,杨亚涛,李子臣.一种基于NTRU新型签名方案的设计[J].四川大学学报(工程科学版),2015,47(1):49-53. 被引量:5
  • 2Oded Regev.On lattices, learning with errors, random linear codes, and cryptography[J].Journal of the ACM (JACM).2009(6) 被引量:2
  • 3Johannes Bl?mer,Stefanie Naewe.Sampling methods for shortest vectors, closest vectors and successive minima[J].Theoretical Computer Science.2009(18) 被引量:1
  • 4Phong Q. Nguyen,Thomas Vidick.Sieve algorithms for the shortest vector problem are practical[J].Journal of Mathematical Cryptology.2008(2) 被引量:1
  • 5Jean-Sebastien Coron,Alexander May.Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring[J].Journal of Cryptology.2007(1) 被引量:1
  • 6Dorit Aharonov,Oded Regev.Lattice problems in NP ∩ coNP[J].Journal of the ACM (JACM).2005(5) 被引量:1
  • 7Subhash Khot.Hardness of approximating the shortest vector problem in lattices[J].Journal of the ACM (JACM).2005(5) 被引量:1
  • 8Phong Q. Nguyen,Igor E. Shparlinski.The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces[J].Designs Codes and Cryptography.2003(2) 被引量:1
  • 9I. Dinur,G. Kindler,R. Raz,S. Safra.Approximating CVP to Within Almost-Polynomial Factors is NP-Hard[J].COMBINATORICA.2003(2) 被引量:1
  • 10Irit Dinur.Approximating SVP ∞ to within almost-polynomial factors is NP-hard[J].Theoretical Computer Science.2002(1) 被引量:1

共引文献60

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部