Sciweavers

145 search results - page 10 / 29
» Adversarial learning
Sort
View
ACSAC
2005
IEEE
14 years 1 months ago
Lessons Learned: A Security Analysis of the Internet Chess Club
The Internet Chess Club (ICC) is a popular online chess server with more than 30,000 members worldwide including various celebrities and the best chess players in the world. Altho...
John Black, Martin Cochran, Martin Ryan Gardner
ISW
2007
Springer
14 years 1 months ago
Strongly-Secure Identity-Based Key Agreement and Anonymous Extension
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle mod...
Sherman S. M. Chow, Kim-Kwang Raymond Choo
COLT
2008
Springer
13 years 9 months ago
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs
Prediction from expert advice is a fundamental problem in machine learning. A major pillar of the field is the existence of learning algorithms whose average loss approaches that ...
Elad Hazan, Satyen Kale
ADMA
2009
Springer
246views Data Mining» more  ADMA 2009»
14 years 2 months ago
Semi Supervised Image Spam Hunter: A Regularized Discriminant EM Approach
Image spam is a new trend in the family of email spams. The new image spams employ a variety of image processing technologies to create random noises. In this paper, we propose a s...
Yan Gao, Ming Yang, Alok N. Choudhary
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs