2011 | OriginalPaper | Buchkapitel
Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model
verfasst von : Tatsuaki Okamoto, Katsuyuki Takashima
Erschienen in: Public Key Cryptography – PKC 2011
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 efficient and practical. Its efficiency is comparable to (several times worse than) that of the most efficient (almost optimally efficient) ABS scheme the security for which is proven in the generic group model.