Homo- (Greek prefix meaning ‘same’); -morphic (Greek suffix meaning ‘having a specific shape/form’)
Intuitively, one could deduct that homomorphic encryption indicates that the initial data and the encrypted result (cipher) could share the same form. Based on this property, it can be inferred that computation can be performed on the encrypted data, without prior decryption. By decrypting the result, you get the same output as the computation performed on the unencrypted data. While homomorphic encryption can be either additive or multiplicative, fully homomorphic encryption supports both types of operations. Unlike ZKPs, which are proofs of computational integrity, fully homomorphic encryption allows for encrypted data computation, without revealing additional information about the original data. This could provide the missing link for ensuring private transactions on blockchains’ public ledgers.
We were joined by Rand Hindi, CEO of Zama, to discuss fully homomorphic encryption solutions, how they differ from ZKPs & MPC, and how they can be leveraged to ensure compliant programmable privacy.
Topics covered in this episode:
- Rand’s background and his interest in privacy
- Meeting Pascal and founding Zama
- Fully homomorphic encryption (FHE)
- Zero knowledge proofs vs. Multi-party computation vs. Fully homomorphic encryption
- Taking fully homomorphic encryption 'mainstream'
- Zama’s products
- fhEVM
- How multi-party computation would secure fhEVM
- Multi-key homomorphic encryption & functional encryption
- Deploying an FHE rollup
- FHE use cases
- Privacy
- Zama’s business model
Episode links:
Sponsors:
- dYdX Foundation: The recently launched dYdX chain features new governance and token economics, that empower stakers and promote validator decentralisation. Bridge your DYDX tokens and contribute to the evolution of dYdX chain, fully permissionless and community driven. - https://bit.ly/47kqG59
This episode is hosted by Friederike Ernst. Show notes and listening options: epicenter.tv/523
