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

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

Research output: Book/ReportReportProfessional

250 Downloads (Pure)

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
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages18
Publication statusPublished - 26 Nov 2008

Publication series

NameCTIT Technical Report Series
PublisherCentre for Telematics and Information Technology, University of Twente
No.412/TR-CTIT-08-75
ISSN (Print)1381-3625

Keywords

  • IR-65286
  • METIS-255442
  • SCS-Cybersecurity
  • EWI-14854

Cite this

Ibraimi, L., Tang, Q., Hartel, P. H., & Jonker, W. (2008). Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. (CTIT Technical Report Series; No. 412/TR-CTIT-08-75). Enschede: Centre for Telematics and Information Technology (CTIT).
Ibraimi, L. ; Tang, Qiang ; Hartel, Pieter H. ; Jonker, Willem. / Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. Enschede : Centre for Telematics and Information Technology (CTIT), 2008. 18 p. (CTIT Technical Report Series; 412/TR-CTIT-08-75).
@book{048bd5d42ddf43e498be4aa3bb034ffc,
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 = "IR-65286, METIS-255442, SCS-Cybersecurity, EWI-14854",
author = "L. Ibraimi and Qiang Tang and Hartel, {Pieter H.} and Willem Jonker",
year = "2008",
month = "11",
day = "26",
language = "Undefined",
series = "CTIT Technical Report Series",
publisher = "Centre for Telematics and Information Technology (CTIT)",
number = "412/TR-CTIT-08-75",
address = "Netherlands",

}

Ibraimi, L, Tang, Q, Hartel, PH & Jonker, W 2008, Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. CTIT Technical Report Series, no. 412/TR-CTIT-08-75, Centre for Telematics and Information Technology (CTIT), Enschede.

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

Enschede : Centre for Telematics and Information Technology (CTIT), 2008. 18 p. (CTIT Technical Report Series; No. 412/TR-CTIT-08-75).

Research output: Book/ReportReportProfessional

TY - BOOK

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

AU - Ibraimi, L.

AU - Tang, Qiang

AU - Hartel, Pieter H.

AU - Jonker, Willem

PY - 2008/11/26

Y1 - 2008/11/26

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 - IR-65286

KW - METIS-255442

KW - SCS-Cybersecurity

KW - EWI-14854

M3 - Report

T3 - CTIT Technical Report Series

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

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -

Ibraimi L, Tang Q, Hartel PH, Jonker W. Efficient and Provable Secure Ciphertext-Policy Attribute-Based Encryption Schemes. Enschede: Centre for Telematics and Information Technology (CTIT), 2008. 18 p. (CTIT Technical Report Series; 412/TR-CTIT-08-75).