Fully homomorphic encryption (FHE) was first proposed by Ron Rivest, Leonard Adleman, and Michael Dertouzos in 1978, with the initial concept published in the paper "...".On Data Banks and Privacy Homomorphisms"; In 2009, Craig Gentry wrote in his paper "A Fully Homomorphic Encryption SchemeThe first truly homomorphic encryption scheme was proposed in the book, and it is known as the first generation of fully homomorphic encryption system.

A homomorphic encryption algorithm that simultaneously satisfies the properties of additive and multiplicative homomorphism is called fully homomorphic encryption. Fully homomorphic encryption is moving from theory to practical application, with efficiency improvements through algorithm optimization and hardware acceleration, demonstrating enormous potential in sensitive data areas such as privacy computing, healthcare, and finance.