Efficient attribute-based signatures for non-monotone predicates in the standard model

Tatsuaki Okamoto, Katsuyuki Takashima

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)

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.

Original languageEnglish
Article number6887292
Pages (from-to)409-421
Number of pages13
JournalIEEE Transactions on Cloud Computing
Volume2
Issue number4
DOIs
Publication statusPublished - 2014 Oct 1
Externally publishedYes

Keywords

  • Attribute-based signatures
  • non-monotone predicates
  • standard model security

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Efficient attribute-based signatures for non-monotone predicates in the standard model'. Together they form a unique fingerprint.

Cite this