Sciweavers

145 search results - page 13 / 29
» Adversarial learning
Sort
View
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
13 years 6 months ago
Subspace LWE
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
Krzysztof Pietrzak
ICML
2003
IEEE
15 years 11 months ago
BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
Vincent Conitzer, Tuomas Sandholm
EUROCRYPT
2000
Springer
15 years 2 months ago
Exposure-Resilient Functions and All-or-Nothing Transforms
Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key...
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kus...
JSAC
2010
188views more  JSAC 2010»
14 years 5 months ago
Random-walk based approach to detect clone attacks in wireless sensor networks
Abstract--Wireless sensor networks (WSNs) deployed in hostile environments are vulnerable to clone attacks. In such attack, an adversary compromises a few nodes, replicates them, a...
Yingpei Zeng, Jiannong Cao, Shigeng Zhang, Shanqin...
KESAMSTA
2010
Springer
15 years 3 months ago
Classifying Agent Behaviour through Relational Sequential Patterns
Abstract. In Multi-Agent System, observing other agents and modelling their behaviour represents an essential task: agents must be able to quickly adapt to the environment and infe...
Grazia Bombini, Nicola Di Mauro, Stefano Ferilli, ...