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

田苗苗; 陈静; 仲红

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

您当前的位置：

首页 >

文章列表页 >

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

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

- 格上基于身份的增量签名方案
- Identity-based incremental signature scheme from lattices
- 通信学报 2021年42卷第1期页码：108-117
- 作者机构：
  
  安徽大学计算机科学与技术学院，安徽合肥 230601
- 作者简介：
  
  [ "田苗苗（1987- ），男，安徽阜阳人，博士，安徽大学副教授、硕士生导师，主要研究方向为密码学与信息安全。" ]
  [ "陈静（1996- ），女，安徽池州人，安徽大学硕士生，主要研究方向为密码学与信息安全。" ]
  [ "仲红（1965- ），女，安徽固镇人，博士，安徽大学教授、博士生导师，主要研究方向为网络与信息安全。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61502443)
- DOI：10.11959/j.issn.1000-436x.2021037
  中图分类号： TP309
- 网络首发：2021-01，
  
  纸质出版：2021-01-25
- 稿件说明：
移动端阅览
田苗苗, 陈静, 仲红. 格上基于身份的增量签名方案[J]. 通信学报, 2021,42(1):108-117.

Miaomiao TIAN, Jing CHEN, Hong ZHONG. Identity-based incremental signature scheme from lattices[J]. Journal on Communications, 2021, 42(1): 108-117.
田苗苗, 陈静, 仲红. 格上基于身份的增量签名方案[J]. 通信学报, 2021,42(1):108-117. DOI： 10.11959/j.issn.1000-436x.2021037.

Miaomiao TIAN, Jing CHEN, Hong ZHONG. Identity-based incremental signature scheme from lattices[J]. Journal on Communications, 2021, 42(1): 108-117. DOI： 10.11959/j.issn.1000-436x.2021037.

摘要

将基于身份的密码学思想应用于增量签名中，提出了基于身份的增量签名概念，并基于格上困难问题设计了一种基于身份的增量签名方案。在标准的小整数解困难假设下，所提方案在标准模型下满足适应性选择身份和选择消息攻击下的不可伪造性。理论分析和实验结果表明，所提增量签名算法比标准签名算法具有更高的计算效率。

Abstract

By taking ideas of identity-based cryptography into incremental signatures

the concept of identity-based incremental signature was proposed

and then a specific scheme from lattices was also constructed.The scheme was shown to be provably secure against adaptive chosen identity and chosen message attacks in the standard model

assuming the hardness of the small integer solution problem.Theoretical analysis and experimental results show that the computational overhead of the incremental signature algorithm is less than that of the standard signature algorithm.

关键词

Keywords

references

GOLDWASSER S , MICALI S , RIVEST R . A digital signature scheme secure against adaptive chosen-message attacks [J ] . SIAM Journal on computing , 1988 , 17 ( 2 ): 281 - 308 .

KHATI L , VERGNAUD D . Analysis and improvement of an authentication scheme in incremental cryptography [C ] // International Conference on Selected Areas in Cryptography . Berlin:Springer , 2018 : 50 - 70 .

BELLARE M , GOLDREICH O , GOLDWASSER S . Incremental cryptography:the case of hashing and signing [C ] // Annual International Cryptology Conference . Berlin:Springer , 1994 : 216 - 233 .

邵奇峰 , 金澈清 , 张召 , 等 . 区块链技术:架构及进展 [J ] . 计算机学报 , 2018 , 41 ( 5 ): 969 - 988 .

SHAO Q F , JIN C Q , ZHANG Z , et al . Blockchain:architecture and research progress [J ] . Chinese Journal of Computers , 2018 , 41 ( 5 ): 969 - 988 .

ATIGHEHCHI K , . On the incremental digital signatures [C ] // IEEE International Conference on Trust,Security and Privacy in Computing and Communications/IEEE International Conference on Big Data Science and Engineering (TrustCom/BigDataSE) . Piscataway:IEEE Press , 2018 : 1605 - 1609 .

CHEN J , TIAN M , GAO C , et al . A lattice-based incremental signature scheme [J ] . IEEE Access , 2019 , 7 : 21201 - 21210 .

SHAMIR A , . Identity-based cryptosystems and signature schemes [C ] // Workshop on the Theory and Application of Cryptographic Techniques . Berlin:Springer , 1984 : 47 - 53 .

AJTAI M , . Generating hard instances of lattice problems [C ] // ACM Symposium on Theory of Computing . New York:ACM Press , 1996 : 99 - 108 .

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

REGEV O , . Lattice-based cryptography [C ] // Annual International Cryptology Conference . Berlin:Springer , 2006 : 131 - 141 .

TIAN M , HUANG L , WEI Y . A new hierarchical identity-based signature scheme from lattices in the standard model [J ] . International Journal of 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 .

TIAN M , HUANG L . Efficient identity-based signature from lattices [C ] // IFIP International Information Security Conference . Berlin:Springer , 2014 : 321 - 329 .

TIAN M , HUANG L . Identity-based signatures from lattices:simpler,faster,shorter [J ] . Fundamenta Informaticae , 2016 , 145 ( 2 ): 171 - 187 .

YANG Z , DUONG D , et al . Hierarchical identity-based signature in polynomial rings [J ] . The Computer Journal , 2020 , 63 ( 10 ): 1490 - 1499 .

XIE J , HU Y , GAO J , et al . Efficient identity-based signature over NTRU lattice [J ] . Frontiers of Information Technology ＆ Electronic Engineering , 2016 , 17 ( 2 ): 135 - 142 .

ZHAO G , TIAN M . A simpler construction of identity-based ring signatures from lattices [C ] // International Conference on Provable Security . Berlin:Springer , 2018 : 277 - 291 .

孙意如 , 梁向前 , 商玉芳 . 理想格上基于身份的环签名方案 [J ] . 计算机应用 , 2016 , 36 ( 7 ): 1861 - 1865 .

SUN Y R , LIANG X Q , SHANG Y F . Identity based ring signature scheme in ideal lattice [J ] . Journal of Computer Applications , 2016 , 36 ( 7 ): 1861 - 1865 .

CANETTI R , GOLDREICH O , HALEVI S . The random oracle methodology,revisited [J ] . Journal of the ACM , 2004 , 51 ( 4 ): 557 - 594 .

ZHANG J , CHEN Y , ZHANG Z . Programmable hash functions from lattices:short signatures and IBEs with small key sizes [C ] // Annual International Cryptology Conference . Berlin:Springer , 2016 : 303 - 332 .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller [C ] // Annual International Conference on the Theory and Applications of Cryptographic Techniques . Berlin:Springer , 2012 : 700 - 718 .

BOYEN X , . Lattice mixing and vanishing trapdoors:a framework for fully secure short signatures and more [C ] // International Workshop on Public Key Cryptography . Berlin:Springer , 2010 : 499 - 517 .

CHOON J , CHEON J . An identity-based signature from gap Diffie-Hellman groups [C ] // International Workshop on Public Key Cryptography . Berlin:Springer , 2003 : 18 - 30 .

REGEV O , . On lattices,learning with errors,random linear codes,and cryptography [C ] // ACM Symposium on Theory of Computing . New York:ACM Press , 2005 : 84 - 93 .

GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions [C ] // ACM Symposium on Theory of Computing . New York:ACM Press , 2008 : 197 - 206 .

HOFHEINZ D , KILTZ E . Programmable hash functions and their applications [C ] // Annual International Cryptology Conference . Berlin:Springer , 2008 : 21 - 38 .

BONEH D , FREEMAN D . Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures [C ] // International Workshop on Public Key Cryptography . Berlin:Springer , 2011 : 1 - 16 .

浏览量

1354

下载量

CSCD

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

提交

工具集

关联资源

格上基于身份的云存储完整性检测方案

新的格上基于身份的分级加密方案

新的格上基于身份的全同态加密方案

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

基于格的可验证定时签名与应用