Fully homomorphic encryption using ideal lattices
- 31 May 2009
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 169-178
- https://doi.org/10.1145/1536414.1536440
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Polly Two : A New Algebraic Polynomial-based Public-Key SchemeApplicable Algebra in Engineering, Communication and Computing, 2006
- Quantum Algorithms for Some Hidden Shift ProblemsSIAM Journal on Computing, 2006
- Evaluating 2-DNF Formulas on CiphertextsLecture Notes in Computer Science, 2005
- Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problemMathematics of Computation, 2001
- On the multiplicative complexity of Boolean functions over the basisTheoretical Computer Science, 2000
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- On the minimum distance of some quadratic residue codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978