StealthyCRM: A Secure Cloud CRM System Application that Supports Fully Homomorphic Database Encryption

Felipe, Miguel Rodel; Aung, Khin Mi Mi; Xia, Ye; Wen, Yonggang

doi:10.1109/icccri.2015.23

Cited by 7 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Despite the progress in this field, researchers are still trying to solve performance and memory problems to make HE technique mature for real applications [12][13][14][15][65][66][67][68]. This situation also affects matrix operations [33,69,70], especially matrix multiplication for privacy-preserving machine and deep learning applications [36,[71][72][73][74].…”

Section: Homomorphic Encryption Librariesmentioning

confidence: 99%

A Comparative Study of Secure Outsourced Matrix Multiplication Based on Homomorphic Encryption

Babenko

Golimblevskaia

Tchernykh

et al. 2023

BDCC

View full text Add to dashboard Cite

Homomorphic encryption (HE) is a promising solution for handling sensitive data in semi-trusted third-party computing environments, as it enables processing of encrypted data. However, applying sophisticated techniques such as machine learning, statistics, and image processing to encrypted data remains a challenge. The computational complexity of some encrypted operations can significantly increase processing time. In this paper, we focus on the analysis of two state-of-the-art HE matrix multiplication algorithms with the best time and space complexities. We show how their performance depends on the libraries and the execution context, considering the standard Cheon–Kim–Kim–Song (CKKS) HE scheme with fixed-point numbers based on the Microsoft SEAL and PALISADE libraries. We show that Windows OS for the SEAL library and Linux OS for the PALISADE library are the best options. In general, PALISADE-Linux outperforms PALISADE-Windows, SEAL-Linux, and SEAL-Windows by 1.28, 1.59, and 1.67 times on average for different matrix sizes, respectively. We derive high-precision extrapolation formulas to estimate the processing time of HE multiplication of larger matrices.

show abstract