Key Exchange Algorithm Based on Homomorphic Encryption
Ilya Kuzmin, Sergey Krendelev
DOI: http://dx.doi.org/10.15439/2017F53
Citation: Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 11, pages 793–795 (2017)
Abstract. Key exchange algorithm based on homomorphic encryption idea is reviewed in this article. This algorithm might be used for safe messaging using one-time pads. Since algorithm requires a low amount of computing resources, this method might be used in IoT to provide authentication.
References
- Erdem Alkim, Leo Ducas, Thomas Poppelmann, and Peter Schwabe. Post-quantum key exchange - a new hope. Cryptology ePrint Archive, Report 2015/1092, 2015. http://eprint.iacr.org/2015/1092.
- 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 2015 IEEE Symposium on Security and Privacy, pages 553–570, May 2015.
- Joppe Bos, Craig Costello, Léo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, and Douglas Stebila. Frodo: Take off the ring! practical, quantum-secure key exchange from lwe. Cryptology ePrint Archive, Report 2016/659, 2016. http://eprint.iacr.org/2016/659 .
- Chris Peikert. Lattice Cryptography for the Internet, pages 197–219. Springer International Publishing, Cham, 2014.