Cryptanalysis of Kowada-Machado key exchange protocol

M Coutinho, T C de Souza Neto, Robson de Oliveira Albuquerque, Rafael Timóteo de Sousa Júnior

Abstract


A non-interactive key exchange (NIKE) protocol allows N parties who know each other’s public key to agree on a symmetric shared key without requiring any interaction. A classic example of such protocol for N = 2 is the Diffie-Hellman key exchange. Recently, some techniques were proposed to obtain a NIKE protocol for N parties, however, it is still considered an open problem since the security of these protocols must be confirmed. In a recent work, Kowada and Machado [1] proposed a protocol that solves the NIKE problem for N parties. However, this work found security problems in the proposed solution and implemented an efficient attack to their protocol demonstrating that their key-exchange scheme is insecure.

Keywords


Key exchange; Cryptography; Cryptanalysis

Full Text:

PDF

References


L. A. B. Kowada and R. C. S. Machado, “Esquema de acordo de chaves de conferência baseado em um problema de funções quadráticas de duas

variáveis,” XVII Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais - SBSeg, 2017.

W. Diffie and M. Hellman, “New directions in cryptography,” IEEE transactions on Information Theory, vol. 22, no. 6, pp. 644–654, 1976.

L. Law, A. Menezes, M. Qu, J. Solinas, and S. Vanstone, “An efficient protocol for authenticated key agreement,” Designs, Codes and Cryp-

tography, vol. 28, no. 2, pp. 119–134, 2003.

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.

A. Joux, “A one round protocol for tripartite diffie–hellman,” in Inter-national algorithmic number theory symposium, pp. 385–393, Springer,

J.-S. Coron, T. Lepoint, and M. Tibouchi, “Practical multilinear maps over the integers,” in Advances in Cryptology–CRYPTO 2013, pp. 476–

, Springer, 2013.

D. Boneh and M. Zhandry, “Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation,” Algorithmica,

vol. 79, no. 4, pp. 1233–1285, 2017.

L. J. Mordell, Diophantine equations, vol. 30. Academic Press, 1969.

S. Shokranian, M. Soares, and H. Godinho, Number Theory. UnB, 1994.

K. Ireland and M. Rosen, A classical introduction to modern number theory, vol. 84. Springer Science & Business Media, 2013.

D. F. Aranha and C. P. L. Gouvêa, “RELIC is an Efficient LIbrary for Cryptography.” https://github.com/relic-toolkit/relic.

D. E. Knuth, The art of computer programming: sorting and searching, vol. 3. Pearson Education, 1998.




DOI: https://doi.org/10.17648/enigma.v4i1.64

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Licença Creative Commons
This site is licensed with the Creative Commons Atribuição-NãoComercial-SemDerivações 4.0 Internacional

RENASIC Logo1 Logo2 Logo3