145 search results - page 23 / 29 » Adversarial learning |
112
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order...
111
click to vote
PIMRC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this work, we investigate secret key generation from channel states. We point out, by means of a packet-delaybased attack, that observing its own channel states is not the only ...
130
click to vote
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
CORR
2004
Springer
15 years 7 days ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
110
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...