Aplicação do Algoritmo de Colônia de Formigas para Redução do Tamanho de Chaves Públicas em Criptografia Completamente Homomórfica

• Joffre Gavinho Filho UFRJ
• Jonice Oliveira UFRJ
• Claudio Miceli UFRJ
• Gabriel Pereira da Silva UFRJ

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

Abstract

The fully homomorphic encryption, one of the areas post-quantum cryptography, is one of techniques for processing and manipulating encrypted data without deciphering them. Used on platforms where traditional encryption may not have the desired security, such as cloud computing case. Several methods have been proposed to facilitate the use of this technique. However, for its effective use, there is the need to generate parameters that result in keys with extremely large sizes. This article aims to reduce the size of public keys using the optimization algorithm ant colony to ratify the calibration of the variants of algorithms already present in the literature.

References

Boneh, D., Halevi, S., Hamburg, M., et al. “Circular-secure encryption from decision diffie-hellman”. In: Advances in Cryptology–CRYPTO 2008,Springer, 2008.

Buchmann, Johannes A. “Introdução a Criptografia”. Ed. Berkeley, São Paulo, 2002.

Brakerski, Z., Gentry, C., Vaikuntanathan, V. “Fully homomorphic encryption without bootstrapping”, ITCS 2012, 2012.

Coron, J., Naccache, D., Tibouchi, M. Optimization of Fully homomorphic Encryption. Cryptology ePrint Archive, Report 2011/440, 2012.

Castro, L. N. de. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications. Chapman & Hall/CRC, 2006.

Coron, J., Mandal, A., Naccache, D., et al. “Fully homomorphic encryption over the integers with shorter public keys”, Advances in Cryptology–, pp. 487–504, 2011.

CSA Security Guidance for Critical Areas of Focus in Cloud Computing –v2.1. Cloud Security Alliance, 2009.

Daniel J. Bernstein. Introduction to post-quantum cryptography. In Post-Quantum Cryptography. 2009.

Dijk., M. Van, Gentry, C., Halevi, S. e Vaikuntanathan, V., Fully homomorphic encryption over the integers. In H. Gilbert (Ed.), EUROCRYPT 2010.

Dorigo, M.; Gambardella, L. M., Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE TEC 1997.

Dorigo, M.; Stutzle, T. Ant Colony Optimization. Massachusetts Institute of Technology. Cambridge, 2004.

Gavinho, Joffre Filho; Micelli, C; Pereira, G. "Compressão e Otimização de Chaves Públicas usando Algoritmo Genético em Criptografia Completamente Homomórfica"- XV Simpósio Brasileiro em Segurança da Informação e de Sistemas Computacionais - SBSEG 2015 - Florianópolis/SC, Brasil - Novembro 09-12, 2015.

Gavinho, Joffre Filho; Micelli, C; Pereira, G. " A Public Key Compression Method for Fully Homomorphic Encryption using Genetic Algorithms!” 19th International Conference on Information Fusion – Heildeberg - Alemanha - 2016.

Gentry, C. “Fully homomorphic encryption using ideal lattices”. In: Proceedings of the 41st annual ACM Symposium on Theory of computing, pp. 169–178. ACM, 2009.

Keeney, R.L. & RAIFFA, H. Decisions with Multiple Objectives: Preferences and Value Tradeoffs , John Wiley & Sons, Nova Iorque, 1976.

Lacerda, E.G.M e Carvalho, A.C.P.L. “Introdução aos Algoritmos Genéticos”, In: Sistemas inteligentes: aplicações a recursos hídricos e ciências ambientais. Editado por Galvão, C.O., Valença, M.J.S. Ed. Universidade/UFRGS: ABRH, 1999.

Michael O. Rabin. Probabilistic algorithm for testing primality. Journal of Number Theory , 12(1):128 – 138, 1980.

Morris, Christopher , "Navy Ultra's Poor Relations", in Hinsley, F.H.; Stripp, Alan, Codebreakers: The inside story of Bletchley Park, : Oxford University Press, 1993

NIST- National institute of standards and technology. Cyber security Framework Development Overview.NIST’s Role in Implementing Executive Order 7213636, Improving Critical Infrastructure Cybersecurity, Presentation to ISPAB, 2013.

Mukherjee P, Wichs D. Two round MPC from LWE via multi-key FHE. IACR Cryptology ePrint Archive , 2015. To appear in Proceedings of Eurocrypt 2016.

Rivest R. L., L Adleman, and M L Dertouzos. On data banks and privacy homomorphisms, in r. a. demillo et al. In Eds.), FSC. Academic Press, 1978.

Smart, N.; Vercauteren, F. Fully homomorphic encryption with relatively small key and ciphertext sizes. Cryptology ePrint Archive, Report 2009/571, 2009.

Stalling, Willian, Criptografia e Segurança de Redes: Princípios e Práticas 4. Ed. Prentice Hall Brasil, pag 17-36, 2007.

Sousa, F. R. C.; Moreira, L. O.; Machado, J. C. Computação em Nuvem: Conceitos, Tecnologias, Aplicações e Desafios. Fortaleza, 2009.

William S. SAGE: A Computer System for Algebra and Geometry Experimentation, 2012.