盲聚合签名方案  

Blind aggregate signature scheme

作　　者：邹静[1] 郝春辉[1] 

机构地区：[1]淮阴师范学院计算机科学系,江苏淮安223001

出　　处：《计算机工程与设计》2006年第10期1883-1885,共3页Computer Engineering and Design

摘　　要：在电子货币系统中,用户Alice要从不同的银行得到签名支票(这是一个盲签名过程),然后将这些支票付给Bob。Bob再拿着这些支票到各个银行进行验证取款。这个过程需要耗费大量的时间和存储控件。提出了一个盲聚合签名方案,可以让Bob得到一个唯一的签名,从而大大节省时间和空间并且降低对带宽的要求。该方案结合了盲签名和聚合签名优点,能使生成的盲签名聚合为一个聚合签名。In an e-cash system, a user Alice obtains signing check from different banks （this is a process of getting blind signatures）, and then she gives these checks to Bob, Bob verifies these checks in the different banks. Obviously, this progress will consume much time and storage. A blind aggregate signature scheme was presented. This scheme could give Bob a unique signature,, which will save plenty of time and storage, and reduce the request of bandwidth. Because the scheme integrated the merits both of blind signature and aggregate signature, the signature produced by this scheme could be unique.

关 键 词：盲签名 Diffie-Hellman难题 聚合签名 双线性配对函数 

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