Attribute based encryption with direct efficiency tradeoff

Nuttapong Attrapadung, Goichiro Hanaoka, Tsutomu Matsumoto, Tadanori Teruya, Shota Yamada

  • 1 Citations

Abstract

We propose the first fully secure unbounded Attribute-Based Encryption (ABE) scheme such that the key size and ciphertext size can be directly traded off. Our proposed scheme is parameterized by a positive integer d, which can be arbitrarily chosen at setup. In our scheme, the ciphertext size is O(t/d), the private key size is O(md), and the pub- lic key size is O(d), where t, m are the sizes of attribute sets and policies corresponding to ciphertext and private key, respectively. Our scheme can be considered as a generalization that includes two of the state-of-the-art ABE instantiations, namely, the unbounded ABE scheme and the ABE scheme with constant-size ciphertexts proposed by Attrapadung (Eurocrypt 2014). Indeed, these two schemes correspond to the two extreme cases of our scheme, that is, when setting d = 1 and when setting d as the maximum size of allowed attribute sets, respec- tively. Furthermore, our scheme also yields a tradeoff between encryp- tion and decryption time. Interestingly, when estimating efficiency using numerical parameters, the decryption time is minimized at d being some- where in the middle of the spectrum. We believe that this tradeoff can provide advantages in applications where size and/or time resources are concretely fixed in advance, as we can flexibly adjust d to match available resources and thus make the most of them. Such situations include, but are not limited to, implementations of ABE in tiny hardware tokens.

Original languageEnglish
Title of host publicationApplied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings
PublisherSpringer Verlag
Pages249-266
Number of pages18
Volume9696
ISBN (Print)9783319395548
DOIs
StatePublished - 2016
Event14th International Conference on Applied Cryptography and Network Security, ACNS 2016 - Guildford, United Kingdom

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9696
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other14th International Conference on Applied Cryptography and Network Security, ACNS 2016
CountryUnited Kingdom
CityGuildford
Period16/6/1916/6/22

Fingerprint

Cryptography
Computer hardware

Keywords

  • Attribute-based encryption
  • Efficiency tradeoff
  • Full security
  • Short ciphertext
  • Unbounded

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Attrapadung, N., Hanaoka, G., Matsumoto, T., Teruya, T., & Yamada, S. (2016). Attribute based encryption with direct efficiency tradeoff. In Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings. (Vol. 9696, pp. 249-266). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9696). Springer Verlag. DOI: 10.1007/978-3-319-39555-5_14

Attribute based encryption with direct efficiency tradeoff. / Attrapadung, Nuttapong; Hanaoka, Goichiro; Matsumoto, Tsutomu; Teruya, Tadanori; Yamada, Shota.

Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings. Vol. 9696 Springer Verlag, 2016. p. 249-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9696).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Attrapadung, N, Hanaoka, G, Matsumoto, T, Teruya, T & Yamada, S 2016, Attribute based encryption with direct efficiency tradeoff. in Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings. vol. 9696, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9696, Springer Verlag, pp. 249-266, 14th International Conference on Applied Cryptography and Network Security, ACNS 2016, Guildford, United Kingdom, 19-22 June. DOI: 10.1007/978-3-319-39555-5_14
Attrapadung N, Hanaoka G, Matsumoto T, Teruya T, Yamada S. Attribute based encryption with direct efficiency tradeoff. In Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings. Vol. 9696. Springer Verlag. 2016. p. 249-266. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Available from, DOI: 10.1007/978-3-319-39555-5_14

Attrapadung, Nuttapong; Hanaoka, Goichiro; Matsumoto, Tsutomu; Teruya, Tadanori; Yamada, Shota / Attribute based encryption with direct efficiency tradeoff.

Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings. Vol. 9696 Springer Verlag, 2016. p. 249-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9696).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

@inbook{9738cab60ad24fe4a5471d102e8a5910,
title = "Attribute based encryption with direct efficiency tradeoff",
keywords = "Attribute-based encryption, Efficiency tradeoff, Full security, Short ciphertext, Unbounded",
author = "Nuttapong Attrapadung and Goichiro Hanaoka and Tsutomu Matsumoto and Tadanori Teruya and Shota Yamada",
year = "2016",
doi = "10.1007/978-3-319-39555-5_14",
isbn = "9783319395548",
volume = "9696",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "249--266",
booktitle = "Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings",

}

TY - CHAP

T1 - Attribute based encryption with direct efficiency tradeoff

AU - Attrapadung,Nuttapong

AU - Hanaoka,Goichiro

AU - Matsumoto,Tsutomu

AU - Teruya,Tadanori

AU - Yamada,Shota

PY - 2016

Y1 - 2016

N2 - We propose the first fully secure unbounded Attribute-Based Encryption (ABE) scheme such that the key size and ciphertext size can be directly traded off. Our proposed scheme is parameterized by a positive integer d, which can be arbitrarily chosen at setup. In our scheme, the ciphertext size is O(t/d), the private key size is O(md), and the pub- lic key size is O(d), where t, m are the sizes of attribute sets and policies corresponding to ciphertext and private key, respectively. Our scheme can be considered as a generalization that includes two of the state-of-the-art ABE instantiations, namely, the unbounded ABE scheme and the ABE scheme with constant-size ciphertexts proposed by Attrapadung (Eurocrypt 2014). Indeed, these two schemes correspond to the two extreme cases of our scheme, that is, when setting d = 1 and when setting d as the maximum size of allowed attribute sets, respec- tively. Furthermore, our scheme also yields a tradeoff between encryp- tion and decryption time. Interestingly, when estimating efficiency using numerical parameters, the decryption time is minimized at d being some- where in the middle of the spectrum. We believe that this tradeoff can provide advantages in applications where size and/or time resources are concretely fixed in advance, as we can flexibly adjust d to match available resources and thus make the most of them. Such situations include, but are not limited to, implementations of ABE in tiny hardware tokens.

AB - We propose the first fully secure unbounded Attribute-Based Encryption (ABE) scheme such that the key size and ciphertext size can be directly traded off. Our proposed scheme is parameterized by a positive integer d, which can be arbitrarily chosen at setup. In our scheme, the ciphertext size is O(t/d), the private key size is O(md), and the pub- lic key size is O(d), where t, m are the sizes of attribute sets and policies corresponding to ciphertext and private key, respectively. Our scheme can be considered as a generalization that includes two of the state-of-the-art ABE instantiations, namely, the unbounded ABE scheme and the ABE scheme with constant-size ciphertexts proposed by Attrapadung (Eurocrypt 2014). Indeed, these two schemes correspond to the two extreme cases of our scheme, that is, when setting d = 1 and when setting d as the maximum size of allowed attribute sets, respec- tively. Furthermore, our scheme also yields a tradeoff between encryp- tion and decryption time. Interestingly, when estimating efficiency using numerical parameters, the decryption time is minimized at d being some- where in the middle of the spectrum. We believe that this tradeoff can provide advantages in applications where size and/or time resources are concretely fixed in advance, as we can flexibly adjust d to match available resources and thus make the most of them. Such situations include, but are not limited to, implementations of ABE in tiny hardware tokens.

KW - Attribute-based encryption

KW - Efficiency tradeoff

KW - Full security

KW - Short ciphertext

KW - Unbounded

UR - http://www.scopus.com/inward/record.url?scp=84977518823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84977518823&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-39555-5_14

DO - 10.1007/978-3-319-39555-5_14

M3 - Conference contribution

SN - 9783319395548

VL - 9696

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 249

EP - 266

BT - Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings

PB - Springer Verlag

ER -