Volume 9 Number 11 (Nov. 2014)
Home > Archive > 2014 > Volume 9 Number 11 (Nov. 2014) >
JCP 2014 Vol.9(11): 2691-2696 ISSN: 1796-203X
doi: 10.4304/jcp.9.11.2691-2696

An Identity-based Cryptography Scheme Based on FullIdent Algorithm

Xie Yumin1 and Muhammad Kamran2
1Nanjing Institute of Technology, Nanjing 210000, China
2Department of Electrical Engineering, University of Engineering and Technology, Lahore KSK Campus Pakista


Abstract—FullIdent is an identity-based cryptography (IBC) algorithm which is proposed by Boneh and Franklin. In this paper, we give a new identity-based cryptography scheme based on FullIdent. Comparing to FullIdent, our new one concludes three improvements. First, there is no IDMapToPoint function when a sender encrypt message with our scheme. Second, there is no paring operation calculating works during encrypt phase in our scheme. Third, using our new scheme, it is easy to construct an identity-based cryptography system without key escrow problem (KEP). In contrast with existing solutions for KEP, our scheme only employs two independent private key generators (PKG). In addition, our scheme for KEP is very simple because all values are transferred with plaintext.

Index Terms—ID-Based Cryptography, Weil-Pairing, ECC, Key Escrow Problem, FullIdent.

[PDF]

Cite: Xie Yumin and Muhammad Kamran, "An Identity-based Cryptography Scheme Based on FullIdent Algorithm," Journal of Computers vol. 9, no. 11, pp. 2691-2696, 2014.

General Information

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

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

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

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

  • Sep 16, 2019 News!

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

  • Aug 16, 2019 News!

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

  • Read more>>