Digital Multi-signature Scheme Based on Lattice

PENG Chun-yan; DU Xiu-juan; LI Mei-ju; LIU Xue-ke

Chinese

您当前的位置：

首页 >

文章列表页 >

Digital Multi-signature Scheme Based on Lattice

更新时间：2026-09-04

- Digital Multi-signature Scheme Based on Lattice
- Vol. 33, Issue 8, Pages: 50-53(2016)
- 作者机构：
  
  青海师范大学机构计算机学院,青海,西宁,810008
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2016
- 稿件说明：
移动端阅览
彭春燕, 杜秀娟, 李梅菊, 刘雪珂. 基于格的数字多签名体制[J]. 微电子学与计算机, 2016, 33(8): 50-53, 58.

PENG Chun-yan, DU Xiu-juan, LI Mei-ju, et al. Digital Multi-signature Scheme Based on Lattice[J]. 2016, 33(8): 50-53.
彭春燕, 杜秀娟, 李梅菊, 刘雪珂. 基于格的数字多签名体制[J]. 微电子学与计算机, 2016, 33(8): 50-53, 58. DOI：

PENG Chun-yan, DU Xiu-juan, LI Mei-ju, et al. Digital Multi-signature Scheme Based on Lattice[J]. 2016, 33(8): 50-53. DOI：

摘要

传统的数字多签名体制大多基于大整数与离散对数困难问题

这一多签名方案在量子计算机环境下已不再安全.利用格理论上的小整数解问题(SIS)的困难性问题构造的数字多签名方案

能够抵抗量子计算机攻击.该数字多签名体制

可以分为同时签名和顺序签名两种类型.分别描述了格理论上的这两种数字多签名体制的密钥生成、签名步骤及签名验证过程

证明了基于格的数字多签名的有效性及安全性.

Abstract

The traditional digital multi-signature scheme mostly based on large integer factorization and the discrete logarithm problems

which has not been secure in quantum environment. The paper presents a new lattice-based multi-signature scheme that can resist the quantum attack using the hardness of average-case short integer solution problem (SIS). Multi-signature includes two types: simultaneous signature and sequential signature. The paper describes respectively the key generation

multi-signature generation and multi-signature verification of the two multi-signature schemes

and then has proved the digital multi-signature scheme based on lattice is especially efficient and secure to multi-signature generation.

关键词

Keywords

references

K Itakura, K Nakamura. A public-key cryptosystem suitable for digital multisignatures[J]. NEC research and development, 1983, 71(1): 1-8. DOI: 1

Micciancio D, Regev O. Worst-case to average-case reductions based on gaussian measures[J]. SIAM Journal on Computing, 2007, 37(1) : 267-302. DOI: 267

Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis[C]// Proc of Eurocrypt 2010 LNCS6110. Berlin: Springer, 2010: 523-552.

Micciancio D, Vadhan S P. Statistical zero-knowledge proofs with efficient provers: Lattice Problems and more[C]//Proceedings of the Advances in Cryptology-CryPTP'03. Berlin: Springer-Verlag, 2003: 282-298.

Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for Hard Lattices and New Cryptographic Constructions[C]//Proc of STOC'2008. Victoria: ACM, 2008: 197-206.

Ajtai M. Generating hard instances of the short basis problem[C]. ICALP 1999. Berlin: Springer Verlag, 1999: 1-9.

M Bellare, G Neven. Multi-signatures in the plain public-Key model and a general forking lemma[C]//13th ACM conference on Computer and communications security (CCS'06). Alexandria, USA: IEEE, 2006.

纪家慧, 赵仁杰. 新的数字多签名体制[J]. 计算机学报, 1997, 20(6): 533-538. DOI: 533

谢璇, 喻建平, 王廷, 等. 基于格的变色龙签名方案[J]. 计算机科学, 2013, 40(2): 117-119. DOI: 117

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Aerial small object detection algorithm based on improved RT-DETR

A feature-oriented context understanding and slice analysis network for tuberculosis detection

Design of ultra-low power real-time clock circuits

Monte carlo analysis of V-layout trench SiC neutron detector

Research on the design of blockchain-based AI-generated content traceability framework

Related Author

No data

Related Institution

No data

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