Open Access

Provably secure attribute-based encryption with attribute revocation and grant function using proxy re-encryption and attribute key for updating

Contributed equally
Human-centric Computing and Information Sciences20155:8

https://doi.org/10.1186/s13673-015-0027-0

Received: 30 October 2013

Accepted: 6 March 2015

Published: 22 March 2015

Abstract

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is suitable for data access control on a cloud storage system. In CP-ABE, the data owner encrypts data under the access structure over attributes and a set of attributes assigned to users is embedded in user’s secret key. A user is able to decrypt if his attributes satisfy the ciphertext’s access structure. In CP-ABE, processes of user’s attribute revocation and grant are concentrated on the authority and the data owner. In this paper, we propose a ciphertext-policy attribute-based encryption scheme delegating attribute revocation processes to Cloud Server by proxy re-encryption. The proposed scheme does not require generations of new secret key when granting attributes to a user and supports any Linear Secret Sharing Schemes (LSSS) access structure. We prove that the proposed scheme is secure against attack by unauthorized users and Cloud Server.

Keywords

Cryptographic cloud storageCiphertext-policy attribute-based encryptionAttribute revocation and grantProxy re-encryption

Background

Sharing of data on a cloud storage has a risk of information leakage caused by service provider’s abuse. In order to protect data, the data owner encrypts data shared on the cloud storage so that only authorized users can decrypt.

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) [1,2] is suitable for data access control in the cloud storage system. The authority manages the attributes in the system. The data owner chooses an access structure and encrypts message under the access structure. The set of attributes assigned to users is embedded in his secret key. A user is able to decrypt a ciphertext if his attributes satisfy the ciphertext’s access structure.

There are user’s attribute revocation and grant in CP-ABE. In simple processes of user’s attribute revocation, when his attributes are revoked, the data owner re-encrypts the shared data so that revoked user cannot decrypt. Then, the authority redistributes new secret keys so that other users can decrypt. In simple processes of user’s attribute grant, the authority generates a new secret key. These simple processes are concentrated on the data owner and the authority.

Some attribute revocable CP-ABE schemes have been proposed [3-5]. Yu et al. [3] proposed a scheme combining CP-ABE with proxy re-encryption. The authority can delegate re-encryption and secret key update to proxy servers. However, this scheme has a limitation in access policy because it can only express “AND” policy. Hur et al. [4] proposed a scheme using key encryption keys (KEKs). A service provider distributes KEKs to each user. The service provider re-encrypts a ciphertext by an attribute group key. Then, he encrypts attribute group key by using KEKs so that authorized user can decrypt. As the number of system users has increases, the number of KEKs also increases and management becomes complicated. Liang et al. [5] proposed a scheme using user information (UI). UI is generated by Revocation Tree and Revocation List. An authorized user can decrypt ciphertexts by using secret key and UI. In this scheme, users whose attributes are revoked lose the access rights to all shared data by attribute revocation processes.

Moreover, in these schemes [3-5], the authority needs to generate a new key when granting attribute to users.

In this paper, we propose a CP-ABE scheme delegating attribute revocation processes to Cloud Server by proxy re-encryption and meets the following requirements.
  1. 1)

    Support any Linear Secret Sharing Schemes (LSSS) access structure. In existing schemes, there are following three expression methods of the access structure: tree, vector and matrix.

    The schemes using tree (for example the schemes of [1,4]) are not given the security proof under the standard model because they use hash functions for encryption.

    The schemes using vector whose elements are combined by AND condition are given the security proof under the standard model (for example the scheme of [3]) but they cannot perform flexible access control because only “AND” can be used for decryption conditions.

    By using matrix, for example a LSSS matrix, it is possible to use “AND” and “OR” for decryption conditions, that is, it is possible to perform a fine-grained access control and give the security proof under the standard model [2,5]. However, the revocation function is not shown in [2], and the scheme of [5] can revoke the only specified users but cannot revoke the only specified attributes.

     
  1. 2)

    Revoke the only specified attribute (attribute level user revocation). In the scheme of [5], users whose attributes are revoked lose the access rights to all shared data. To perform a fine-grained access control of shared data, it is desirable to revoke the only specified attributes. The schemes of [3,4] meet this requirement.

     
  2. 3)

    Does not require the generation of new secret key when granting attribute to user. In the way that the authority generates a new secret key and sends the key to a user every time it grants attributes to a user, the calculation amount of the authority is large in the case attributes are frequently granted. To avoid focusing the process of user’s attribute grant in the authority, we enable cloud servers to update user’s secret key. As far as we know, there is no scheme that meets this requirement.

     

We prove that the proposed scheme is secure under the standard model. We define attack model 1 as attack by unauthorized users and attack model 2 as attack by Cloud Server. We prove the proposed scheme is IND-CPA secure in the standard model against each attack model.

Methods

Preliminaries

Bilinear Maps

Let G 1, G 2 be two cyclic groups of prime order p. Let P be a generator of G 1. A bilinear map is a map e : G 1 × G 1 → G 2 with the following properties:
  1. 1)

    Bilinearity: for all P, QG 1 and a, bZ p , we have e(aP, bQ) → e(P, Q) ab .

     
  2. 2)

    Non-degeneracy: e(P, P) ≠ 1.

     
  3. 3)

    Computability: There is an efficient algorithm tocompute e(P, Q) for all P, QG 1.

     

