Sciweavers

107 search results - page 6 / 22
» On derivations of lattices
Sort
View
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
14 years 1 months ago
Public-Key Cryptosystems from Lattice Reduction Problems
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the ...
Oded Goldreich, Shafi Goldwasser, Shai Halevi
GECCO
2004
Springer
14 years 3 months ago
Modeling Selection Intensity for Toroidal Cellular Evolutionary Algorithms
We present quantitative models for the selection pressure of cellular evolutionary algorithms structured in two dimensional regular lattices. We derive models based on probabilisti...
Mario Giacobini, Enrique Alba, Andrea Tettamanzi, ...
EUROCRYPT
2011
Springer
13 years 1 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
ECCC
2006
97views more  ECCC 2006»
13 years 9 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
QI
2009
Springer
130views Physics» more  QI 2009»
14 years 4 months ago
Eraser Lattices and Semantic Contents
A novel way to define Quantum like measurements for text is through transformations called Selective Erasers. When applied to text, an Eraser acts like a filter and preserves par...
Alvaro Francisco Huertas-Rosero, Leif Azzopardi, C...