(Leveled) fully homomorphic encryption without bootstrapping
Top Cited Papers
- 8 January 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 309-325
- https://doi.org/10.1145/2090236.2090262
Abstract
No abstract availableKeywords
Funding Information
- Defense Advanced Research Projects Agency (FA8750-11-C-0096FA8750-11-2-0225)
This publication has 15 references indexed in Scilit:
- Implementing Gentry’s Fully-Homomorphic Encryption SchemeLecture Notes in Computer Science, 2011
- Fully Homomorphic Encryption over the IntegersLecture Notes in Computer Science, 2010
- On Ideal Lattices and Learning with Errors over RingsLecture Notes in Computer Science, 2010
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext SizesLecture Notes in Computer Science, 2010
- Additively Homomorphic Encryption with d-Operand MultiplicationsLecture Notes in Computer Science, 2010
- Faster Fully Homomorphic EncryptionLecture Notes in Computer Science, 2010
- Fully homomorphic encryption using ideal latticesPublished by Association for Computing Machinery (ACM) ,2009
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning ProblemsLecture Notes in Computer Science, 2009
- Evaluating Branching Programs on Encrypted DataPublished by Springer Science and Business Media LLC ,2007
- Evaluating 2-DNF Formulas on CiphertextsLecture Notes in Computer Science, 2005