基于ISRSAC-PSS算法的可证安全分组顺序聚合签名算法  

A Provably Secure Block Sequential Aggregate Signature Algorithm Based on ISRSAC-PSS Algorithm

作　　者：张艳硕 隋吉达 严梓洋 袁煜淇 ZHANG Yanshuo;SUI Jida;YAN Ziyang;YUAN Yuqi(Department of Cryptography Science and Technology,Beijing Electronic Science and Technology Institute,Beijing 100070,China)

机构地区：[1]北京电子科技学院密码科学与技术系,北京100070

出　　处：《信息网络安全》2025年第2期215-227,共13页Netinfo Security

基　　金：中央高校基本科研业务费[3282024003];北京市自然科学基金[4232034]。

摘　　要：文章深入研究了可证明安全理论、顺序聚合签名算法及聚合签名技术,针对已有的基于ISRSAC-PSS算法的可证明安全顺序聚合签名算法进行改进,引入“分组型”理念,设计了基于ISRSAC-PSS的分组顺序聚合签名算法,经分析可知,该算法在基于大整数分解问题的困难性假设下,可以证明在随机预言模型下是安全的。计算分析得出,在分组合理的情况下,该算法不仅在效率上得到提高,还节省了算法的应用开销。This paper conducted an in-depth study on provable security theory,sequential aggregate signature algorithms and aggregate signature technology.By improved the existing provably secure sequential aggregate signature algorithm based on the ISRSACPSS scheme,introduced a"block-type"concept and design a block sequential aggregate signature algorithm based on ISRSAC-PSS.The analysis demonstrates that,under the hardness assumption of the large integer factorization problem,the proposed algorithm is provably secure in the random oracle model.Computational analysis reveals that with reasonable grouping strategies,the algorithm not only enhances efficiency but also reduces application overhead.

关 键 词：顺序聚合签名 分组型 随机预言模型 ISRSAC 安全性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]