A New Two-Party Identity-Based Authenticated Key Agreement

  • Noel McCullagh
  • Paulo S. L. M. Barreto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3376)

Abstract

We present a new two-party identity-based key agreement that is more efficient than previously proposed schemes. It is inspired on a new identity-based key pair derivation algorithm first proposed by Sakai and Kasahara. We show how this key agreement can be used in either escrowed or escrowless mode. We also describe conditions under which users of different Key Generation Centres can agree on a shared secret key. We give an overview of existing two-party key agreement protocols, and compare our new scheme with existing ones in terms of computational cost and storage requirements.

Keywords

authenticated key agreement identity-based cryptography bilinear maps Tate pairing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Al-Riyami, S.S., Paterson, K.G.: Tripartite authenticated key agreement protocols from pairings. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 332–359. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 232–249. Springer, Heidelberg (1994)Google Scholar
  3. 3.
    Blake-Wilson, S., Johnson, D., Menezes, A.: Key agreement protocols and their security analysis. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 30–45. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Chen, L., Harrison, K.: Multiple trusted authorities in identifier based cryptography from pairings on elliptic curves. Trusted Systems Laboratory, HP (2003), http://www.hpl.hp.com/techreports/2003/HPL-2003-48.pdf
  6. 6.
    Chen, L., Kudla, C.: Identity based authenticated key agreement from pairings. Cryptology ePrint Archive, Report 2002/184 (2002), http://eprint.iacr.org/2002/184
  7. 7.
    Chen, Z.: Security analysis on Nalla-Reddy’s ID-based tripartite authenticated key agreement protocols. Cryptology ePrint Archive, Report 2003/103 (2003), http://eprint.iacr.org/2003/103
  8. 8.
    Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360–363. Springer, Heidelberg (2001), http://www.cesg.gov.uk/site/ast/idpkc/media/ciren.pdf CrossRefGoogle Scholar
  9. 9.
    Dutta, R., Barua, R., Sarkar, P.: Pairing-based cryptography: A survey. Cryptology ePrint Archive, Report 2004/064 (2004), http://eprint.iacr.org/2004/064
  10. 10.
    Galbraith, S.: Personal communication (2004)Google Scholar
  11. 11.
    Galbraith, S., Rotger, V.: Easy decision-diffie-hellman groups. Cryptology ePrint Archive, Report 2004/070 (2004), http://eprint.iacr.org/2004/070
  12. 12.
    Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385–394. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  13. 13.
    Nalla, D.: ID-based tripartite key agreement with signatures. Cryptology ePrint Archive, Report 2003/144 (2003), http://eprint.iacr.org/2003/144
  14. 14.
    Nalla, D., Reddy, K.C.: ID-based tripartite authenticated key agreement protocols from pairings. Cryptology ePrint Archive, Report 2003/004 (2003), http://eprint.iacr.org/2003/004
  15. 15.
    Ryu, E.-K., Yoon, E.-J., Yoo, K.-Y.: An efficient ID-based autenticated key agreement protocol from pairings. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1458–1463. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve. In: 2003 Symposium on Cryptography and Information Security, SCIS 2003, Hamamatsu, Japan (2003), http://eprint.iacr.org/2003/054
  17. 17.
    Scott, M.: Authenticated ID-based key exchange and remote log-in with insecure token and PIN number. In: Cryptology ePrint Archive, Report 2002/164 (2002), http://eprint.iacr.org/2002/164/
  18. 18.
    Scott, M., Barreto, P.S.L.M.: Compressed pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 140–156. Springer, Heidelberg (2004)Google Scholar
  19. 19.
    Shamir, A.: Identity based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  20. 20.
    Shim, K.: Cryptanalysis of Al-Riyami-Patersons authenticated three party key agreement protocols. Cryptology ePrint Archive, Report 2003/122 (2003), http://eprint.iacr.org/2003/122
  21. 21.
    Shim, K.: Cryptanalysis of ID-based tripartite authenticated key agreement protocols. Cryptology ePrint Archive, Report 2003/115 (2003), http://eprint.iacr.org/2003/115
  22. 22.
    Shim, K.: Efficient ID-based authenticated key agreement protocol based on Weil pairing. Electronics Letters 39(8), 653–654 (2003)CrossRefGoogle Scholar
  23. 23.
    Shim, K.: Efficient one round tripartite authenticated key agreement protocol from Weil pairing (2003)Google Scholar
  24. 24.
    Smart, N.P.: An identity based authenticated key agreement protocol based on the Weil pairing. Electronics Letters 38, 630–632 (2002)CrossRefMATHGoogle Scholar
  25. 25.
    Sun, H.-M., Hsieh, B.-T.: Security analysis of Shims authenticated key agreement protocols from pairings. Cryptology ePrint Archive, Report 2003/113 (2003), http://eprint.iacr.org/2003/113
  26. 26.
    Verheul, E.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 195–210. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  27. 27.
    Yacobi, Y.: A note on the bilinear Diffie-Hellman assumption. Cryptology ePrint Archive, Report 2002/113 (2002), http://eprint.iacr.org/2002/113
  28. 28.
    Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme from bilinear pairings and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Noel McCullagh
    • 1
  • Paulo S. L. M. Barreto
    • 2
  1. 1.School of ComputingDublin City UniversityGlasnevin, Dublin 9Ireland
  2. 2.Escola PolitécnicaUniversidade de São PauloSão Paulo(SP)Brazil

Personalised recommendations