3 ms·

honestly FHE is voodoo to me

• 3np 5y ago
  Maybe it helps to think of HE you're already familiar with. For example, RSA is homomorphic under multiplication - so you can multiply two ciphertexts and get back an encrypted result. If this can be done for the right subset of operations, you can construct a fully homomorphic scheme. To get anything deeper than that intuitive understanding you'd have to dive into individual protocols :) https://crypto.stackexchange.com/questions/3555/homomorphic-cryptosystems-in-rsa https://crypto.stackexchange.com/questions/3555/homomorphic-...
  • schoen 5y ago
    > For example, RSA is homomorphic under multiplication - so you can multiply two ciphertexts and get back an encrypted result. That's also related to why blind signatures work, but also to why RSA padding is necessary (to intentionally break this property!). https://en.wikipedia.org/wiki/Blind_signature#Blind_RSA_signatures https://en.wikipedia.org/wiki/Blind_signature#Blind_RSA_sign... https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Attacks_against_plain_RSA https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Attacks_aga... I guess blind signatures may also helpful for this intuition.
• jcbsd 5y ago
  Check this out: https://6min.zama.ai https://6min.zama.ai Helps to demystify the voodoo :)