Computação da Quadratura Gaussiana em um Esquema Criptográfico Parcialmente Homomórfico

• Paulo Ricardo Reis LNCC
• Pedro Lara CEFET/RJ
• Fábio Borges LNCC

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

Abstract

There is a growing attention to the use of homomorphic encryption, that is, cryptographic systems able to perform mathematical operations with the data in the encrypted domain. Although such systems provide a huge gain in terms of data privacy, they prove to be significantly slower. This work evaluates the applicability of the Paillier system in the calculation of gaussian quadrature. A mean increase o 3234 times in the computational time was verified using the homomorphic system and nine decimal cases of precision.

References

Bhagadia, D., Bhanpurawala, M., Dalal, D., and Kanani, P. (2020). Securing pharmaceutical data using homomorphic encryption. International Journal of Future Generation Communication and Networking, 13(1s):331–341.

Borges, F., Lara, P., and Portugal, R. (2017). Parallel algorithms for modular multi-exponentiation. Applied Mathematics and Computation, 292:406–416.

Epperson, J. F. (2013). An introduction to numerical methods and analysis. John Wiley & Sons.

Hasan, R. and Shaw, K. (2018). A survey paper on privacy of medical data storage on the cloud.

Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. In International conference on the theory and applications of cryptographic techniques, pages 223–238. Springer.

Pallavi and Joshi, S. (2020). An efficient Paillier cryptographic technique for secure data storage on the cloud. In 2020 4th International Conference on Intelligent Computing and Control Systems (ICICCS), pages 145–149.