An efficient attribute-based signature scheme with claim-predicate mechanism. (1st January 2013)

• Record Type: Journal Article
• Authors: Wang, Changji; Li, Wentao
• Is Part Of: International journal of grid and utility computing. Volume 4:Number 2/3(2013)
• Page Start: 151
• Page End: 159
• Publication Date: 2013-01-01
• Subjects: attribute-based encryption -- attribute-based signature -- perfect privacy -- existential unforgeability; Electronic data processing -- Distributed processing -- Periodicals; Electronic commerce -- Management -- Computer programs -- Periodicals; 004.605
• Languages: English
• ISSNs: 1741-847X

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.ӳ 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.