FHE as a Puzzle Piece
Blog post from Zama
The text discusses the complexity and intricacies of Fully Homomorphic Encryption (FHE), contrasting it with the more straightforward RSA encryption scheme. It emphasizes that while RSA is commonly used as a beginner's introduction to cryptography, it is often oversimplified and rarely used in its textbook form due to security vulnerabilities. Instead, FHE should be viewed as a multi-party computation (MPC) protocol rather than a simple encryption scheme, involving multiple entities such as Alice, Bob, Charlie, and an adversary, Eve. Each entity plays a role in the encryption, decryption, and computation process, and the protocol must accommodate potentially dishonest participants. The text highlights the need for additional cryptographic constructs like zero-knowledge proofs and verifiable computation to ensure the integrity and security of FHE. It also discusses strategies such as using multiple parties to avoid single points of failure and underscores the importance of viewing FHE within a broader cryptographic context to effectively manage adversarial threats.