A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 318-335
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme2013
- Estimating Key Sizes for High Dimensional Lattice-Based Systems2013
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based2013
- Lattice Signatures and Bimodal Gaussians2013
- ML Confidential: Machine Learning on Encrypted Data2013
- Batch Fully Homomorphic Encryption over the Integers2013
- Software Speed Records for Lattice-Based SignaturesLecture Notes in Computer Science, 2013
- Predicting Lattice Reduction2008
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsMathematical Programming, 1994
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982