@inproceedings{3e1c9ca4181540abb5e14535501c23fd,
title = "Edge eavesdropping games",
abstract = "Motivated by the proactive security problem, we study the question of maintaining secrecy against a mobile eavesdropper that can eavesdrop to a bounded number of communication channels in each round of the protocol. We characterize the networks in which secrecy can be maintained against an adversary that can eavesdrop to t channels in each round. Using this characterization, we analyze the number of eavesdropped channels that complete graphs can withhold while maintaining secrecy.",
keywords = "Graph search games, Mobile adversary, Passive adversary, Unconditional security",
author = "Amos Beimel and Matthew Franklin",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11832072\_1",
language = "English",
isbn = "3540380809",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--17",
booktitle = "Security and Cryptography for Networks - 5th International Conference, SCN 2006, Proceedings",
address = "Germany",
note = "5th International Conference on Security and Cryptography for Networks, SCN 2006 ; Conference date: 06-09-2006 Through 08-09-2006",
}