You are not logged in.

Secure outsourced attribute-based signatures

Chen,X, Li,J, Huang,X, Li,J, Xiang,Y and Wong,DS 2014, Secure outsourced attribute-based signatures, IEEE transactions on parallel and distributed systems, vol. 25, no. 12, pp. 3284-3294, doi: 10.1109/TPDS.2013.2295809.

Attached Files
Name Description MIMEType Size Downloads

Title Secure outsourced attribute-based signatures
Author(s) Chen,X
Li,J
Huang,X
Li,J
Xiang,YORCID iD for Xiang,Y orcid.org/0000-0001-5252-0831
Wong,DS
Journal name IEEE transactions on parallel and distributed systems
Volume number 25
Issue number 12
Start page 3284
End page 3294
Publisher IEEE Computer Society
Place of publication Piscataway, NJ
Publication date 2014-12-01
ISSN 1045-9219
Keyword(s) Attribute-based signature
Cloud computing
Outsource-secure algorithm
Science & Technology
Technology
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Computer Science
Engineering
ENCRYPTION
COMPUTATIONS
SCHEME
Summary Attribute-based signature (ABS) enables users to sign messages over attributes without revealing any information other than the fact that they have attested to the messages. However, heavy computational cost is required during signing in existing work of ABS, which grows linearly with the size of the predicate formula. As a result, this presents a significant challenge for resource-constrained devices (such as mobile devices or RFID tags) to perform such heavy computations independently. Aiming at tackling the challenge above, we first propose and formalize a new paradigm called Outsourced ABS, i.e., OABS, in which the computational overhead at user side is greatly reduced through outsourcing intensive computations to an untrusted signing-cloud service provider (S-CSP). Furthermore, we apply this novel paradigm to existing ABS schemes to reduce the complexity. As a result, we present two concrete OABS schemes: i) in the first OABS scheme, the number of exponentiations involving in signing is reduced from O(d) to O(1) (nearly three), where d is the upper bound of threshold value defined in the predicate; ii) our second scheme is built on Herranz et al.'s construction with constant-size signatures. The number of exponentiations in signing is reduced from O(d2) to O(d) and the communication overhead is O(1). Security analysis demonstrates that both OABS schemes are secure in terms of the unforgeability and attribute-signer privacy definitions specified in the proposed security model. Finally, to allow for high efficiency and flexibility, we discuss extensions of OABS and show how to achieve accountability as well.
Language eng
DOI 10.1109/TPDS.2013.2295809
Field of Research 080303 Computer System Security
Socio Economic Objective 890202 Application Tools and System Utilities
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2014, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30072051

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 14 times in TR Web of Science
Scopus Citation Count Cited 21 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 178 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Thu, 02 Apr 2015, 16:21:07 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.