# Homomorphic Encryption

@inproceedings{Halevi2017HomomorphicE, title={Homomorphic Encryption}, author={Shai Halevi}, booktitle={Tutorials on the Foundations of Cryptography}, year={2017} }

Fully homomorphic encryption (FHE) has been called the “Swiss Army knife of cryptography”, since it provides a single tool that can be uniformly applied to many cryptographic applications. In this tutorial we study FHE and describe its different properties, relations with other concepts in cryptography, and constructions. We briefly discuss the three generations of FHE constructions since Gentry’s breakthrough result in 2009, and cover in detail the thirdgeneration scheme of Gentry, Sahai, and…

## 130 Citations

### Zero-Knowledge Proof of Decryption for FHE Ciphertexts

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2018

The purpose of this paper is to provide a zero-knowledge proof of correct decryption on an FHE ciphertext, which for instance could hold the result of a cryptographic election.

### A General Purpose Transpiler for Fully Homomorphic Encryption

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2021

A fully homomorphic encryption transpiler that allows developers to convert high-level code that works on unencrypted data into high- level code that operates on encrypted data and lays the groundwork for eventual easy adoption of FHE by software developers.

### Conditionals in Homomorphic Encryption and Machine Learning Applications

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2018

It is shown how the implementation of conditionals clashes with the fundamental requirements of homomorphic encryption and could represent a drawback for its use as a complete solution for privacy preservation in data-based applications, in particular machine learning ones.

### SoK: Fully Homomorphic Encryption over the [Discretized] Torus

- Computer Science, MathematicsIACR Transactions on Cryptographic Hardware and Embedded Systems
- 2022

The inner-workings of TFHE, a torus-based fully homomorphic encryption scheme, are explained and its implementation on a discretized version of the torus is described.

### Guide to Fully Homomorphic Encryption over the [Discretized] Torus

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2021

The inner-workings of TFHE, a torus-based fully homomorphic encryption scheme, is explained and its implementation on a discretized version of the torus is described, including the technique of the programmable bootstrapping.

### A Survey of Various Cryptographic Techniques: From Traditional Cryptography to Fully Homomorphic Encryption

- Computer Science, MathematicsInnovations in Computer Science and Engineering
- 2019

Traditional and modern cryptography techniques along with the different schemes of HE and FHE are focused on, which enables the cloud service provider to carry out computations on ciphered data without decrypting it.

### Accelerating Homomorphic Encryption using Approximate Computing Techniques

- Computer ScienceICETE
- 2020

This novel approach to further approximate homomorphic encryption shows that it is possible for certain functions, where running time is of paramount importance, that further approximations can be made with a lower-impacting greater error.

### Improved Gentry's Fully Homomorphic Encryption Scheme: Design, Implementation and Performance Evaluation

- Computer Science, MathematicsCybHyg
- 2019

This paper presents a new Gentry scheme with additional encryption of the session key which minimizes the time for software encryption and decryption operations and increases cryptographic stability, software performance assessment and reliability of an algorithm as for cryptoanalysis.

### Practical Privacy-Preserving Data Science With Homomorphic Encryption: An Overview

- Computer Science2020 IEEE International Conference on Big Data (Big Data)
- 2020

This article focuses on how HE and data science can be leveraged to design and develop privacy-preserving enterprise applications and proposes a survey of main Homomorphic Encryption techniques and recent advances in the conubium between data science and HE.

### Comprehensive Performance Analysis of Homomorphic Cryptosystems for Practical Data Processing

- Computer Science, MathematicsArXiv
- 2022

It is suggested that partially homomorphic cryptosystems could be used today in certain practical applications, whereas time has not yet come for the fully homomorphic ones.

## References

SHOWING 1-10 OF 90 REFERENCES

### Implementing Gentry's Fully-Homomorphic Encryption Scheme

- Computer Science, MathematicsEUROCRYPT
- 2011

A working implementation of a variant of Gentry's fully homomorphic encryption scheme, similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010), with a number of optimizations that allow it to implement all aspects of the scheme, including the bootstrapping functionality.

### Fully Homomorphic Encryption over the Integers with Shorter Public Keys

- Mathematics, Computer ScienceIACR Cryptol. ePrint Arch.
- 2011

It is shown that fully homomorphic encryption can be implemented using simple arithmetic operations, and some optimizations from the recent Gentry-Halevi implementation of Gentry's scheme are obtained, roughly the same level of efficiency.

### i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2010

This work describes a specific DDH-based multi-hop homomorphic encryption scheme that does not suffer from this exponential blowup, and describes a re-randomizable variant of the Yao circuits that anyone can re-garble in such a way that even the party that generated the original garbled circuit cannot recognize it.

### Practical Bootstrapping in Quasilinear Time

- Computer Science, MathematicsCRYPTO
- 2013

The current state of the art, due to Gentry, Halevi, and Smart, is able to bootstrap “packed” ciphertexts in time only quasilinear O(λ) = λ · logO(1) λ in the security parameter.

### Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

- Computer Science, Mathematics2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
- 2011

A new blueprint for FHE is described, showing how to eliminate the squashing step, and thereby eliminate the need to assume that the sparse subset sum problem (SSSP) is hard, as all previous leveled FHE schemes have done.

### Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich

- Computer Science, Mathematics
- 2017

This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography,…

### (Leveled) fully homomorphic encryption without bootstrapping

- Computer Science, MathematicsITCS '12
- 2012

A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).

### Fully Homomorphic Encryption without bootstrapping

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2015

This book provides the new fully homomorphic encryption scheme without “bootstrapping” which runs fast for practical use and is immune from the attacks by the quantum computers.

### Candidate Constructions of Fully Homomorphic Encryption on Finite Simple Groups without Ciphertext Noise

- Mathematics, Computer Science
- 2015

This work proposes constructions of fully homomorphic encryption completely different from the previous work, using special kinds of non-commutativenite groups, and emphasizes that such a use of Tietze transformations in cryptology has no similar attempts in the literature and would have rich potential for further applications to other areas in Cryptology.

### Homomorphic encryption from codes

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2011

A new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes, which achieves "proto-homomorphic" properties in an elementary manner.