Sciweavers

12 search results - page 1 / 3
» On Ideal Lattices and Learning with Errors over Rings
Sort
View
EUROCRYPT
2010
Springer
13 years 9 months ago
On Ideal Lattices and Learning with Errors over Rings
Vadim Lyubashevsky, Chris Peikert, Oded Regev
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
12 years 4 months ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 3 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
ANTS
2010
Springer
274views Algorithms» more  ANTS 2010»
13 years 8 months ago
Learning with Errors over Rings
Oded Regev
HYBRID
2010
Springer
13 years 11 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan