Identity-Based Encryption with Cloud Revocation Authority and Its Applications

Tseng, Yuh‐Min; Tsai, Tung-Tso; Huang, Sen–Shan; Huang, Chung-Peng

doi:10.1109/tcc.2016.2541138

Cited by 32 publications

(34 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We remark that in our scheme, only operations of scalar multiplication in G and exponentiation in G T are involved in the encryption process, and there is no time-consuming operation such as bilinear pairings or map-to-hash operations. We also observe that in Li et al, 27 the encryption process is significantly faster than the decryption process, while in Tseng et al, 28 the result is just the opposite. In our scheme, however, the performance of encryption and decryption is approximately equal and encryption is slightly faster than decryption.…”

Section: Performance Evaluationmentioning

confidence: 52%

“…The computation costs of a single identity key generation and time key update are similar since the operations in these 2 procedures are almost identical in each scheme, respectively. For identity key generation or time key update process, Li et al scheme 27 requires 3TG m + T e (6.834 ms), and Tseng et al scheme 28 requires TG H + TG m (7.865 ms), while our scheme requires only T m (2.165 ms). Schemes in Li et al 27 (123.544 ms).…”

Section: Performance Evaluationmentioning

confidence: 94%

“…Seeking to improve the performance and scalability of Li et al scheme, Tseng et al suggested that the cloud revocation authority (CRA) holds only one system secret for all system users. The system secret is generated by the KGC and sent to the CRA in a secure way.…”

Section: Related Work and Our Contributionsmentioning

confidence: 99%

“…We present the formal security notions for revocable IBE with CRS, based on definitions outlined in Li et al and Tseng et al before demonstrating that the proposed scheme is IND‐ID‐CCA secure under the k ‐collision attack algorithm ( k − C A A ) assumption. We claim that our scheme can also resist decryption key exposure attack since in the security proof, the adversary is not constrained to obtain time keys for the target identity I D ∗ and any time period T with T ≠ T ∗ .…”

Section: Related Work and Our Contributionsmentioning

confidence: 99%

“…In this section, we evaluate the performance of the proposed scheme, as well as the schemes in Li et al and Tseng et al To ensure a fair comparison with an appropriate security level (equivalent of the security level of a 1024‐bit R S A algorithm), we used the Ate pairing

ê : G \times G \to G_{T}

generated by a point on a super singular elliptic curve over a finite field E ( F p ), where p and q are large prime numbers with a length of 512 and 160 bits, respectively. The notations used to describe the computation and communication costs are listed as follows.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 4 more Smart Citations

Efficient revocable ID‐based encryption with cloud revocation server

Jia

Kumar

Choo

et al. 2017

Int J Communication

View full text Add to dashboard Cite

SummaryThe capability to efficiently revoke compromised/misbehaving users is important in identity-based encryption (IBE) applications, as it is not a matter of if but of when that one or more users are compromised. Existing solutions generally require a trusted third party to update the private keys of nonrevoked users periodically, which impact on scalability and result in high computation and communication overheads at the key generation center. Li et al proposed a revocable IBE scheme, which outsources most of the computation and communication overheads to a Key Update Cloud Service Provider (KU-CSP). However, their scheme is lack of scalability since the KU-CSP must maintain a secret value for each user. Tseng et al proposed another revocable IBE scheme with a cloud revocation authority, seeking to provide scalability and improve both performance and security level. In this paper, we present a new revocable IBE scheme with a cloud revocation server (CRS).The CRS holds only one secret time update key for all users, which provides the capability to scale our scheme. We demonstrate that our scheme is secure against adaptive-ID and chosen ciphertext attacks under the k-CAA assumption and outperforms both schemes mentioned above, in terms of having lower computation and communication overheads.

show abstract

Section: Performance Evaluationmentioning

confidence: 52%

Section: Performance Evaluationmentioning

confidence: 94%

Section: Related Work and Our Contributionsmentioning

confidence: 99%

Section: Related Work and Our Contributionsmentioning

confidence: 99%

ê : G \times G \to G_{T}

Section: Performance Evaluationmentioning

confidence: 99%

See 3 more Smart Citations

Efficient revocable ID‐based encryption with cloud revocation server

Jia

Kumar

Choo

et al. 2017

Int J Communication

View full text Add to dashboard Cite

show abstract

An efficient revocable identity‐based encryption with ciphertext evolution in the cloud‐assisted system

Chen

Deng

Ruan

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

Identity‐based encryption (IBE) is a public key cryptosystem on purpose to remove the traditional certificate management. How to realize efficient user revocation in the IBE is of great importance when considering its application. The drawback of most existing works is that the revoked user can still access the ciphertext prior to revocation. One possible solution proposed by Sun et al. is to evolve the ciphertext in the cloud. However, it is unfortunate that the master time key in their scheme is kept by the private key generator (PKG), which means it is sustained extra burden. In this article, we present an efficient revocable IBE with ciphertext evolution in the cloud‐assisted system and the ciphertext remains constant size. The cloud server keeps only one secret master time update key sent by the PKG in a private channel, and thus our scheme offers scalability. In the meantime, our detailed analysis demonstrates that our proposed scheme is semantically secure against ciphertext chosen attacks based on the k‐CAA problem and enjoys better efficiency in computation and communication costs compared with previous works.

show abstract