On the security of a strong provably secure identity-based encryption scheme without bilinear pairing
by Li Li; Jong-Hyouk Lee
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 6, No. 3, 2016

Abstract: The identity-based encryption scheme enables a sender to generate the ciphertext using a receiver's identity and system's parameters. Because of its convenience, the identity-based encryption scheme has been widely used in many practical applications. Recently, Zheng et al. proposed a new identity-based encryption scheme that operates without bilinear pairing. The authors claimed that their proposed scheme is provably secure in the standard model. However, in this paper, we show that Zheng et al.'s scheme unfortunately suffers from the key comprise problem, i.e., malicious users can deduce the private key of the key generation centre (KGC) through a coalition attack. Subsequently, the adversary can deduce any user's private key with the derived private key of the KGC. Our security analysis confirms that their scheme is not suitable for practical applications.

Online publication date: Mon, 21-Nov-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Technology and Secured Transactions (IJITST):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com