@dinoxint999

The origin of Fully Homomorphic Encryption (FHE) dates back to 1978, when Rivest, Adleman, and Dertouzos introduced the concept of “privacy homomorphisms”, allowing computations on encrypted data without decryption. However, at that time, no practical method existed to realize this idea. From the 1980s to 2000s, partially homomorphic encryption (PHE) schemes emerged, supporting only a single type of operation: RSA and ElGamal supported multiplicative homomorphism, while Paillier supported additive homomorphism. These schemes were still not powerful enough to become fully homomorphic. A breakthrough occurred in 2009, when Craig Gentry (IBM) published the first practical FHE design in his PhD dissertation at Stanford, using ideal lattices and the bootstrapping technique to remove noise. From the 2010s onward, many new FHE schemes and libraries, such as BGV, BFV, CKKS, and TFHE, have been developed, bringing the technology closer to practical applications. #ZamaCreatorProgram FHE of @zama.. next content 👀

0 reply

0 recast

1 reaction