We introduce HELiKs, a groundbreaking framework for fast and secure matrix multiplication and 3D convolutions, tailored for privacy-preserving machine learning. Leveraging Homomorphic Encryption (HE) and Additive Secret Sharing, HELiKs enables secure matrix and vector computations while ensuring end-to-end data privacy for all parties. Key innovations of the proposed framework include an efficient multiply-accumulate (MAC) design that significantly reduces HE error growth, a partial sum accumulation strategy that cuts the number of HE rotations by a logarithmic factor, and a novel matrix encoding that facilitates faster online HE multiplications with one-time pre-computation. Furthermore, HELiKs substantially reduces the number of keys used for HE computation, leading to lower bandwidth usage during the setup phase. In our evaluation, HELiKs shows considerable performance improvements in terms of runtime and communication overheads when compared to existing secure computation methods. With our proof-of-work implementation, we demonstrate state-of-the-art performance with up to 32× speedup for matrix multiplication and 27× speedup for 3D convolution when compared to prior art. HELiKs also reduces communication overheads by 1.5× for matrix multiplication and 29× for 3D convolution over prior works, thereby improving the efficiency of data transfer.
CITATION STYLE
Balla, S., & Koushanfar, F. (2023). HELiKs: HE Linear Algebra Kernels for Secure Inference. In CCS 2023 - Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 2306–2320). Association for Computing Machinery, Inc. https://doi.org/10.1145/3576915.3623136
Mendeley helps you to discover research relevant for your work.