> 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

> 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.