Approximate Homomorphic Encryption over the Conjugate-Invariant Ring

Kim, Duhyeong; Song, Yongsoo

doi:10.1007/978-3-030-12146-4_6

“…In [122] Boemer, Costache, Cammarota and Wierzynski introduced several optimizations, based on complex packing, to improve the runtime of scalar encoding and of ciphertextplaintext addition and multiplication operations. Moreover, a different kind of complex packing was introduced by Kim and Song in [123]. In a recent work, Li and Micciancio [124] presented an attack against HEAAN that works for a specific application scenario.…”

Section: F Fourth Generation: Fhe Based On Lwe and Rlwementioning

confidence: 99%

Survey on Fully Homomorphic Encryption, Theory, and Applications

Marcolla¹,

Sucasas²,

Manzano³

et al. 2023

Preprint

0

View full text Add to dashboard Cite

This paper comprehensively addresses homomorphic encryption from both theoretical and practical perspectives. The paper delves into the mathematical foundations required to understand fully homomorphic encryption FHE. It consequently covers design fundamentals and security properties of FHE, and describes the main FHE schemes based on various mathematical problems. On a more practical level, the paper presents a view on privacy-preserving Machine Learning using homomorphic encryption, then surveys FHE at length from an engineering angle, covering the potential application of FHE in fog computing, and cloud computing services. It also provides a comprehensive analysis of existing state-of-the-art FHE libraries and tools, implemented in software and hardware, and the performance thereof.

show abstract

“…In [130] Boemer, Costache, Cammarota and Wierzynski introduced several optimizations, based on complex packing, to improve the runtime of scalar encoding and of ciphertext-plaintext addition and multiplication operations. Moreover, a different kind of complex packing was introduced by Kim and Song in [131]. In [132], Kim, Papadimitriou and Polyakov improved the usability of CKKS and its RNS variant proposing a new technique that minimizes the error during computation.…”

Section: F Fourth Generation: Fhe Based On Lwe and Rlwementioning

confidence: 99%

Survey on Fully Homomorphic Encryption, Theory, and Applications

Marcolla

¹

,

Sucasas

²

,

Manzano³

et al. 2022

View full text Add to dashboard Cite

Data privacy concerns are increasing significantly in the context of Internet of Things, cloud services, edge computing, artificial intelligence applications, and other applications enabled by next generation networks. Homomorphic Encryption addresses privacy challenges by enabling multiple operations to be performed on encrypted messages without decryption. This paper comprehensively addresses homomorphic encryption from both theoretical and practical perspectives. The paper delves into the mathematical foundations required to understand fully homomorphic encryption (FHE). It consequently covers design fundamentals and security properties of FHE, and describes the main FHE schemes based on various mathematical problems. On a more practical level, the paper presents a view on privacypreserving Machine Learning using homomorphic encryption, then surveys FHE at length from an engineering angle, covering the potential application of FHE in fog computing, and cloud computing services. It also provides a comprehensive analysis of existing state-of-the-art FHE libraries and tools, implemented in software and hardware, and the performance thereof.

show abstract

“…In [122] Boemer, Costache, Cammarota and Wierzynski introduced several optimizations, based on complex packing, to improve the runtime of scalar encoding and of ciphertextplaintext addition and multiplication operations. Moreover, a different kind of complex packing was introduced by Kim and Song in [123].…”

Section: F Fourth Generation: Fhe Based On Lwe and Rlwementioning

confidence: 99%

Survey on Fully Homomorphic Encryption, Theory and Applications

Marcolla¹,

Sucasas²,

Manzano³

et al. 2022

Preprint

1

0

View full text Add to dashboard Cite

This paper comprehensively addresses homomorphic encryption from both theoretical and practical perspectives. The paper delves into the mathematical foundations required to understand fully homomorphic encryption FHE. It consequently covers design fundamentals and security properties of FHE, and describes the main FHE schemes based on various mathematical problems. On a more practical level, the paper presents a view on privacy-preserving Machine Learning using homomorphic encryption, then surveys FHE at length from an engineering angle, covering the potential application of FHE in fog computing, and cloud computing services. It also provides a comprehensive analysis of existing state-of-the-art FHE libraries and tools, implemented in software and hardware, and the performance thereof.

show abstract

Approximate Homomorphic Encryption over the Conjugate-Invariant Ring

Cited by 8 publications

References 27 publications

Survey on Fully Homomorphic Encryption, Theory, and Applications

Survey on Fully Homomorphic Encryption, Theory, and Applications

Survey on Fully Homomorphic Encryption, Theory, and Applications

Survey on Fully Homomorphic Encryption, Theory and Applications

Contact Info

Product

Resources

About