Can homomorphic encryption be practical?
- 21 October 2011
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 113-124
- https://doi.org/10.1145/2046660.2046682
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Better Key Sizes (and Attacks) for LWE-Based EncryptionLecture Notes in Computer Science, 2011
- 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
- Toward Basing Fully Homomorphic Encryption on Worst-Case HardnessLecture Notes in Computer Science, 2010
- Faster Fully Homomorphic EncryptionLecture Notes in Computer Science, 2010
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning ProblemsLecture Notes in Computer Science, 2009
- SWIFFT: A Modest Proposal for FFT HashingLecture Notes in Computer Science, 2008
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- Evaluating 2-DNF Formulas on CiphertextsLecture Notes in Computer Science, 2005
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997