Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- 1 January 2010
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Bonsai Trees, or How to Delegate a Lattice BasisLecture Notes in Computer Science, 2010
- Fully homomorphic encryption using ideal latticesPublished by Association for Computing Machinery (ACM) ,2009
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance ProblemLecture Notes in Computer Science, 2009
- Trapdoors for hard lattices and new cryptographic constructionsPublished by Association for Computing Machinery (ACM) ,2008
- Asymptotically Efficient Lattice-Based Digital SignaturesPublished by Springer Science and Business Media LLC ,2008
- Generalized Compact Knapsacks Are Collision ResistantLecture Notes in Computer Science, 2006
- Generating Hard Instances of the Short Basis ProblemLecture Notes in Computer Science, 1999
- Subquadratic-time factoring of polynomials over finite fieldsPublished by Association for Computing Machinery (ACM) ,1995
- New bounds in some transference theorems in the geometry of numbersMathematische Annalen, 1993
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982