Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes

L. Ibraimi, Qiang Tang, Pieter H. Hartel, Willem Jonker

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

84 Citations (Scopus)

Abstract

In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, the data is encrypted under an access policy defined by a user who encrypts the data and a user secret key is associated with a set of attributes which identify the user. A user can decrypt the ciphertext if and only if his attributes satisfy the access policy. In CP-ABE, since the user enforces the access policy at the encryption phase, the policy moves with the encrypted data. This is important for data storage servers where data confidentiality must be preserved even if the server is compromised or un-trusted. In this paper, we provide an efficient CP-ABE scheme which can express any access policy represented by a formula involving $\wedge$ and $\vee$ boolean operators. The scheme is secure under Decision Bilinear Diffie-Hellman assumption (DBDH). Furthermore, we extend the expressivity of the scheme by including \emph{of} (threshold) operator in addition to $\wedge$ and $\vee$ operators. We provide a comparison with existing CP-ABE schemes and show that our schemes are more efficient. Especially, the computational work done by the decryptor is reduced.
Original languageUndefined
Title of host publication5th Information Security Practice and Experience Conference (ISPEC)
Place of PublicationBerlin
PublisherSpringer
Pages1-12
Number of pages12
ISBN (Print)978-3-642-00842-9
DOIs
Publication statusPublished - 13 Apr 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume5451
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • SCS-Cybersecurity
  • IR-62793
  • METIS-263797
  • EWI-15256

Cite this

Ibraimi, L., Tang, Q., Hartel, P. H., & Jonker, W. (2009). Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. In 5th Information Security Practice and Experience Conference (ISPEC) (pp. 1-12). [10.1007/978-3-642-00843-6_1] (Lecture Notes in Computer Science; Vol. 5451). Berlin: Springer. https://doi.org/10.1007/978-3-642-00843-6_1
Ibraimi, L. ; Tang, Qiang ; Hartel, Pieter H. ; Jonker, Willem. / Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. 5th Information Security Practice and Experience Conference (ISPEC). Berlin : Springer, 2009. pp. 1-12 (Lecture Notes in Computer Science).
@inproceedings{ed5efcd59cb84ba9810c4bc3124a27bb,
title = "Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes",
abstract = "In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, the data is encrypted under an access policy defined by a user who encrypts the data and a user secret key is associated with a set of attributes which identify the user. A user can decrypt the ciphertext if and only if his attributes satisfy the access policy. In CP-ABE, since the user enforces the access policy at the encryption phase, the policy moves with the encrypted data. This is important for data storage servers where data confidentiality must be preserved even if the server is compromised or un-trusted. In this paper, we provide an efficient CP-ABE scheme which can express any access policy represented by a formula involving $\wedge$ and $\vee$ boolean operators. The scheme is secure under Decision Bilinear Diffie-Hellman assumption (DBDH). Furthermore, we extend the expressivity of the scheme by including \emph{of} (threshold) operator in addition to $\wedge$ and $\vee$ operators. We provide a comparison with existing CP-ABE schemes and show that our schemes are more efficient. Especially, the computational work done by the decryptor is reduced.",
keywords = "SCS-Cybersecurity, IR-62793, METIS-263797, EWI-15256",
author = "L. Ibraimi and Qiang Tang and Hartel, {Pieter H.} and Willem Jonker",
note = "10.1007/978-3-642-00843-6_1",
year = "2009",
month = "4",
day = "13",
doi = "10.1007/978-3-642-00843-6_1",
language = "Undefined",
isbn = "978-3-642-00842-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "1--12",
booktitle = "5th Information Security Practice and Experience Conference (ISPEC)",

}

Ibraimi, L, Tang, Q, Hartel, PH & Jonker, W 2009, Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. in 5th Information Security Practice and Experience Conference (ISPEC)., 10.1007/978-3-642-00843-6_1, Lecture Notes in Computer Science, vol. 5451, Springer, Berlin, pp. 1-12. https://doi.org/10.1007/978-3-642-00843-6_1

Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. / Ibraimi, L.; Tang, Qiang; Hartel, Pieter H.; Jonker, Willem.

5th Information Security Practice and Experience Conference (ISPEC). Berlin : Springer, 2009. p. 1-12 10.1007/978-3-642-00843-6_1 (Lecture Notes in Computer Science; Vol. 5451).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes

AU - Ibraimi, L.

AU - Tang, Qiang

AU - Hartel, Pieter H.

AU - Jonker, Willem

N1 - 10.1007/978-3-642-00843-6_1

PY - 2009/4/13

Y1 - 2009/4/13

N2 - In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, the data is encrypted under an access policy defined by a user who encrypts the data and a user secret key is associated with a set of attributes which identify the user. A user can decrypt the ciphertext if and only if his attributes satisfy the access policy. In CP-ABE, since the user enforces the access policy at the encryption phase, the policy moves with the encrypted data. This is important for data storage servers where data confidentiality must be preserved even if the server is compromised or un-trusted. In this paper, we provide an efficient CP-ABE scheme which can express any access policy represented by a formula involving $\wedge$ and $\vee$ boolean operators. The scheme is secure under Decision Bilinear Diffie-Hellman assumption (DBDH). Furthermore, we extend the expressivity of the scheme by including \emph{of} (threshold) operator in addition to $\wedge$ and $\vee$ operators. We provide a comparison with existing CP-ABE schemes and show that our schemes are more efficient. Especially, the computational work done by the decryptor is reduced.

AB - In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, the data is encrypted under an access policy defined by a user who encrypts the data and a user secret key is associated with a set of attributes which identify the user. A user can decrypt the ciphertext if and only if his attributes satisfy the access policy. In CP-ABE, since the user enforces the access policy at the encryption phase, the policy moves with the encrypted data. This is important for data storage servers where data confidentiality must be preserved even if the server is compromised or un-trusted. In this paper, we provide an efficient CP-ABE scheme which can express any access policy represented by a formula involving $\wedge$ and $\vee$ boolean operators. The scheme is secure under Decision Bilinear Diffie-Hellman assumption (DBDH). Furthermore, we extend the expressivity of the scheme by including \emph{of} (threshold) operator in addition to $\wedge$ and $\vee$ operators. We provide a comparison with existing CP-ABE schemes and show that our schemes are more efficient. Especially, the computational work done by the decryptor is reduced.

KW - SCS-Cybersecurity

KW - IR-62793

KW - METIS-263797

KW - EWI-15256

U2 - 10.1007/978-3-642-00843-6_1

DO - 10.1007/978-3-642-00843-6_1

M3 - Conference contribution

SN - 978-3-642-00842-9

T3 - Lecture Notes in Computer Science

SP - 1

EP - 12

BT - 5th Information Security Practice and Experience Conference (ISPEC)

PB - Springer

CY - Berlin

ER -

Ibraimi L, Tang Q, Hartel PH, Jonker W. Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. In 5th Information Security Practice and Experience Conference (ISPEC). Berlin: Springer. 2009. p. 1-12. 10.1007/978-3-642-00843-6_1. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-00843-6_1