Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Malicious KGC attacks in certificateless cryptography
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Self-generated-certificate public key encryption without pairing
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Strongly secure certificateless public key encryption without pairing
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Generic certificateless encryption in the standard model
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
Certificateless public key encryption without pairing
ISC'05 Proceedings of the 8th international conference on Information Security
On constructing certificateless cryptosystems from identity based encryption
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
| Hi-index | 0.00 |
Certificateless public key encryption can be classified into two types, namely, CLE and ${\tt CLE}^{\dag}$, both of which were introduced by Al-Riyami and Paterson in Asiacrypt 2003. Most works about certificateless public key encryption belong to CLE , where the partial secret key is uniquely determined by an entity's identity. In ${{\tt CLE}}^{\dag}$, an entity's partial secret key is not only determined by the identity information but also by his/her (partial) public key. Such techniques can enhance the resilience of certificateless public key encryption against a cheating KGC. In this paper, we first formalize the security definitions of ${{\tt CLE}}^{\dag}$. After that, we demonstrate the gap between the security model of ${{\tt CLE}}^{\dag}$ and CLE , by showing the insecurity of a ${{\tt CLE}}^{\dag}$ scheme proposed by Lai and Kou in PKC 2007. We give an attack that can successfully break the indistinguishability of their ${\tt CLE}^{\dag}$ scheme, although their scheme can be proved secure in the security model of CLE . Therefore, it does not suffice to consider the security of ${\tt CLE}^{\dag}$ in the security model of CLE . Finally, we show how to secure Lai-Kou's scheme by providing a new scheme with the security proof in the model of ${\tt CLE}^{\dag}$.