Attribute-based signcryption scheme based on linear codes
Attribute-based signcryption scheme based on linear codes
复制标题
基于线性码的属性签密方案
DOI：
10.1016/j.ins.2017.06.033
复制
发表时间：
2017
影响因子：
8.1
通讯作者：
Li Jing
中科院分区：
文献类型：
--
作者：
Song Yun;Li Zhi-Hui;Li Yong-Ming;Li Jing
基于属性的签密（ABSC）方案与传统的先加密后签名的方案相比，不仅在计算量和通信量上都有较大的降低，而且能够保证消息的机密性，保证消息的真实性，并能证明发送者的属性。本文首先基于线性码形式化了基于属性签密的选择属性安全模型。然后，我们构造了一个灵活而有效的ABSC方案的基础上的秘密共享方法称为线性码秘密共享方案。该ABSC方案通过在线性码上构造访问结构，突破了门限限制，采用了不同的属性集。此外，我们的方案实现了选择密文攻击的机密性和选择消息攻击的不可伪造性的选择属性模型。最后，我们比较了所提出的计划与现有的计划，其性质和效率。
Compared with traditional schemes in which encryption follows a signature, the attribute-based signcryption (ABSC) scheme not only costs less both in terms of both computation and communication but also provides message confidentiality, ensures the authenticity of a message, and attests to the attributes of the sender. In this paper, we first formalize a selective-attribute security model of the attribute-based signcryption based on linear codes. Then, we construct a flexible and efficient ABSC scheme based on a secret sharing method called Linear Codes Secret Sharing Scheme. This ABSC scheme breaks the threshold limit and employs diverse attribute sets by constructing the access structures on linear codes. In addition, our scheme achieves confidentiality against chosen-ciphertext attacks and unforgeability against chosen-message attacks in the selective-attribute model. Finally, we compare the proposed scheme with existing schemes in terms of their properties and efficiency.