An efficient attribute-based signature scheme with claim-predicate mechanism Online publication date: Thu, 18-Sep-2014
by Changji Wang; Wentao Li
International Journal of Grid and Utility Computing (IJGUC), Vol. 4, No. 2/3, 2013
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.
Online publication date: Thu, 18-Sep-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org