You are not logged in.

Efficient and secure attribute-based signature for monotone predicates

Gu, K, Jia, W, Wang, G and Wen, Sheng 2016, Efficient and secure attribute-based signature for monotone predicates, Acta informatica, vol. 54, pp. 521-541, doi: 10.1007/s00236-016-0270-5.

Attached Files
Name Description MIMEType Size Downloads

Title Efficient and secure attribute-based signature for monotone predicates
Author(s) Gu, K
Jia, W
Wang, G
Wen, Sheng
Journal name Acta informatica
Volume number 54
Start page 521
End page 541
Total pages 21
Publisher Springer
Place of publication Berlin, Germany
Publication date 2016-05-23
ISSN 0001-5903
1432-0525
Keyword(s) Science & Technology
Technology
Computer Science, Information Systems
Computer Science
IDENTITY-BASED ENCRYPTION
ANONYMOUS CREDENTIALS
RANDOM ORACLES
SYSTEMS
Summary Attribute-based signature (ABS) is a novel cryptographic primitive, which can make the signing party sign a message with fine-grained control over identifying information. ABS only reveals the fact that the verified message must be signed by a user with a set of attributes satisfying a predicate. Thus, ABS can hide any identifying information and make fine-grained control on signing. Presently, many attribute-based signature schemes have been proposed, but most of them are not very efficient. Maji et al. recently presented a complete definition and construction about ABS for monotone predicates and showed three instantiations under their framework for ABS. Although the most practical one of their instantiations is efficient, the instantiation is constructed in the generic group model and has been proved to be insecure. Then, Okamoto et al. proposed an attribute-based signature scheme in the standard model, which can support generalized non-monotone predicates over access structure. However, their scheme is not efficient in practice. In this paper, we present a framework for ABS and show a detailed security model for ABS. Under our framework, we present an attribute-based signature scheme for monotone predicates in the standard model, where we choose the Waters’ signature scheme as the prototype of our attribute-based signature scheme. Compared with the Maji’s scheme in the generic group model, the proposed scheme is constructed in the standard model. Furthermore, compared with the Okamoto’s scheme, the proposed scheme is more efficient by decreasing the computation cost.
Language eng
DOI 10.1007/s00236-016-0270-5
Field of Research 080303 Computer System Security
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2016, Springer
Persistent URL http://hdl.handle.net/10536/DRO/DU:30085308

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 31 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Thu, 18 Aug 2016, 13:28:32 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.