Paper 2015/1021

New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption

Katsuyuki Takashima

Abstract

We propose adaptively secure attribute-based encryption (ABE) schemes for boolean formulas over large universe attributes from the decisional linear (DLIN) assumption, which allow attribute reuse in an available formula without the previously employed redundant multiple encoding technique. Thus our KP-(resp. CP-)ABE has non-redundant ciphertexts (resp. secret keys). For achieving the results, we develop a new encoding method for access policy matrix for ABE, by decoupling linear secret sharing (LSS) into its matrix and randomness, and partially randomizing the LSS shares in simulation. The new techniques are of independent interest and we expect it will find another application than ABE.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Major revision. ACISP 2017, the 22nd Australasian Conference on Information Security and Privacy
Keywords
Attribute-Based EncryptionMulti-Use Attributes in PolicyAdaptive SecurityStatic Assumption
Contact author(s)
Takashima Katsuyuki @ aj mitsubishielectric co jp
History
2017-04-18: last of 6 revisions
2015-10-23: received
See all versions
Short URL
https://ia.cr/2015/1021
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/1021,
      author = {Katsuyuki Takashima},
      title = {New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2015/1021},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/1021}},
      url = {https://eprint.iacr.org/2015/1021}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.