Access the full text.
Sign up today, get DeepDyve free for 14 days.
AbstractWe describe a practical fully homomorphic encryption (FHE) scheme based on homomorphisms between rings and show that it enables very efficient computation on encrypted data.Our encryption though is private-key; public information is only used to operate on encrypted data without decrypting it.Still, we show that our method allows for a third party search on encrypted data.
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.