Attribute-based signcryption scheme based on linear codes

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.