Fully Homomorphic Encryption with Polylog Overhead
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 465-482
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Can homomorphic encryption be practical?2011
- Efficient Fully Homomorphic Encryption from (Standard) LWE2011
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages2011
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme2011
- On Ideal Lattices and Learning with Errors over Rings2010
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes2010
- Faster Fully Homomorphic Encryption2010
- Fully homomorphic encryption using ideal lattices2009
- A Permutation NetworkJournal of the ACM, 1968
- Optimal Rearrangeable Multistage Connecting NetworksBell System Technical Journal, 1964