An efficient identity-based cryptosystem for end-to-end mobile security

In the next generation mobile telecommunications, any third party that provides wireless data services (e.g., mobile banking) must have its own solution for end-to-end security. Existing mobile security mechanisms are based on public-key cryptosystem. The main concern in a public-key setting is the authenticity of the public key. This issue can be resolved by identity-based (ID-based) cryptography where the public key of a user can be derived from public information that uniquely identifies the user. This paper proposes an efficient ID-based encryption algorithm. We actually implement the ID-based encryption schemes and compare the performance to show the advantage of our approach. Our study indicates that our solution outperforms a previously proposed algorithm by 20 - 35%

[1]  Rudolf Lide,et al.  Finite fields , 1983 .

[2]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[3]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

[4]  Alfred Menezes,et al.  Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[5]  Mihir Bellare,et al.  Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..

[6]  William Stallings,et al.  Cryptography and network security , 1998 .

[7]  Nigel P. Smart,et al.  Elliptic Curves in Cryptography: Preface , 1999 .

[8]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[9]  Gerhard Frey,et al.  The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems , 1999, IEEE Trans. Inf. Theory.

[10]  Erik Woodward Knudsen,et al.  Elliptic Scalar Multiplication Using Point Halving , 1999, ASIACRYPT.

[11]  Antoine Joux.  A One Round Protocol for Tripartite Diffie-Hellman , 2000, ANTS.

[12]  William M. Daley,et al.  Digital Signature Standard (DSS) , 2000 .

[13]  Yi-Bing Lin,et al.  Wireless and Mobile Network Architectures , 2000 .

[14]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[15]  S. Vanstone,et al.  OPTIMAL NORMAL BASES IN GF(p”)* , 2002 .

[16]  Yi-Bing Lin,et al.  Potential Fraudulent Usage in Mobile Telecommunications Networks , 2002, IEEE Trans. Mob. Comput..

[17]  L. Washington.  Elliptic Curves: Number Theory and Cryptography , 2003 .

[18]  Ian F. Blake,et al.  Refinements of Miller's algorithm for computing the Weil/Tate pairing , 2006, J. Algorithms.

[19]  Dan Boneh,et al.  Secure Identity Based Encryption Without Random Oracles , 2004, CRYPTO.

[20]  Hui-Nien Hung,et al.  A statistic approach for deriving the short message transmission delay distributions , 2004, IEEE Transactions on Wireless Communications.

[21]  Alfred Menezes,et al.  Field inversion and point halving revisited , 2004, IEEE Transactions on Computers.

[22]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[23]  Dan Boneh,et al.  Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..

[24]  Brent Waters,et al.  Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.