Sciweavers

92 search results - page 8 / 19
» Minimizing Expected Attacking Cost in Networks
Sort
View
WINE
2005
Springer
179views Economy» more  WINE 2005»
14 years 1 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
PODC
2010
ACM
13 years 11 months ago
Bayesian ignorance
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having glob...
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tenne...
ADHOCNOW
2006
Springer
14 years 1 months ago
Authenticated In-Network Programming for Wireless Sensor Networks
Abstract. Current in-network programming protocols for sensor networks allow an attacker to gain control of the network or disrupt its proper functionality by disseminating malicio...
Ioannis Krontiris, Tassos Dimitriou
PET
2010
Springer
13 years 11 months ago
Impact of Network Topology on Anonymity and Overhead in Low-Latency Anonymity Networks
Abstract. Low-latency anonymous communication networks require padding to resist timing analysis attacks, and dependent link padding has been proven to prevent these attacks with m...
Claudia Díaz, Steven J. Murdoch, Carmela Tr...
JSAC
2008
73views more  JSAC 2008»
13 years 7 months ago
Quasi-Dynamic Network Design Considering Different Service Holding Times
Abstract-- We propose a quasi-dynamic network design algorithm considering traffic growth in multi-layered photonic networks that consist of electrical paths and optical paths. The...
Koichi Kanie, Hiroshi Hasegawa, Ken-ichi Sato