¹College of Computer and Information Engineering, Hohai University, Nanjing, China
²Institute of Communication Engineering, PLA University of Science and Technology, Nanjing, China

---

Abstract—The certificate-based encryption (CBE) is a new PKC paradigm which combines traditional public-key encryption (PKE) and identity based encryption (IBE) while preserving their features. CBE provides an efficient implicit certificate mechanism to eliminate third-party queries for the certificate status and to simply the certificate revocation problem. Therefore, CBE can be used to construct an efficient PKI requiring fewer infrastructures. In addition, it also solves the key escrow problem and key distribution problem inherent in IBE. In this paper, we construct an efficient CBE scheme with paring and prove it to be CCAsecure in the random oracle model based on the hardness of the Bilinear Diffie-Hellman Inversion assumption. When compared with other existing CBE schemes, our scheme has obvious advantage in the computation performance.

Index Terms—Certificate-based encryption, pairing, p-BDHI assumption, random oracle model.

[PDF]

Cite: Yang Lu, Jiguo Li, Junmo Xiao, "Constructing Efficient Certificate-based Encryption with Paring," Journal of Computers vol. 4, no. 1, pp. 19-26, 2009.