z-logo
open-access-imgOpen Access
Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model
Author(s) -
Tatsuaki Okamoto,
Katsuyuki Takashima
Publication year - 2015
Publication title -
ieee transactions on cloud computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.075
H-Index - 49
ISSN - 2168-7161
DOI - 10.1109/tcc.2014.2353053
Subject(s) - computing and processing , communication, networking and broadcast technologies
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom