Sciweavers

145 search results - page 6 / 29
» Adversarial learning
Sort
View
COLT
2010
Springer
13 years 5 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari
ENTCS
2006
103views more  ENTCS 2006»
13 years 7 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
NSDI
2008
13 years 10 months ago
Exploiting Machine Learning to Subvert Your Spam Filter
Using statistical machine learning for making security decisions introduces new vulnerabilities in large scale systems. This paper shows how an adversary can exploit statistical m...
Blaine Nelson, Marco Barreno, Fuching Jack Chi, An...
CCS
2009
ACM
14 years 2 months ago
A framework for quantitative security analysis of machine learning
We propose a framework for quantitative security analysis of machine learning methods. Key issus of this framework are a formal specification of the deployed learning model and a...
Pavel Laskov, Marius Kloft
CRYPTO
2012
Springer
217views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Securing Circuits against Constant-Rate Tampering
We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et al. ...
Dana Dachman-Soled, Yael Tauman Kalai