Achieving CCA1-security in homomorphic encryption
Resumo
Este artigo propõe a combinação de encriptação homomórfica e computação verificável para evitar ataques de recuperação de chaves e obter segurança CCA1 em construções de esquemas parcialmente homomórficos descritos na literatura. Além disso, são propostos parâmetros concretos, baseados na análise do melhor ataque, concluindo que a família AGCD [van Dijk et al. 2010] de esquemas SHE pode ser consideradas a melhor escolha em determinadas circunstâncias.
Referências
Brakerski, Z., Gentry, C., and Vaikuntanathan, V. (2011). Fully homomorphic encryption without bootstrapping. Electronic Colloquium on Computational Complexity (ECCC), 18:111.
Chung, K., Kalai, Y., and Vadhan, S. (2010). Improved delegation of computation using fully homomorphic encryption. In Rabin, T., editor, Advances in Cryptology - CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pages 483–501.
Berlin Heidelberg. Dahab, R., Galbraith, S., and Morais, E. (2015). Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes. In Lehmann, A. and Wolf, S., editors, Information Theoretic Security, volume 9063 of Lecture Notes in ComputerScience, pages 283–296.
Fiore, D., Gennaro, R., and Pastro, V. (2014). Efficiently verifiable computation on encrypted data. Cryptology ePrint Archive, Report 2014/202. http://eprint.iacr.org/.
Gennaro, R., Gentry, C., and Parno, B. (2010). Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Rabin, T., editor, Advances in Cryptology - CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pages 465–482. Springer Berlin Heidelberg.
Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. In STOC ’09: Proceedings of the 41st annual ACM symposium on Theory of computing, pages 169–178, New York, NY, USA. ACM.
Loftus, J., May, A., Smart, N. P., and Vercauteren, F. (2011). On CCA-secure somewhat homomorphic encryption. In In Selected Areas in Cryptography, pages 55–72.
Van Dijk, M., Gentry, C., Halevi, S., and Vaikuntanathan, V. (2010). Fully homomorphic encryption over the integers. In Proceedings of the 29th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT’10, pages 24–43, Berlin, Heidelberg. Springer-Verlag.
Chung, K., Kalai, Y., and Vadhan, S. (2010). Improved delegation of computation using fully homomorphic encryption. In Rabin, T., editor, Advances in Cryptology - CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pages 483–501.
Berlin Heidelberg. Dahab, R., Galbraith, S., and Morais, E. (2015). Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes. In Lehmann, A. and Wolf, S., editors, Information Theoretic Security, volume 9063 of Lecture Notes in ComputerScience, pages 283–296.
Fiore, D., Gennaro, R., and Pastro, V. (2014). Efficiently verifiable computation on encrypted data. Cryptology ePrint Archive, Report 2014/202. http://eprint.iacr.org/.
Gennaro, R., Gentry, C., and Parno, B. (2010). Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Rabin, T., editor, Advances in Cryptology - CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pages 465–482. Springer Berlin Heidelberg.
Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. In STOC ’09: Proceedings of the 41st annual ACM symposium on Theory of computing, pages 169–178, New York, NY, USA. ACM.
Loftus, J., May, A., Smart, N. P., and Vercauteren, F. (2011). On CCA-secure somewhat homomorphic encryption. In In Selected Areas in Cryptography, pages 55–72.
Van Dijk, M., Gentry, C., Halevi, S., and Vaikuntanathan, V. (2010). Fully homomorphic encryption over the integers. In Proceedings of the 29th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT’10, pages 24–43, Berlin, Heidelberg. Springer-Verlag.
Publicado
04/07/2016
Como Citar
MORAIS, Eduardo; ARANHA, Diego F.; DAHAB, Ricardo.
Achieving CCA1-security in homomorphic encryption. In: ENCONTRO DE TEORIA DA COMPUTAÇÃO (ETC), 1. , 2016, Porto Alegre.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2016
.
p. 804-807.
ISSN 2595-6116.
DOI: https://doi.org/10.5753/etc.2016.9829.
