Esquema de Acordo de Chaves de Conferência Baseado em um Problema de Funções Quadráticas de Duas Variáveis

• Luis Antonio B. Kowada UFF
• Raphael C. S. Machado Inmetro / CEFET-RJ

DOI: https://doi.org/10.5753/sbseg.2017.19495

Abstract

Conference key establishment is the process to determine a common shared key between three or more participants. If all participants influence key generated by this process, we have a conference key agreement scheme. In the present work, we propose a conference key agreement scheme with some significant advantages over the existing schemes, of which we highlight the following: 1. agreement of conference keys in a single round and with linear quantity of messages published; 2. combination of two conference keys in a single round and with constant number of published messages; 3. renewing conference keys in a single round and with only one published message. The proposed scheme is resilient against classical attack scenarios, but is vulnerable to attack by an attacker capable of calculating the discrete logarithm and is therefore vulnerable to attacks with a quantum computer.

References

Al-Riyami, S. S. and Paterson, K. G. (2003). Tripartite Authenticated Key Agreement Protocols from Pairings, pages 332–359. Springer Berlin Heidelberg, Berlin, Heidelberg.

Ateniese, G., Steiner, M., and Tsudik, G. (2000). New multiparty authentication services and key agreement protocols. IEEE Journal on Selected Areas in Communications, 18(4):628–639.

Barker, E., Chen, L., Roginsky, A., and Smid, M. (2013). Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography (NIST Special Publication 800-56A, Revision 2). National Institute of Standards and Technology.

Barua, R., Dutta, R., and Sarkar, P. (2003). Extending joux’s protocol to multi party key agreement. IACR Cryptology ePrint Archive, 2003:62.

Boneh, D. and Silverberg, A. (2002). Applications of multilinear forms to cryptography. Contemporary Mathematics, 324:71–90.

Chunsheng, G. (2015a). Multilinear maps using ideal lattices without encodings of zero. Cryptology ePrint Archive, Report 2015/023. http://eprint.iacr.org/2015/023.

Chunsheng, G. (2015b). Multilinear maps using ideal lattices without encodings of zero. Diffie, W. and Hellman, M. (1976). New directions in cryptography. IEEE Trans. Inf. Theor., 22(6):644–654.

Diffie, W., Van Oorschot, P. C., and Wiener, M. J. (1992). Authentication and authenticated key exchanges. Designs, Codes and Cryptography, 2(2):107–125.

ElGammal, T. The first ten years of public-key cryptograph. Proceedings of the IEEE, 76.

ElGammal, T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31.

Garg, S., Gentry, C., and Halevi, S. (2013). Candidate Multilinear Maps from Ideal Lattices, pages 1–17. Springer Berlin Heidelberg, Berlin, Heidelberg.

Hilbert, D. (1902). Mathematical problems. Bull. Amer. Math. Soc., 8(10):437–479.

Hu, Y. and Jia, H. (2016). Cryptanalysis of ggh map. In Proceedings of the 35th Annual International Conference on Advances in Cryptology — EUROCRYPT 2016 - Volume 9665, pages 537–565, New York, NY, USA. Springer-Verlag New York, Inc.

Joux, A. (2000). A One Round Protocol for Tripartite Diffie–Hellman, pages 385–393. Springer Berlin Heidelberg, Berlin, Heidelberg.

Lee, Y.-R., Lee, H.-S., and Lee, H.-K. (2004). Multi-party authenticated key agreement protocols from multi-linear forms. Applied Mathematics and Computation, 159(2):317 – 331.

Manders, K. L. and Adleman, L. (1978). Np-complete decision problems for binary quadratics. Journal of Computer and System Sciences, 16(2):168 – 184.

Matijasevi?c, J. V. (1970). The diophantineness of enumerable sets (russian). Dokl. Akad. Nauk SSSR, 191:279–282.

Matsumoto, T., Takashima, Y., and Ima, H. On seeking smart public-key distribution systems. The Transactions of the IECE of Japan, E69.

Robinson, J. (1972). Review: Ju. v. matijasevic, a. doohovskoy, enumerable sets are diophantine. J. Symbolic Logic, 37(3):605–606.

Thue, A. (1902). Uber annaherungswerte algebraischer. J. Reine Angew Math, 135:284–305.