Linear Secret Sharing Scheme (LSSS)

Definition 1 (Linear Secret Sharing Schemes (LSSS) [2,6]) A secret-sharing scheme Π over a set of parties \( \mathcal{P} \) is called linear (over Z p ) if
  1. 1)

    The shares for each party form a vector over Z p .

     
  2. 2)

    There exists a matrix an M with l rows and n columns called the share-generating matrix for Π. For all i = 1, …, l, te i’th row of M we let the function ρ defined the party labeling row i as ρ(i). When we consider the column vector v = (s, r 2, …, r n ), where sZ p is the secret to be shared, and r 2, …, r n Z p are randomly chosen, then Mv is the vector of l shares of the secret s according to Π. The share (Mv) i belongs to party ρ(i).

     

Suppose that Π is an LSSS for the access structure \( \mathbb{A} \). Let \( \mathrm{S}\in \mathbb{A} \) be any authorized set, and let I {1, 2, …, l}. Then, there exist constants {ω i Z p } iI such that, if {λ i } are valid shares of any secret s according to Π, then \( {\displaystyle \sum_{i\in I}}{\omega}_i{\lambda}_i=s \). Futhermore, there these constants {ω i } can be found in time polynomial in the size of the share-generating matrix M [6].

Decisional Parallel Bilinear Diffie-Hellman Exponent Assumption

Choose a group G 1 of prime order p according to the security parameter. Let a, s, b 1, …, b q Z p be chosen at random and PG 1 be a generator of G 1. If an adversary is given \( \overrightarrow{y}= \)
$$ P,sP,aP,\dots, {a}^qP,\kern0.75em ,{a}^{q+2}P,\dots, {a}^{2q}P $$
$$ {\forall}_{1\le j\le q}\ s\cdot {b}_jP,\left(a/{b}_j\right)P,\dots, \left({a}^q/{b}_j\right)P,\kern0.75em ,\left({a}^{q+2}/{b}_j\right)P,\dots, \left({a}^{2q}/{b}_j\right)P $$
$$ {\forall}_{1\le j,k\le q,k\ne j}\ \left(a\cdot s\cdot {b}_k/{b}_j\right)P,\dots, \left({a}^q\cdot s\cdot {b}_k/{b}_j\right)P $$

it must remain hard to distinguish \( e{\left(P,P\right)}^{a^{q+1}}\in {G}_2 \) from a random element in RG 2.

An algorithm \( \mathcal{A} \) that outputs z {0, 1} has advantage ϵ in solving decisional q-parallel BDHE in G 1 if
$$ \Big| \Pr \left[\mathcal{A}\left(\overrightarrow{y},T=e{\left(g,g\right)}^{a^{q+1}s}\right)=0\right] $$
$$ - \Pr \left[\mathcal{A}\left(\overrightarrow{y},T=R\right)=0\right]\Big|\ge \epsilon $$

We say that the (decision) q-parallel BDHE assumption holds if no polytime algorithm has a non-negligible advantage in solving the decisional q-parallel BDHE problem [2].

System Model and Definition

Model

There are four entities in the proposed scheme as follows.

User: The user downloads the shared data from Cloud Server.

Data owner: The data owner encrypts the shared data then uploads to Cloud Server.

Authority: The authority manages attributes in the system and publishes the parameters used for encryption. It generates a secret key that user’s attributes are embedded and PRE keys used for re-encryption and updating secret key. The authority is trusted party.

Cloud Server: Cloud Server stores shared data. It re-encrypts encrypted shared data and update secret key by using PRE keys received from the authority. Similar to previous schemes [3,4], we assume Cloud Server to be curious-but-honest. That is, it will honestly execute the tasks assigned by legitimate parties in the system. However, it would like to learn information of encrypted shared data as much as possible.

Algorithm Definition

Our proposed scheme is composed of 8 algorithms: Auth.Setup, DO.Enc, Auth.Ext, U.Dec, Auth.ReKeyGen, C.ReEnc, C.ReKey, C.AddAtt.

Auth.Setup: The setup algorithm takes as input the security parameter and attribute universe description. It outputs the public parameters PK, master secret key MSK and the keys for granting an attribute J.

DO.Enc: The Encryption algorithm takes as input the public parameters PK, an LSSS access structure \( \mathbb{A} \), and a message . It outputs a ciphertext CT.

Auth.Ext: The key extraction algorithm takes as input the master key MK, and a set of attributes S. It outputs a secret key SK and t ID .

U.Dec: The decryption algorithm takes as input a secret key SK for a set S and a ciphertext CT for an access structure \( \mathbb{A} \). If the set of attributes S satisfies the access structure \( \mathbb{A} \), it outputs a message .

Auth.ReKeyGen: The re-encryption key generation algorithm takes as input the master key MK and a set of attributes γ for update. It outputs the redefined master key MK′, the redefined public parameters PK′, and the PRE (Proxy Re-Encryption) keys rk.

