SoK: Fully Homomorphic Encryption over the [Discretized] Torus
First posed as a challenge in 1978 by Rivest et al., fully homomorphic encryption—the ability to evaluate any function over encrypted data—was only solved in 2009 in a breakthrough result by Gentry (Commun. ACM, 2010). After a decade of intense research, practical solutions have emerged and are bei...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Ruhr-Universität Bochum
2022-08-01
|
| Serie: | Transactions on Cryptographic Hardware and Embedded Systems |
| Soggetti: | |
| Accesso online: | https://ojs-dev.ub.rub.de/index.php/TCHES/article/view/9836 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|