基于属性的全同态签名方案  

Attribute-Based Fully Homomorphic Signature Scheme

作　　者：李明祥 王洪涛 LI Mingxiang;WANG Hongtao(Institute of Financial Research,Hebei Finance University,Baoding 071051,Hebei,China;School of Control and Computer Engineering,North China Electric Power University,Baoding 071003,Hebei,China)

机构地区：[1]河北金融学院金融研究所,河北保定071051 [2]华北电力大学控制与计算机工程学院,河北保定071003

出　　处：《武汉大学学报(理学版)》2024年第6期733-742,共10页Journal of Wuhan University:Natural Science Edition

基　　金：国家自然科学基金(61802124);中央高校基本科研业务费专项资金资助项目(2023MS137)。

摘　　要：基于属性的签名是基于身份的签名的扩展和延伸,相比基于身份的签名具有显著的优势。本文首先利用Gorbunov-Vaikuntanathan-Wichs基于格的层次型全同态签名方案的构建技术,构造了一个支持门限策略的层次型基于属性的全同态签名方案;然后在标准模型下基于小整数解(small integer solution,SIS)问题的困难性证明了所构造的方案满足固定选择消息攻击下的选择性策略的强不可伪造性;最后给出了所构造的方案的参数设置和性能分析。An attribute-based signature is an extension of an identity-based signature,which has significant advantages over an identity-based signature.At first,we construct a leveled attribute-based fully homomorphic signature scheme supporting threshold access policy by using the building technique of Gorbunov-Vaikuntanathan-Wichs leveled fully homomorphic signature scheme over lattices.We then demonstrate that the proposed scheme achieves strong unforgeability under a selectively chosen message attack,grounded in the hardness of the Small Integer Solution(SIS)problem within the standard model.Finally,we provide the constructed scheme’s parameter setting and performance analysis.

关 键 词：全同态签名 属性 强不可伪造性 小整数解问题 

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