Scheduled Maintenance on Saturday, October 24, 2015
IEEE Xplore will be unavailable from 9:00 AM - 12:00 noon ET (13:00 - 16:00 UTC).
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
By Topic

Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Okamoto, T. ; Secure Platform Labs., NTT, Musashino, Japan ; Takashima, K.

This paper presents a fully secure (adaptive-predicate unforgeable and private) attribute-based signature (ABS) scheme in the standard model. The security of the proposed ABS scheme is proven under standard assumptions, the decisional linear (DLIN) assumption and the existence of collision resistant (CR) hash functions. The admissible predicates of the proposed ABS scheme are more general than those of the existing ABS schemes, i.e., the proposed ABS scheme is the first to support general non-monotone predicates, which can be expressed using NOT gates as well as AND, OR, and Threshold gates, while the existing ABS schemes only support monotone predicates. The proposed ABS scheme is comparably as efficient as (several times worse than) one of the most efficient ABS schemes, which is proven to be secure in the generic group model.

Published in:

Cloud Computing, IEEE Transactions on  (Volume:2 ,  Issue: 4 )