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. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Beimel, A., & Franklin, M. (2006). Edge eavesdropping games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4116 LNCS, pp. 1–17). Springer Verlag. https://doi.org/10.1007/11832072_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
