Sciweavers

978 search results - page 8 / 196
» Knowledge, Probability, and Adversaries
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries
Resource and cost constraints remain a challenge for wireless sensor network security. In this paper, we propose a new approach to protect confidentiality against a parasitic adver...
Jun Luo, Panos Papadimitratos, Jean-Pierre Hubaux
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
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
14 years 26 days ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 7 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
ESA
2003
Springer
99views Algorithms» more  ESA 2003»
14 years 18 days ago
Adversary Immune Leader Election in ad hoc Radio Networks
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
Miroslaw Kutylowski, Wojciech Rutkowski