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. |
Year | DOI | Venue |
---|---|---|
2014 | 10.4304/jcp.9.11.2691-2696 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
ID-Based Cryptography, Weil-Pairing, ECC, Key Escrow Problem, FullIdent | Computer science,Cryptography,Communication source,Algorithm,Theoretical computer science,Encryption,ID-based cryptography,Key escrow,Public-key cryptography,Plaintext,Weil pairing | Journal |
Volume | Issue | ISSN |
9 | 11 | 1796-203X |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yumin Xie | 1 | 1 | 0.73 |
Muhammad Kamran | 2 | 31 | 7.00 |