Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 1740572, 16 pages
https://doi.org/10.1155/2017/1740572
Research Article

A Simple Provably Secure AKE from the LWE Problem

1Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
2The Seventh Middle School of Zibo, Shandong 255499, China

Correspondence should be addressed to Limin Zhou; moc.361@s.nimiluohz

Received 20 November 2016; Accepted 12 March 2017; Published 19 April 2017

Academic Editor: Bruno G. M. Robert

Copyright © 2017 Limin Zhou and Fengju Lv. 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. Bellare and P. Rogaway, “Entity authentication and key distribution,” in Advances in Cryptology—CRYPTO '93, vol. 773 of Lecture Notes in Computer Science, pp. 232–249, Springer, Berlin, Germany, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  2. M. Bellare and P. Rogaway, “Provably secure session key distribution: the three party case,” in Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC '95), pp. 57–66, ACM Press, Las Vegas, Nev, USA, May-June 1995.
  3. M. Bellare, D. Pointcheval, and P. Rogaway, “Authenticated key exchange secure against dictionary attacks,” in Advances in Cryptology—EUROCRYPT 2000, vol. 1807 of Lecture Notes in Computer Science, pp. 139–155, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  4. R. Canetti and H. Krawczyk, “Analysis of key-exchange protocols and their use for building secure channels,” in Advances in Cryptology—EUROCRYPT 2001, pp. 453–474, Springer, Berlin, Germany, 2001. View at Google Scholar
  5. H. Krawczyk, “HMQV: a high-performance secure Diffie-Hellman protocol (extended abstract),” in Advances in cryptology—CRYPTO 2005, vol. 3621 of Lecture Notes in Computer Science, pp. 546–566, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  6. C. Cremers, “Examining indistinguishability-based security models for key exchange protocols: the case of CK, CK-HMQV, and eCK,” in Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, pp. 80–91, ACM, Hong Kong, March 2011.
  7. B. LaMacchia, K. Lauter, and A. Mityagin, “Stronger security of authenticated key exchange,” in Provable Security, vol. 4784 of Lecture Notes in Computer Science, pp. 1–16, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  8. A. P. Sarr, P. Elbaz-Vincent, and J. C. Bajard, “A new security model for authenticated key agreement,” in Security and Cryptography for Networks, pp. 219–234, Springer, Berlin, Germany, 2010. View at Google Scholar
  9. M. O. Rabin, Digitalized Signatures and Public-Key Functions as Intractable as Factorization, Massachusetts Institute of Technology, Cambridge Laboratory for Computer Science, 1979.
  10. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, vol. 26, no. 5, pp. 1484–1509, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. C. Gentry, C. Peikert, and V. Vaikuntanathan, “Trapdoors for hard lattices and new cryptographic constructions,” in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC '08), pp. 197–206, Victoria, Canada, May 2008. View at Publisher · View at Google Scholar
  13. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC '05), pp. 84–93, Baltimore, Md, USA, May 2005. View at Publisher · View at Google Scholar
  14. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM, vol. 56, no. 6, article 34, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. C. Peikert, “Public-key cryptosystems from the worst-case shortest vector problem,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC '09), pp. 333–342, ACM, Bethesda, Md, USA, 2009.
  16. V. Lyubashevsky, C. Peikert, and O. Regev, “On ideal lattices and learning with errors over rings,” in Advances in Cryptology—EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30–June 3, 2010. Proceedings, H. Gilbert, Ed., vol. 6110 of Lecture Notes in Computer Science, pp. 1–23, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  17. C. Peikert, “Lattice cryptography for the internet,” in Post-Quantum Cryptography, vol. 8772 of Lecture Notes in Computer Science, pp. 197–219, Springer International Publishing, Cham, Switzerland, 2014. View at Publisher · View at Google Scholar
  18. J. W. Bos, C. Costello, M. Naehrig, and D. Stebila, “Post-quantum key exchange for the TLS protocol from the ring learning with errors problem,” in Proceedings of the 36th IEEE Symposium on Security and Privacy (SP '15), pp. 553–570, San Jose, Calif, USA, May 2015. View at Publisher · View at Google Scholar · View at Scopus
  19. J. Katz and V. Vaikuntanathan, “Smooth projective hashing and password-based authenticated key exchange from lattices,” in Advances in Cryptology—ASIACRYPT 2009, M. Matsui, Ed., vol. 5912 of Lecture Notes in Computer Science, pp. 636–652, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  20. J. Ding and X. Lin, “A simple provably secure key exchange scheme based on the learning with errors problem,” IACR Cryptology ePrint Archive 2012/688, 2012. View at Google Scholar
  21. X. Lei and X. Liao, “NTRU-KE: a lattice-based public key exchange protocol,” IACR Cryptology ePrint Archive, vol. 2013, article 718, 2013. View at Google Scholar
  22. S. Wang, Y. Zhu, D. Ma, and R. Feng, “Lattice-based key exchange on small integer solution problem,” Science China. Information Sciences, vol. 57, no. 11, pp. 1–12, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. L. Wulu, “A key exchange scheme based on lattice,” in Proceedings of the 11th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC '13), pp. 100–106, Chengdu, China, December 2013. View at Publisher · View at Google Scholar · View at Scopus
  24. J. Zhang, Z. Zhang, J. Ding et al., “Authenticated key exchange from ideal lattices,” in Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 719–751, Springer, Sofia, Bulgaria, April 2015.
  25. V. Singh, “A practical key exchange for the internet using lattice cryptography,” IACR Cryptology ePrint Archive 2015/138, 2015. View at Google Scholar
  26. A. Fujioka, K. Suzuki, K. Xagawa, and K. Yoneyama, “Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism,” in Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security (ASIA CCS '13), pp. 83–94, ACM, May 2013. View at Publisher · View at Google Scholar · View at Scopus
  27. A. Fujioka, K. Suzuki, K. Xagawa, and K. Yoneyama, “Strongly secure authenticated key exchange from factoring, codes, and lattices,” Designs, Codes and Cryptography, vol. 76, no. 3, pp. 469–504, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. J. Ding, S. Alsayigh, R. V. Saraswathy et al., “Leakage of signal function with reused keys in RLWE key exchange,” Cryptology ePrint Archive Report 2016/1176, 2016. View at Google Scholar
  29. B. Gong and Y. Zhao, “Small field attack, and revisiting RLWE-based authenticated key exchange from Eurocrypt'15,” Cryptology ePrint Archive Report 2016/913, 2016, http://eprint.iacr.org/2016/913. View at Google Scholar
  30. R. Lidl and H. Niederreiter, Instruction to Algebra and Finite Fields, Cambridge University Press, 2000, http://www.cambridge.org.
  31. Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, “Classical hardness of learning with errors,” in Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC '13), pp. 575–584, ACM, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. B. Applebaum, D. Cash, C. Peikert et al., “Fast cryptographic primitives and circular-secure encryption based on hard learning problems,” in Advances in Cryptology—CRYPTO 2009, pp. 595–618, Springer, Berlin, Germany, 2009. View at Google Scholar
  33. D. Micciancio and O. Regev, “Worst-case to average-case reductions based on Gaussian measures,” SIAM Journal on Computing, vol. 37, no. 1, pp. 267–302, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. B. Ustaoglu, “Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS,” Designs, Codes, and Cryptography, vol. 46, no. 3, pp. 329–342, 2008. View at Publisher · View at Google Scholar · View at Scopus
  35. K. K. R. Choo, C. Boyd, and Y. Hitchcock, “Examining indistinguishability-based proof models for key establishment protocols,” in Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, pp. 585–604, Springer, Chennai, India, December 2005.