完全可约束的可修订签名  

Fully constrainable redactable signature scheme

作　　者：陈曦源 黄晓芳[1] Chen Xiyuan;Huang Xiaofang(College of Computer Science&Technology,Southwest University of Science&Technology,Mianyang Sichuan 621010,China)

机构地区：[1]西南科技大学计算机科学与技术学院,四川绵阳621010

出　　处：《计算机应用研究》2021年第6期1843-1848,共6页Application Research of Computers

基　　金：国家自然科学基金青年基金资助项目(61702429);四川省组织部基金资助项目(17sjjg02);四川省教育厅基金资助项目(17zd1119);西南科技大学研究生创新基金资助项目(19ycx0053)。

摘　　要：针对现有的可修订签名方案不能表达所有修订约束的问题,通过默克尔树结合拟交换哈希函数的方式,设计了一种能够表达所有修订约束情况的完全可约束的可修订签名方案,并形式化定义和证明了该方案的不可伪造性、隐私性以及完全可约束性。同时通过分析和比较,该方案的签名空间较小,具备完全的修订约束能力,适用于对修订操作有严格限制、存储空间较小的场景。Aiming at the problem that the existing redactable signature schemes can’t express all the revision constraints,this paper designed a fully constrainable redactable signature scheme which could express all revision constraints by means of Merkel tree and quasi exchange hash function,and formally defined and proved the unforgeability,privacy and fully constrain of the scheme.At the same time,through analysis and comparison,the signature space of the proposed scheme is small,and has the ability of complete revision constraint.It is suitable for scenarios with strict restrictions on revision operation and small storage space.

关 键 词：数字签名 可修订签名 修订约束 

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