基于属性的密钥授权签名.pdfVIP

优先出版 计 算 机 应 用 研 究 第32 卷 基于属性的密钥授权签名* 1 1 1, 2 周素芳 ，李顺东 ，杨 波 (1．陕西师范大学 计算机科学学院，西安 710 119；2 ．兰州文理学院 电子信息工程学院，兰州730010) 摘 要：在基于属性的签名中，所有用户的属性集由一个授权中心管理。这使其工作负担沉重，并成为系统的瓶颈，降 低系统效率。现有的方案将授权中心分为一个总授权中心和多个属性授权中心，他们共同管理用户属性集。在每次签名 时，所有属性授权中心和总授权中心都需要参与，这样授权中心之间的通信复杂性很高。针对以上问题，本文借助于树 型结构和分层思想，提出了密钥授权签名，并在基于CDH 困难性假设下证明了其具有不可伪造性。该方案不仅使逻辑 语义表达更精确而且可以减少授权中心的工作量。 关键词：签名；密钥授权；属性；不可伪造性；CDH 假设 中图分类号：TP 文献标志码：A Attribute-based signature with private key delegating 1 1 1, 2 ZHOU Su-fang , LI Shun-dong , YANG Bo (1. School of Computer Science, Shaanxi Normal University, Xian 710119 China; 2. School of Electron Information Engineering, Lanzhou University of Arts Science, Lanzhou 730010, China) Abstract: In the attribute-based signature schemes, all the users attributes sets are managed by an authorized center. Heavy work load makes the authorized center become the bottleneck of the system, thus reduces the systems efficiency. Existing schemes divide the authorization center into a general authorization center and multiple attributes authorization centers, and they manage users attributes together. To sign a message, all attributes authorization centers and the general authorization center need to cooperate making the communication complexity be very high. To solve this problems, we put forward a key delegated signature using tree structure and hierarchical methodology, and prove that it is unforgeable based on CDH difficulty assumption. This scheme not only makes t