The reviewed record of science sign in
Pith

arxiv: 2505.11058 · v1 · pith:JYJZZY5B · submitted 2025-05-16 · cs.CR

Side Channel Analysis in Homomorphic Encryption

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:JYJZZY5Brecord.jsonopen to challenge →

classification cs.CR
keywords channelmethodssideanalysisprocessingcryptographicencryptionhomomorphic
0
0 comments X
read the original abstract

Homomorphic encryption provides many opportunities for privacy-aware processing, including with methods related to machine learning. Many of our existing cryptographic methods have been shown in the past to be susceptible to side channel attacks. With these, the implementation of the cryptographic methods can reveal information about the private keys used, the result, or even the original plaintext. An example of this includes the processing of the RSA exponent using the Montgomery method, and where 0's and 1's differ in their processing time for modular exponentiation. With FHE, we typically use lattice methods, and which can have particular problems in their implementation in relation to side channel leakage. This paper aims to outline a range of weaknesses within FHE implementations as related to side channel analysis. It outlines a categorization for side-channel analysis, some case studies, and mitigation strategies.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.