| Cryptology (3) |  |
| Homomorphic encryption (2) | |
Cryptographers have designed schemes such as homomorphic encryption 9 that allow verifiable computation on encrypted data. However, the proposed schemes are too inefficient
Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st annual ACM symposium on Theory of computing, Bethesda, MD, USA.
< Back - Next >
Overtext Web Module V3.0 Alpha
Copyright Semantic-Knowledge, 1994-2011