Sciweavers

12 search results - page 2 / 3
» On Ideal Lattices and Learning with Errors over Rings
Sort
View
EUROCRYPT
2010
Springer
13 years 10 months ago
Fully Homomorphic Encryption over the Integers
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
Marten van Dijk, Craig Gentry, Shai Halevi, Vinod ...
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
11 years 7 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus
ASIACRYPT
2011
Springer
12 years 5 months ago
Functional Encryption for Inner Product Predicates from Learning with Errors
We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty of the learning with errors (LWE) problem. This co...
Shweta Agrawal, David Mandell Freeman, Vinod Vaiku...
INTERSPEECH
2010
13 years 7 days ago
Learning a language model from continuous speech
This paper presents a new approach to language model construction, learning a language model not from text, but directly from continuous speech. A phoneme lattice is created using...
Graham Neubig, Masato Mimura, Shinsuke Mori, Tatsu...
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
13 years 10 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean