You are looking at a specific version 20140829:002112 of this paper. See the latest version.

Paper 2011/700

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

Tatsuaki Okamoto and Katsuyuki Takashima

Abstract

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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Major revision. IEEE Transactions on Cloud Computing
DOI
10.1109/TCC.2014.2353053
Keywords
attribute-based signaturesmulti-authority systemnon-monotone predicates
Contact author(s)
Takashima Katsuyuki @ aj MitsubishiElectric co jp
History
2014-08-29: last of 4 revisions
2011-12-23: received
See all versions
Short URL
https://ia.cr/2011/700
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.