Article: An efficient attribute-based signature scheme with claim-predicate mechanism Journal: International Journal of Grid and Utility Computing (IJGUC) 2013 Vol.4 No.2/3 pp.151 - 159 Abstract: Attribute-Based Signature (ABS) is a promising cryptographic primitive that allows a signer to sign a message under a signing policy to convince the verifier that the signer holds a subset of attributes satisfying the signing predicate. A successful execution of ABS should leak no information about the identity of the signer or the attributes he possesses, other than the fact these attributes that the underlying signer possesses satisfy the given signing predicate. ABS has a lot of applications in real scenarios requiring both authentication and privacy properties, such as anonymous authentication and attribute-based messaging systems. In this paper, we present a new construction of ABS with claim-predicate mechanism based on Bethencourt et al.'s ciphertext-policy attribute-based encryption scheme. The proposed construction is proved to be existentially unforgeable in the random oracle model for the selective adversary and can achieve perfect privacy. Compared with existing schemes, the new construction provides better efficiency in terms of both the computational cost and signature size. Inderscience Publishers - linking academia, business and industry through research

Title: An efficient attribute-based signature scheme with claim-predicate mechanism

Authors: Changji Wang; Wentao Li

Addresses: Department of Computer Science, School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China; Research Center of Software Technology for Information Service, South China Normal University, Guangzhou 501631, China ' Department of Computer Science, School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China

Abstract: Attribute-Based Signature (ABS) is a promising cryptographic primitive that allows a signer to sign a message under a signing policy to convince the verifier that the signer holds a subset of attributes satisfying the signing predicate. A successful execution of ABS should leak no information about the identity of the signer or the attributes he possesses, other than the fact these attributes that the underlying signer possesses satisfy the given signing predicate. ABS has a lot of applications in real scenarios requiring both authentication and privacy properties, such as anonymous authentication and attribute-based messaging systems. In this paper, we present a new construction of ABS with claim-predicate mechanism based on Bethencourt et al.'s ciphertext-policy attribute-based encryption scheme. The proposed construction is proved to be existentially unforgeable in the random oracle model for the selective adversary and can achieve perfect privacy. Compared with existing schemes, the new construction provides better efficiency in terms of both the computational cost and signature size.

Keywords: attribute-based encryption; attribute-based signatures; perfect privacy; existential unforgeability; privacy protection; security; cryptography; claim-predicate mechanism.

DOI: 10.1504/IJGUC.2013.056251

International Journal of Grid and Utility Computing, 2013 Vol.4 No.2/3, pp.151 - 159

Received: 30 Aug 2012
Accepted: 23 Sep 2012
Published online: 18 Sep 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: An efficient attribute-based signature scheme with claim-predicate mechanism

Keep up-to-date