Sciweavers

3328 search results - page 208 / 666
» On Plateaued Functions and Their Constructions
Sort
View
CRYPTO
2009
Springer
131views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
Benny Applebaum, David Cash, Chris Peikert, Amit S...
WEA
2005
Springer
138views Algorithms» more  WEA 2005»
16 years 2 days ago
A Practical Minimal Perfect Hashing Method
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Zi...
ECML
2000
Springer
15 years 11 months ago
Layered Learning
We examine how a network of many knowledge layers can be constructed in an on-line manner, such that the learned units represent building blocks of knowledge that serve to compres...
Peter Stone, Manuela M. Veloso
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
15 years 10 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
FOGA
1994
15 years 8 months ago
Stability of Vertex Fixed Points and Applications
In the Infinite Population Simple Genetic Algorithm, stability of fixed points is considered when mutation is zero. The analysis is based on the spectrum of the differential of th...
Michael D. Vose, Alden H. Wright