基于格的两轮多重签名方案 |
| |
引用本文: | 姜玫,马昌社. 基于格的两轮多重签名方案[J]. 华南师范大学学报(自然科学版), 2020, 52(6): 113-120. DOI: 10.6054/j.jscnun.2020102 |
| |
作者姓名: | 姜玫 马昌社 |
| |
作者单位: | 华南师范大学计算机学院,广州 510631 |
| |
摘 要: | 为了抵抗量子攻击且进一步降低通信代价,基于代数格提出了一种支持公钥聚合的两轮多重签名方案(TLMS方案),其安全性可归约于求解环上小整数解(Ring-SIS)问题,并在随机预言机模型下给出方案的安全性分析.相比于现有多重签名方案,基于格上困难问题构造的TLMS方案生成多重签名时仅需进行2轮交互,具有较小的计算开销和通信开销,可满足量子时代最新的安全需求.
|
关 键 词: | 格 公钥聚合 多重签名 随机预言机模型 |
收稿时间: | 2020-01-10 |
A Two-Round Lattice-Based Multi-Signature Scheme |
| |
Affiliation: | School of Computer Science, South China Normal University, Guangzhou 510631, China |
| |
Abstract: | In order to resist quantum attacks and further reduce the communication cost, a two-round algebraic la-ttice-based multi-signature scheme (TLMS scheme) supporting public key aggregation is proposed. The scheme is provably secure in the random oracle model under the ring version of the short integer solution (Ring-SIS) assumption. Compared with the existing multi-signature schemes, the two-round lattice-based multi-signature scheme needs only two rounds of interactions to generate a multi-signature, requires less computing and communication overhead and can meet the latest security requirements in the quantum era. |
| |
Keywords: | |
本文献已被 万方数据 等数据库收录! |
| 点击此处可从《华南师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《华南师范大学学报(自然科学版)》下载全文 |
|