Exploiting data redundancy in CKKS encoding for high-speed homomorphic encryption

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents an efficient encoding method for CKKS Homomorphic Encryption (HE) that exploits data redundancy to make the conversion of complex/real numbers to plaintext polynomials efficient without sacrificing security or accuracy. While the proposed method is amenable to customized hardware implementation, it is specifically designed to be embedded within HE software libraries such as Microsoft SEAL to provide a fast software implementation of CKKS encoding. Experimental evaluations show that the proposed approach results in up to 1.4x and 1.5x speed-ups for encoding complex and real numbers, respectively, compared to the SEAL library CKKS encoding for polynomial modulus degrees from 4096 to 32768.

Original languageEnglish
Title of host publicationASIA CCS '24: proceedings of the 2024 ACM Asia Conference on Computer and Communications Security
PublisherAssociation for Computing Machinery
DOIs
Publication statusAccepted - 12 Mar 2024
EventACM Asia Conference on Computer and Communications Security 2024 - Singapore, Singapore
Duration: 01 Jul 202405 Jul 2024

Conference

ConferenceACM Asia Conference on Computer and Communications Security 2024
Abbreviated titleASIA CCS'23
Country/TerritorySingapore
CitySingapore
Period01/07/202405/07/2024

Fingerprint

Dive into the research topics of 'Exploiting data redundancy in CKKS encoding for high-speed homomorphic encryption'. Together they form a unique fingerprint.

Cite this