Volume 4 Number 1 (Jan. 2009)
Home > Archive > 2009 > Volume 4 Number 1 (Jan. 2009) >
JCP 2009 Vol.4(1): 19-26 ISSN: 1796-203X
doi: 10.4304/jcp.4.1.19-26

Constructing Efficient Certificate-based Encryption with Paring

Yang Lu1, Jiguo Li1, Junmo Xiao2
1College of Computer and Information Engineering, Hohai University, Nanjing, China
2Institute 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.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Read more>>