基于格上的一次群签名方案  

Lattice-Based Primary Group Signature Scheme

作　　者：侯建 李子臣[1] 张珍珍 

机构地区：[1]北京印刷学院数字版权保护技术研究中心,北京

出　　处：《软件工程与应用》2022年第5期1064-1070,共7页Software Engineering and Applications

摘　　要：传统的签名方案大多基于离散对数困难问题和大整数的素数分解问题,不能抵抗量子计算的攻击。针对此问题,本文基于格上ISIS困难问题,提出了一种新的一次群签名方案,并证明了方案的正确性、签名的不可伪造性、签名者的匿名性。新方案只需要密码杂凑算法的计算,具有更高的效率。Traditional signature schemes are mostly based on discrete logarithmic hard problems and prime factorization problems of large integers, which cannot resist the attack of quantum computing. Aiming at this problem, this paper proposes a new primary group signature scheme based on the difficult problem of ISIS on the lattice, and proves the correctness of the scheme, the unforgeability of the signature and the anonymity of the signer. The new scheme only needs the calculation of the cryptographic hash algorithm and has higher efficiency.

关 键 词：格 最小整数解问题 量子攻击 一次群签名 

分 类 号：TN918.4[电子电信—通信与信息系统]