1058 search results - page 145 / 212 » It's Doomed; We Can Prove It |
ASIACRYPT
2010
Springer
13 years 8 months ago
2010
Springer
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
CRYPTO
2011
Springer
12 years 9 months ago
2011
Springer
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 ...
TKDE
2012
12 years 11 days ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
COLT
2001
Springer
14 years 2 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
JAC
2008
13 years 11 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...