Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2015, Article ID 354586, 7 pages
http://dx.doi.org/10.1155/2015/354586
Research Article

Authenticated Diffie-Hellman Key Agreement Scheme that Protects Client Anonymity and Achieves Half-Forward Secrecy

Department of Information Management, National Chi-Nan University, 470 University Road, Puli, Nantou, Taiwan

Received 3 January 2015; Revised 30 March 2015; Accepted 12 April 2015

Academic Editor: Francesco Gringoli

Copyright © 2015 Hung-Yu Chien. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Ohkubo, K. Suzki, and S. Kinoshita, “Cryptographic approach to ‘privacy-friendly’ tags,” in Proceedings of the RFID Privacy Workshop, Massachusetts Institute of Technology, November 2003.
  2. H.-Y. Chien and C.-S. Laih, “ECC-based lightweight authentication protocol with untraceability for low-cost RFID,” Journal of Parallel and Distributed Computing, vol. 69, no. 10, pp. 848–853, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. H.-Y. Chien, “Combining Rabin cryptosystem and error correction codes to facilitate anonymous authentication with un-traceability for low-end devices,” Computer Networks, vol. 57, no. 14, pp. 2705–2717, 2013. View at Publisher · View at Google Scholar · View at Scopus
  4. H. Y. Chien, “Provably secure authenticated Diffie-Hellman key exchange for resource-limited smart card,” Journal of Shanghai Jiaotong University (Science), vol. 19, no. 4, pp. 436–439, 2014. View at Publisher · View at Google Scholar
  5. A. Brusilovsky, I. Faynberg, Z. Zeltsan, and S. Patel, “RFC683- Password-Authenticated Key (PAK) Diffie-Hellman Exchange,” 2010, http://tools.ietf.org/html/rfc5683.
  6. V. Boyko, P. MacKenzie, and S. Patel, “Provably secure password-authenticated key exchange using Diffie-Hellman,” in Advances in Cryptology—EUROCRYPT 2000, vol. 1807 of Lecture Notes in Computer Science, pp. 156–171, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  7. ISO/IEC 9798-3 Authentication SASL Mechanism, http://www.faqs.org/rfcs/rfc3163.html.
  8. S. Blake-Wilson, N. Bolyard, V. Gupta, C. Hawk, and B. Moeller, “Elliptic curve cryptography (ECC) cipher suites for transport layer security (TLS),” RFC 4492, Internet Engineering Task Force (IETF), 2006. View at Google Scholar
  9. W.-B. Lee and C.-C. Chang, “User identification and key distribution maintaining anonymity for distributed computer networks,” Computer Systems Science and Engineering, vol. 15, no. 4, pp. 113–116, 2000. View at Google Scholar · View at Scopus
  10. Y. Yang, S. Wang, F. Bao, J. Wang, and R. H. Deng, “New efficient User identification and key distribution scheme providing enhanced security,” Computers and Security, vol. 23, no. 8, pp. 697–704, 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. E.-J. Yoon and K.-Y. Yoo, “Cryptanalysis of two user identification schemes with key distribution preserving anonymity,” in Information and Communications Security: 7th International Conference, ICICS 2005, Beijing, China, December 10–13, 2005. Proceedings, vol. 3783 of Lecture Notes in Computer Science, pp. 315–322, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  12. H.-Y. Chien, “Practical anonymous user authentication scheme with security proof,” Computers & Security, vol. 27, no. 5-6, pp. 216–223, 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. P. Szalachowski and Z. Kotulski, “Enhancing the Oakley key agreement protocol with secure time information,” in Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS '12), pp. 1–8, Genoa, Italy, July 2012. View at Scopus
  14. T.-S. Wu and C.-L. Hsu, “Efficient user identification scheme with key distribution preserving anonymity for distributed computer networks,” Computers and Security, vol. 23, no. 2, pp. 120–125, 2004. View at Publisher · View at Google Scholar · View at Scopus
  15. R.-C. Wang, W.-S. Juang, and C.-L. Lei, “Provably secure and efficient identification and key agreement protocol with user anonymity,” Journal of Computer and System Sciences, vol. 77, no. 4, pp. 790–798, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. M. S. Farash, M. Bayat, and M. A. Attari, “Vulnerability of two multiple-key agreement protocols,” Computers and Electrical Engineering, vol. 37, no. 2, pp. 199–204, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. N.-Y. Lee, C.-N. Wu, and C.-C. Wang, “Authenticated multiple key exchange protocols based on elliptic curves and bilinear pairings,” Computers and Electrical Engineering, vol. 34, no. 1, pp. 12–20, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. US National Security Agency, The Case for Elliptic Curve Cryptography, https://www.nsa.gov/business/programs/elliptic_curve.shtml.
  19. A. Jurisic and A. J. Menezes, “Elliptic curves and cryptography,” Certicom Whitepaper, 1997. View at Google Scholar
  20. K. Xue, P. Hong, and C. Ma, “A lightweight dynamic pseudonym identity based authentication and key agreement protocol without verification tables for multi-server architecture,” Journal of Computer and System Sciences, vol. 80, no. 1, pp. 195–206, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. M. Rivain, “Fast and regular algorithms for scalar multiplication over elliptic curve,” The International Association for Cryptologic Research (IACR) Cryptology ePrint Archive 2011/338, https://eprint.iacr.org/2011/338.pdf.
  22. G. D. Sutter, J.-P. Deschamps, and J. L. Imana, “Efficient elliptic curve point multiplication using digit-serial binary field operations,” IEEE Transactions on Industrial Electronics, vol. 60, no. 1, pp. 217–225, 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Sinha, H. K. Srivastava, and S. Gupta, “Performance based comparison study of RSA and elliptic curve cryptography,” International Journal of Scientific & Engineering Research, vol. 4, no. 5, pp. 720–725, 2013. View at Google Scholar
  24. D. F. Pigatto, N. B. F. d. Silva, and K. R. L. J. C. Branco, “Performance evaluation and comparison of algorithms for elliptic curve cryptography with el-gamal based on MIRACL and RELIC libraries,” Journal of Applied Computing Research, vol. 1, no. 2, pp. 95–103, 2012. View at Publisher · View at Google Scholar