Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a key-policy attribute-based encryption (KP-ABE) scheme with constant-size ciphertexts, whose almost tightly semi-adaptive security is proven under the decisional linear (DLIN) assumption in the standard model. The access structure is expressive, that is given by non-monotone span programs. It also has fast decryption, i.e., a decryption includes only a constant number of pairing operations. As an application of our KP-ABE construction, we also propose an efficient, fully secure attribute-based signatures with constant-size secret (signing) keys from the DLIN. For achieving the above results, we extend the sparse matrix technique on dual pairing vector spaces. In particular, several algebraic properties of an elaborately chosen sparse matrix group are applied to the dual system security proofs.

Original languageEnglish
Pages (from-to)74-106
Number of pages33
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE103A
Issue number1
DOIs
Publication statusPublished - 2020
Externally publishedYes

Keywords

  • Attribute-based encryption
  • Attribute-based signatures
  • Constant-size ciphertexts
  • Constant-size signing keys
  • Decisional linear assumption
  • Non-monotone span programs

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption'. Together they form a unique fingerprint.

Cite this