高级检索

    基于商密SM9的属性基在线/离线签名方案

    Attribute-Based Online/Offline Signature Scheme Based on SM9

    • 摘要: 属性基签名(attribute-based signature, ABS)方案利用属性集标识用户. 只有当属性集满足访问策略时用户才能产生有效签名. 与传统数字签名方案相比,属性基签名方案不仅利用属性集隐藏用户的真实身份从而获得匿名性,而且通过制定访问策略实现了细粒度访问控制. 在基于椭圆曲线的属性基签名方案中通常需要使用大量的群指数运算或配对操作,这些操作计算代价高昂,导致签名过程计算开销较大. 在线/离线签名技术可以在未知消息之前将高昂的操作通过离线预计算,从而降低了轻量级设备在线计算代价. SM9 标识密码算法作为我国自主设计的商用密码,已由ISO/IEC标准化并被广泛使用. 以商密SM9 标识密码算法为基础,利用在线/离线签名技术,构造了一种基于商密SM9的属性基在线/离线签名(attribute-based online/offline signature, ABOOS)方案. 不仅可以实现细粒度访问控制,同时也适用于轻量级设备. 在随机谕言机模型下,方案的安全性可以规约到q-SDH(q-strong Diffie-Hellman)困难问题. 理论分析和实验仿真表明提出的方案有效降低了签名阶段的计算代价,适用于物联网等应用环境.

       

      Abstract: The attribute-based signature (ABS) scheme uses a set of attributes to identify users. The user can generate a valid signature only when the attributes satisfy the access policy. Compared with the traditional digital signature scheme, the ABS scheme not only utilizes a set of attributes to hide the real identity of users to obtain anonymity, but also realizes fine-grained access control by access policy. In ABS schemes based on elliptic curve, a large number of group exponentiation operations or pairing operations are usually required, which are computationally expensive, resulting in high computational overhead in the signature process. The online/offline signature technology can pre-compute expensive operations offline before knowing message, thereby reducing the online computing cost of lightweight devices. As a commercial cipher independently designed by China, the SM9 identity-based cryptographic algorithm has been standardized by ISO/IEC and is widely used. Based on the SM9 identity-based cryptographic algorithm, we propose an attribute-based online/offline signature (ABOOS) scheme based on the SM9 by using the online/offline signature technology in this paper. Not only ine-grained access control can be achieved, but also it is suitable for lightweight devices. In the random oracle model, the security of the proposed scheme is reduced to the q-strong Diffie-Hellman (q-SDH) hard problem. Theoretical analysis and experimental simulation show that the proposed scheme effectively reduces the computational cost of the signing process, and is suitable for application environments such as the internet of things.

       

    /

    返回文章
    返回