C.ReEnc: The re-encryption algorithm takes as input an attribute y for update, the ciphertext component D i and a PRE key list RKL y . It outputs the re-encryption ciphertext component \( {D}_i^{\mathit{\hbox{'}}} \).

C.ReKey: The key regeneration algorithm takes as input an attribute w for update, the secret key component K w and the PRE key list RKL w . It outputs the updated secret key component \( {K}_w^{\hbox{'}} \).

C.GrantAtt: The attribute grant algorithm takes as input an attribute v, the key for granting an attribute J v , t ID and the PRE key list RKL v . It outputs secret key component K v and redefines the key for granting an attribute \( {J}_v^{\boldsymbol{\hbox{'}}} \).

Security Definition

We prove that unauthorized users and Cloud Server cannot decrypt ciphertext CT that was encrypted by the proposed scheme. Since we assume Cloud Server is honest, we do not consider active attacks from Cloud Server by colluding with unauthorized or revoked users. We define two attack models and security models as follows.

Attack Model 1

In this model, we assume an attack by unauthorized users. Security in this model is defined with the following game.
  • -Init. The adversary A submits the challenge access structure \( \mathbb{A} \) to the challenger C.

  • -Setup. The challenger C runs setup algorithm and gives the public parameters PK to the adversary A.

  • -Phase1. The adversary can issue following query.
    • Ext query : The adversary A submits a set of attributes S where S does not satisfy the access structure \( \mathbb{A} \) to the challenger. The challenger C gives secret key corresponding S.

    • Add query : The adversary A submits a set of attributes S′ where SS′ does not satisfy the challenge access structure \( \mathbb{A} \). The challenger C gives the secret key component K x corresponding to S′.

  • -Challenge. The adversary A submits two equal length messages M 0, M 1. The challenger flips a random coin b, and encrypts M b under \( \mathbb{A} \). The challenger gives ciphertext CT to the adversary A.

  • -Phase2. Phase1 is repeated.

  • -Guess. The adversary A outputs his guess b′ of b.

The advantage of an adversary A in this game is defined as \( \Pr \left[{b}^{\hbox{'}}=b\right]-\frac{1}{2} \).

Definition 2 A ciphertext-policy attribute-based encryption scheme is secure if all polynomial time adversaries have at most a negligible advantage in the above game.

Attack Model 2

In this model, we assume an attack by Cloud Server. Security in this model is defined with the following game.
  • -Init. The adversary A submits the challenge access structure \( \mathbb{A} \) and version number ver* to the challenger C.

  • -Setup. The challenger C runs setup algorithm and gives the public parameters PK and PRE key and the keys for granting an attribute J to the adversary A.

  • -Phase1. The adversary can issue following query.
    • K x query : The adversary A submits a set of attribute S. The challenger C gives secret key component K x corresponding to S to the adversary A.

  • -Challenge. The adversary A submits two equal length messages M 0, M 1. The challenger flips a random coin b, and encrypts M b under \( \mathbb{A} \). The challenger gives ciphertext CT to the adversary A.

  • -Phase2. Phase1 is repeated.

  • -Guess. The adversary A outputs his guess b′ of b.

Definition 3 A ciphertext-policy attribute-based encryption scheme is secure if all polynomial time adversaries have at most a negligible advantage in the above game.

Our Scheme

Overview

The proposed scheme is based on Waters’s scheme of CP-ABE [2]. Water’s scheme supports any LSSS access structure. We apply the idea of attribute revocation shown in [3] to the proposed scheme. In the proposed scheme, the attribute key is included in the ciphertext and secret key to delegate attribute revocation processes to Cloud Server. The attribute key is master key components corresponding to each attribute in the system. When user’s attributes are revoked, the authority re-defines the attribute keys, and generates PRE keys for updating the attribute keys. Cloud Server re-encrypts ciphertext and updates secret key by updating attribute key by using PRE key. Each attribute is associated with version number for updating attribute key.

Cloud Server keeps user list UL, re-encryption key list RKL and the key for granting an attribute to secret key J. UL records user’s ID, user’s attribute information, secret key components, t ID . t ID is a random number that randomize each secret key to prevent users’ collusion attack. t ID should “bind” components of one user's key together so that they cannot be combined with another user's key components[2]. RKL records update history of attribute (version number) and PRE keys.

When granting attributes to users, Cloud Server generates user’s secret key components correspond to granting attribute from t ID and J, and sends secret key component to the user. The user joins secret key component to own secret key. Thus, it is possible to grant attributes to users without generation of new secret key by the authority.

Algorithm

Auth.Setup(U) The setup algorithm takes as input the number of system attributes U. It first chooses a group G 1 of prime order p, a generator PG 1. It then chooses random group elements Q 1, …, Q U G 1 that are associated with the U attributes in the system. In addition, it chooses two random α, aZ p , and random Att 1, …, Att U Z p as the attribute key.

The public parameters are
$$ PK:=\kern0.5em <P,e{\left(P,P\right)}^{\alpha },aP,{Q}_1,\dots, {Q}_U,{T}_1=At{t}_1P,\dots, {T}_U> $$

The master key is MK : = < α, Att 1, …, Att U  >.

The keys for granting an attribute are J : = < {x, J x  = 1/Att x }1 ≤ x ≤ U  >.

DO.Enc (PK, (M, ρ), ) The Encryption algorithm takes as input the public parameters PK, an LSSS access structure (M, ρ), and a message . The function ρ associates rows of M to attributes. Let M be an l × n matrix. It first chooses a random vector \( \overrightarrow{v}=\left(s,{y}_2,\dots, {y}_n\right)\in {Z}_p \). For i = 1 to l, it computes \( {\lambda}_i:=\overrightarrow{v}\cdot {M}_i \). It then chooses random r 1, …, r l Z p and outputs the ciphertext
$$ CT: = <C,{C}^{\hbox{'}},\left({C}_1,{D}_1\right),\dots, \left({C}_l,{D}_l\right)>= $$
$$ <Ke{\left(P,P\right)}^{\alpha s},sP,\left({\lambda}_1(aP)-{r}_1{Q}_{\rho (1)},{r}_1{T}_{\rho (1)}\right),\dots, \left({\lambda}_l(aP)-{r}_l{Q}_{\rho (l)},{r}_l{T}_{\rho (l)}\right)> $$

with (M, ρ).

Auth.Ext (MK, S) The key extraction algorithm takes as input the master key MK, and a set of attributes S. It first chooses a random t ID Z p . It then outputs t ID and the secret key
$$ SK:=<K,L,\forall x\in S\ {K}_x>= $$
$$ <\alpha P+{t}_{ID}(aP),{t}_{ID}P,\forall x\in S\ \left({t}_{ID}/At{t}_x\right){Q}_x>. $$

U.Dec (SK, CT) The decryption algorithm takes as input a secret key SK for a set S and a ciphertext CT for access structure (M, ρ). Suppose that S satisfies the access structure and let I be defined as I = {i : ρ(i) S}. Then, let {ω i Z p } iI be as set of consistants such that if {λ i } are valid shares of the secret s according to M, then \( {\displaystyle \sum_{i\in I}}{\omega}_i{\lambda}_i=s \).

The decryption algorithm first computes
$$ \frac{e\left({C}^{\hbox{'}},K\right)}{{\displaystyle {\prod}_{i\in I}}{\left(e\left({C}_i,L\right)e\left({D}_i,{K}_{\rho (i)}\right)\right)}^{\omega_i}} = $$
$$ \frac{e{\left(P,P\right)}^{\alpha s}e{\left(P,P\right)}^{as{t}_{ID}}}{{\displaystyle {\prod}_{i\in I}}\left(e{\left(P,P\right)}^{ta{\lambda}_i{\omega}_i}\right)} = e{\left(P,P\right)}^{\alpha s}. $$

It can then decrypt the message  = C/e(P, P) αs .

Auth.ReKeyGen(MK, γ) The re-encryption key generation algorithm takes as input the master key MK and a set of attributes γ for update. For each xγ, it chooses random \( At{t}_x^{\mathit{\hbox{'}}}\in {Z}_p \) as the new attribute key, and computes \( {T}_x^{\hbox{'}}:=At{t}_x^{\hbox{'}}P \), \( r{k}_{x\to {x}^{\boldsymbol{\hbox{'}}}}:=\frac{At{t}_{\boldsymbol{x}}^{\boldsymbol{\hbox{'}}}}{At{t}_{\boldsymbol{x}}} \). It then replaces each Att x of the master key component with \( At{t}_x^{\boldsymbol{\hbox{'}}} \), and each T x of public parameter with \( {T}_x^{\boldsymbol{\hbox{'}}} \). It outputs the redefined the master key MK ', the redefined public parameters PK ', and the PRE keys rk := {x, rk x } xγ .

C.ReEnc( y(=ρ(i)), D i , RKL y ) The re-encryption algorithm takes as input an attribute y(=ρ(i)) for update, the ciphertext component D i and a PRE key list RKL y . It first checks version of attribute y. If y has the latest version, it outputs and exit. Let \( At{t}_{y^{(n)}} \) be defined as an attribute key of the latest version of attribute y. It computes \( r{k}_{y\leftrightarrow {y}^{(n)}}:=r{k}_{y\leftrightarrow {y}^{\hbox{'}}}\cdot r{k}_{y^{\hbox{'}}\leftrightarrow {y}^{\hbox{'}\hbox{'}}}\cdot \cdot \cdot r{k}_{y^{\left(n-1\right)}\leftrightarrow {y}^{(n)}}=At{t}_{y^{(n)}}/At{t}_y \). Then, it outputs the re-encrypted ciphertext component \( {D}_{\boldsymbol{i}}^{\boldsymbol{\hbox{'}}}:=r{k}_{y\leftrightarrow {y}^{(n)}}\cdot {D}_i=\left(At{t}_{y^{(n)}}/At{t}_y\right) \) \( \cdot {r}_iAt{t}_yP={r}_iAt{t}_{y^{(n)}}P \) .

C.ReKey (w, K w,ID , RKL w ) The key regeneration algorithm takes as input an attribute w for update, the secret key component K w and the PRE key list RKL w . It first checks version of attribute w. If w has the latest version, it outputs and exit. Let \( At{t}_{w^{(n)}} \) be defined as the attribute key for the latest version of attribute w. It computes \( r{k}_{w\leftrightarrow {w}^{(n)}}:=r{k}_{w\leftrightarrow {w}^{\hbox{'}}}\cdot r{k}_{w^{\hbox{'}}\leftrightarrow {w}^{\hbox{'}\hbox{'}}}\cdot \cdot \cdot r{k}_{w^{\left(n-1\right)}\leftrightarrow {w}^{(n)}}=At{t}_{w^{(n)}}/At{t}_w \). It then outputs the updated secret key component \( {K}_w^{\hbox{'}}:=r{k}_{w\leftrightarrow {w}^{(n)}}^{-1}\cdot {K}_w=\left(At{t}_w/At{t}_{w^{(n)}}\right)\cdot \left({\boldsymbol{t}}_{\boldsymbol{ID}}/At{t}_w\right){Q}_w=\left({\boldsymbol{t}}_{\boldsymbol{ID}}/At{t}_{w^{(n)}}\right){Q}_w \).

C.GrantAtt (v, J v , t ID , RKL v ) The attribute grant algorithm takes as input an attribute v, the key for granting an attribute J v , t ID and the PRE key list RKL v . It first checks version of attribute v. Let \( At{t}_{v^{(n)}} \) be defined as the attribute key for the latest version of attribute v. It first computes \( r{k}_{v\leftrightarrow {v}^{(n)}}:=r{k}_{v\leftrightarrow {v}^{\hbox{'}}}\cdot r{k}_{v^{\hbox{'}}\leftrightarrow {v}^{\hbox{'}\hbox{'}}}\cdot \cdot \cdot r{k}_{v^{\left(n-1\right)}\leftrightarrow {v}^{(n)}}=At{t}_{v^{(n)}}/At{t}_v \). It then outputs secret key component for \( {K}_v:={t}_{\boldsymbol{ID}}\cdot r{k}_{v\leftrightarrow {v}^{(n)}}^{-1}\cdot {J}_v= \) \( {t}_{ID}\cdot \left(At{t}_v/At{t}_{v^{(n)}}\right)\cdot \left(1/At{t}_v\right){Q}_v=\left({t}_{ID}/At{t}_{v^{(n)}}\right){Q}_v \) and redefines the key for granting an attribute \( {J}_{\boldsymbol{v}}^{\boldsymbol{\hbox{'}}}:=r{k}_{v\leftrightarrow {v}^{(n)}}^{-1}\cdot {J}_v=\left(1/At{t}_{v^{(n)}}\right){Q}_v \).

We show the flow of our scheme in Fig 1. In Fig 1, γ denotes a set of user u’s attributes which are revoked and β denotes a set of attributes that granting to user u.
Figure 1

Flow of the proposed scheme.

Security Proof

We prove that unauthorized users and Cloud Server cannot decrypt ciphertext CT that was encrypted by using the proposed scheme.

Security Proof in the Attack Model 1

Theorem 1 Suppose the decisional q-parallel BDHE assumption holds and a challenge matrix of size is l* × n* where l* × n* ≤ q, our scheme is IND-CPA secure in the attack model 1.

Proof Suppose we have adversary A with non-negligible advantage ϵ against our scheme in the attack model 1. Moreover, suppose it chooses a challenge matrix M* where both dimensions are at most q. We show how to build a simulator, B, that plays the decisional q-parallel BDHE problem.

Init. The simulator takes in a q-parallel BDHE challenge \( \overrightarrow{y},T \). The adversary gives the simulator B the challenge access structure (M*, ρ*), where M* has n* columns.

Setup. The simulator B generates the public parameter PK as follows. The simulator B chooses random α′ Z p and implicitly sets α = α′ + a q + 1 by letting \( e{\left(P,P\right)}^{\alpha }=e\left(aP,{a}^qP\right)e{\left(P,P\right)}^{\alpha^{\hbox{'}}} \). It outputs public parameter Q 1, …, Q U as follows.
  1. 1.

    For each x for 1 ≤ x ≤ U begin by choosing a random value z x

     
  2. 2.

    Let X denote the set of indices i, such that ρ*(i) = x.

     
  3. 3.

    The simulator B computes \( {Q}_x={z}_xP+{\displaystyle {\sum}_{i\in X}}\left\{\left({a}^2{M}_{i,1}^{*}/{b}_i\right)P+\left({a}^2{M}_{i,2}^{*}/{b}_i\right)P+\cdot \cdot \cdot +\left({a}^{n^{*}}{M}_{i,{n}^{*}}^{*}/{b}_i\right)P\right\} \)

     

Note that if X =  then we have \( {Q}_x={g}^{z_x} \). Also note that the parameters are distributed randomly due to \( {g}^{z_x} \). The simulator B randomly chooses attribute keys t x Z p for 1 ≤ x ≤ U and computes public parameters Τ x  = t x P. It gives the adversary A the public parameters PK := (P, e(P, P) α , aP, Q 1, …, Q U , T 1, …, T U ).

Phase1. The adversary A issues following queries:

Ext query : The adversary A submits a set of attributes S where S does not satisfy the access structure M* to the challenger. The simulator first chooses a random rZ p . Then it finds a vector \( \overrightarrow{w}=\left({w}_1,\dots, {w}_{n^{*}}\right)\in {Z}_p^{n^{*}} \) such that w 1 = − 1 and for all i where ρ(i) S ' we have that \( \overrightarrow{w}\cdot {M}_i^{*}=0 \). The simulator B begins by implicitly defining t ID as
$$ r+{w}_1{a}^q+{w}_2{a}^{q-1}+\cdots +{w}_{n^{*}}{a}^{q-{n}^{*}+1} $$
It performs this by setting \( L=rP+{\displaystyle {\sum}_{i=2,\dots, {n}^{*}}}{w}_i\left({a}^{q+1-i}P\right) \) = t ID P. The simulator can compute K as
$$ {\alpha}^{\hbox{'}}P+arP+\kern1em {\displaystyle \sum_{i=2,\dots, {n}^{*}}}{w}_i\left({a}^{q+2-i}P\right) $$

The simulator B computes K x   x S as follows.

Case 1. If there is no i such that ρ*(i) = x, it computes K x  = (1/t x ) z x L.

Case 2. If there is i such that ρ*(i) = x.
  1. 1)

    Let X be the set of all i such that ρ*(i) = x.

     
  2. 2)
    It computes K x as
    $$ {z}_xL+{\displaystyle \sum_{i\in X}}{\displaystyle \sum_{j=1,\dots, {n}^{*}}}{M}_{i,j}^{*}\left[\left({a}^j/{b}_i\right)rP+{\displaystyle \sum_{\begin{array}{c}\hfill k=1,\dots, {n}^{*}\hfill \\ {}\hfill k\ne j\hfill \end{array}}}{w}_k\left\{\left({a}^{q+1+j-k}/{b}^i\right)P\right\}\right] $$
     
  3. 3)

    It calculates \( {K}_x=\left(1/{t}_x\right){K}_x^{\hbox{'}} \).

     

It gives the adversary A secret key SK := (K, L, xS K x ).

Add query : The adversary A submits a set of attributes S′ where SS′ does not satisfy the challenge access structure M*.The simulator B computes K x   x S′ as follows.

Case1. If there is no i such that ρ*(i) = x, it computes K x  = (1/t x ) z x L.

Case2. If there is i such that ρ*(i) = x.
  1. 1)

    Let X be the set of all i such that ρ*(i) = x.

     
  2. 2)
    It computes \( {K}_x^{\hbox{'}} \) as
    $$ {z}_xL+{\displaystyle \sum_{i\in X}}{\displaystyle \sum_{j=1,\dots, {n}^{*}}}{M}_{i,j}^{*}\left[\left({a}^j/{b}_i\right)rP+{\displaystyle \sum_{\begin{array}{c}\hfill k=1,\dots, {n}^{*}\hfill \\ {}\hfill k\ne j\hfill \end{array}}}{w}_k\left\{\left({a}^{q+1+j-k}/{b}^i\right)P\right\}\right] $$
     
  3. 3)

    It calculates \( {K}_x=\left(1/{t}_x\right){K}_x^{\hbox{'}} \).

     

It gives the adversary A the secret key component \( {\left\{{K}_x\right\}}_{\forall x\in {S}^{\hbox{'}}} \).

Challenge. The adversary A submits two equal length messages 0, 1. The simulator B flips a random coin b {0, 1}. It computes C =  b Te(sP, α ' P), C = sP. It choose random \( {y}_2^{\hbox{'}},\dots, {y}_{n^{*}}^{\hbox{'}}\in {Z}_p \) and the share the secret using the vector \( \overrightarrow{v}=\left(s,sa+{y}_2^{\hbox{'}},s{a}^2+{y}_3^{\hbox{'}},\dots, s{a}^{n-1}+{y}_{n^{*}}^{\hbox{'}}\right)\in {Z}_p^{n^{*}} \). In addition, it choose random values \( {r}_1^{\hbox{'}},\dots, {r}_l^{\hbox{'}}\in {Z}_p \).

For i = 1, …, n*, we define R i as the set of all k ≠ i such that ρ*(i) = ρ*(k). The challenge ciphertext components are then generated as
$$ {D}_i=-{r}_i^{\hbox{'}}{T}_{\rho^{*}(i)}-s{b}_i{T}_{\rho^{*}(i)} $$
$$ {C}_i={h}_{\rho^{*}(i)}^{r_i^{\hbox{'}}}+\left\{{\displaystyle \sum_{j=2,\dots, {n}^{*}}}{M}_{i,j}^{*}{y}_j^{\hbox{'}}(aP)\right\}-{z}_{\rho (i)}\left({b}_i\cdot s\right)P+\left\{{\displaystyle \sum_{k\in {R}_i}}{\displaystyle \sum_{j=1,\dots, {n}^{*}}}{M}_{k,j}^{*}\left({a}^j\cdot s\cdot \left({b}_i/{b}_k\right)P\right)\right\} $$

It gives the adversary A the challenge ciphertext \( C{T}^{*}=\left(C,{C}^{\hbox{'}},\left({C}_1,{D}_1\right),\dots, \left({C}_{l^{*}},{D}_{l^{*}}\right)\right) \).

Phase2. Phase 1 is repeated.

Guess. The adversary A will eventually output a guess b′. of b. The simulator then outputs 0 to guess that \( T=e{\left(P,P\right)}^{a^{q+1}s} \) if b′. = b; otherwise, it outputs 1 to indicate that it believes T is a random group element RG 2.

When T is a tuple the simulator B gives a perfect simulation so we have that
$$ \Pr =\left[\mathrm{B}\left(\overrightarrow{y},T=e{\left(P,P\right)}^{a^{q+1}s}\right)=0\right]=\frac{1}{2}+\epsilon $$

When T is a random group element the message b is completely hidden from the adversary and we have \( \Pr =\left[\mathrm{B}\left(\overrightarrow{y},T=R\right)=0\right]=\frac{1}{2} \). Therefore, the simulator B can play the decisional q-parallel BDHE game with non-negligible advantage.

Security Proof in the Attack Model 2

Theorem 2 Suppose Waters’s scheme [2] is IND-CPA secure, our scheme is also IND-CPA secure in the attack model 2.

Proof Suppose we have adversary A with non-negligible advantage ϵ against our scheme in the attack model 2. Moreover, suppose it chooses a challenge matrix M* where both dimensions are at most q. We prove there is an simulator B which has advantage at least ϵ against Waters’s scheme simulator (Given input, it responds according to algorithms of the Waters’s scheme).

Init. The adversary A submits the challenge access structure (M*, ρ*) where M* has n* columns and version number ver* to the simulator B. The simulator B submits the challenge access structure (M*, ρ*) to the Waters’s scheme simulator.

Setup. The simulator B receives public parameters PK ' := (P, e(P, P) α , aP, Q 1, …, Q U ) from the Waters’s scheme simulator. It randomly chooses attribute keys t x Z p for 1 ≤ x ≤ U and computes public parameters Τ x  = t x P. It computes the key for granting an attribute J := {(1/t 1)Q 1, …, (1/t U )Q U }. Then, the simulator B computes PRE keys and public parameters T x for each version as follows. For x (1 ≤ x ≤ U), for 1 ≤ k ≤ ver* − 1, the simulator B randomly chooses PRE keys \( r{k}_{x^{(k)}\to {x}^{\left(k+1\right)}}\in {Z}_p \) and computes public parameters \( {T}_{x^{\left(k+1\right)}}=r{k}_{x^{(k)}\leftrightarrow {x}^{\left(k+1\right)}}{T}_{x^{(k)}} \). (k + 1) and (k) denote the version number of PRE keys and public parameter. The simulator B gives the adversary A the public parameter PK := (P, e(P, P) α , aP, Q 1, …, Q U , T 1, …, T U ), the key for granting an attribute J and all PRE keys.

Phase1. The adversary A issues following queries:

K x query : The adversary A submits a set of attributes S for version k, 1 ≤ k ≤ ver* − 1. we denote \( {V}_{x^{(k)}}={\displaystyle \prod_{i=2}^k}r{k}_{x^{\left(i-1\right)}\leftrightarrow {x}^{(i)}} \). The simulator B randomly chooses t ID Z p and computes \( \forall x\in S\ {K}_x=\left({t}_{ID}/{t}_x \cdot {V}_{x^{(k)}}\right){Q}_x \). It gives the adversary A the secret key components {K x }xS .

Challenge. The adversary A submits two equal length messages 0, 1, then the simulator B submits them to the Waters’s simulator. The Waters’s simulator flips a random coin b {0, 1} and computes ciphertest CT′ := (C, C′, (C 1, D 1), …, (C l , D l )) ← Enc(PK, (M*, ρ*),  b ). The simulator B receives the ciphertext CT ', then it computes \( CT:=\Big(C,{C}^{\hbox{'}},\left({C}_1,{V}_{\rho {(1)}^{\left(ve{r}^{*}\right)}}{D}_1\right),\dots, \left({C}_l,{V}_{\rho {(l)}^{\left(ve{r}^{*}\right)}}{D}_l\right) \) from the ciphertext CT′. It gives the adversary A the cipertext CT.

Phase2. Phase 1 is repeated.

Guess. The adversary A outputs will eventually output a guess b′ of b. The simulator B outputs b′ as its guess.

The simulation above shows there is a simulator B that has advantage at least ϵ ageinst Waters’s scheme simulator if there is an adversary A that has advantage ϵ against our scheme.

Result and discussion

In Table 1, we give two comparisons of the proposed scheme with the schemes of [3,4] that can revoke the only specified attributes. The first comparison is in terms of the size of the public key (PK), the secret key (SK), the ciphertext (CT), and the re-encryption key (RK). The second comparison is in terms of the computation amount of encryption (Enc), secret key generation (Ext), re-encryption (Re-enc), decryption (Dec), and secret key update (Re-key). As to the size of the public key, the scheme of [4] has the smallest one, followed by the proposed scheme. As for the size of the secret key, the proposed scheme has the smallest one. Both the proposed scheme and the scheme of [4] have equally the smallest size ciphertexts. As to the size of the re-encryption key, if there are users more than the number of attributes, both the proposed scheme and the scheme of [3] have the equally smallest one.
Table 1

Key Size, Ciphertext Size and Computation Amount

 

Yu etal’s scheme [ 3 ]

Hur et al’s scheme [ 4 ]

The proposed scheme

PK

\( \begin{array}{l}\left(3\left|U\right|+1\right)\\ {}\times \left|G\right|+\left|{G}_T\right|\end{array} \)

2 × |G| + |G T |

\( \begin{array}{l}\left(2\left|U\right|+2\right)\\ {}\times \left|G\right|+\left|{G}_T\right|\end{array} \)

SK

(2|U| + 1) × |G|

\( \begin{array}{l}\left(2\left|S\right|\kern0.5em +1\right)\times \left|G\right|\\ {}+ \log \kern0.5em \left|N\right|\times \left|K\right|\end{array} \)

(|S| + 2) × |G|

CT

\( \begin{array}{l}\left(\left|U\right|+1\right)\\ {}+\left|G\right|+\left|{G}_T\right|\end{array} \)

\( \begin{array}{l}\left(2\left|I\right|+1\right)\\ {}\times \left|G\right|+\left|{G}_T\right|\end{array} \)

\( \begin{array}{l}\left(2\left|I\right|+1\right)\\ {}\times \left|G\right|+\left|{G}_T\right|\end{array} \)

RK

r|U| × |Z p |

(2|N| − 1) × |K|

r|U| × |X p |

Enc

(|U| + 2) × exp

(2|I| + 2) × exp

(2|I| + 2) × exp

Ext

(2|U| + 1) × exp

(2|S| + 2) × exp

(|S| + 2) × exp

Re-enc

|R CT | × exp

|R CT | × exp

|R CT | × exp

Re-key

|R SK | × exp

|R SK | × exp

|R SK | × exp

Dec

\( \begin{array}{l}\left(\left|U\right|+1\right)\times \widehat{e}\\ {}+\left(\left|U\right|1\right)\kern0.5em \times \kern0.5em exp\end{array} \)

\( \begin{array}{l}\left(2\left|R\right|+1\right)\times \widehat{e}\\ {}+\left(2\left|R\right|+2\right)\times exp\end{array} \)

\( \begin{array}{l}\left(2\left|R\right|+1\right)\times \kern0.5em \widehat{e}\\ {}+\left(2\left|R\right|+2\right)\times \kern0.5em exp\end{array} \)

Exp:ex ponentiation in G, ê: bilinear pairing,

|U|: the number of attributes defined in the system,

|S|: the number of attributes in user’s key,

|R| the number of user’s attributes satisfying an acces structure,

r: the number of times the attribute revocation event occurs,

|R SK |: the number of updated attributes (secret key),

|R CT |: the numbet of updated attributes (ciphertext), |N|: the number of total user,

|I|: the number of attributes am acces structure, |K|: size of the common key.

As for the computation amount of encryption and decryption, the proposed scheme and the scheme of [4] have the equally smallest. As to the computation amount of secret key generation, the proposed scheme has the smallest. Finally, as to the computation amount of re-encryption and secret key update, all schemes have the same.

The differences, in terms of the requirements in Section I, between the proposed scheme and the schemes of [3-5] are summarized as shown in Table 2.
Table 2

Comparison of Schemes

 

Yu etal’s scheme [ 3 ]

Hur et al’s scheme [ 4 ]

Liang et al’s scheme [ 5 ]

The proposed scheme

Suporting acces policy type

‘AND’

‘AND’, ‘OR’

Any LSSS

Any LSSS

Attibute level user revoction

Possible

Possible

Impossible

Possible

Grant attributes to users

The authority generates a new secret key

The authority generates a new secret key

The authority generates a new secret key

Cloud server adds attributes to user’s secret key

Conclusion

This paper proposed a ciphertext-policy attribute-based encryption scheme delegating attribute revocation processes to Cloud Server by proxy re-encryption. Cloud Server re-encrypts a ciphertext and updates a secret key by updating attribute key with PRE key for updating the attribute keys.

The proposed scheme meets three requirements as follows; First, the proposed scheme supports any LSSS access structure. Second, the authority can only revoke specified attribute by updating attribute key included in ciphertext corresponding to his attributes which are revoked. Finally, when granting attributes to a user, generation of a new secret key becomes unnecessary because Cloud Server generates secret key components corresponding to granting attributes.

The proposed scheme is secure against attack by unauthorized users and Cloud Server. Our future direction is to implement the proposed scheme and confirm its feasibility.

Notes

Declarations

Authors’ Affiliations

(1)
Nagoya Institute of Technology
(2)
Gifu University
(3)
Kobe University

References

  1. Bethencourt J, Sahai A, Waters B (2007) Ciphertext-policy attribute-based encryption. In: Paper presented at the 2007 IEEE Symposium on Security and Privacy, Oakland., 20–23 May 2007Google Scholar
  2. Waters B (2011) Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. In: Paper presented at the 14th International Conference on Practice and Theory in Public Key Cryptography, Taormina., 6–9 March 2011Google Scholar
  3. Yu S, Wang C, Ren K, Lou W (2010) Attribute based data sharing with attribute revocation. In: Paper presented at the 5th ACM Symposium on Information. Computer and Communications Security, Beijing, 13 April 2010Google Scholar
  4. Hur J, Nor D.K (2011) Attribute-based access control with efficient revocation in data outsourcing systems. doi:10.1109/TPDS.2010.203.Google Scholar
  5. Liang X, Lu R, Lin X, Shen X (2011) Ciphertext policy attribute based encryption with efficient revocation. http://bbcr.uwaterloo.ca/~x27liang/papers/abe%20with%20revocation.pdf.
  6. Beimei A (1996) Secure schemes for secret sharing and key distribution. Dissertation, Israel Institute of Technology. Google Scholar

Copyright

© Naruse et al.; licensee Springer. 2015

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.