olemus
homomorfne krüpteerimise liik:
- säilitab mingi sellise tehtestiku, mis
- võimaldab krüptogrammidega (neid dekrüpteerimata) tehteid sooritades teha suvalisi arvutusi
vastavate avatekstidega
- esimene algoritm (võrepõhine) 2009, Craig Gentry

ülevaateid
https://www.inpher.io/technology/what-is-fully-homomorphic-encryption

https://en.wikipedia.org/wiki/Homomorphic_encryption

http://blog.higashi.tech/2020/06/16/fhe_01.html

https://vitalik.ca/general/2020/07/20/homomorphic.html

https://blog.nucypher.com/an-engineers-guide-to-fully-homomorphic-encryption/

https://crypto.stanford.edu/~dwu4/fhe-project.html

https://www.maths.ox.ac.uk/system/files/attachments/FHE1.pptx

https://sites.math.washington.edu/~morrow/336_14/papers/mitchell.pdf

https://eprint.iacr.org/2015/1192.pdf