Edge eavesdropping games

Amos Beimel, Matthew Franklin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - 5th International Conference, SCN 2006, Proceedings
PublisherSpringer Verlag
Pages1-17
Number of pages17
ISBN (Print)3540380809, 9783540380801
DOIs
StatePublished - 1 Jan 2006
Event5th International Conference on Security and Cryptography for Networks, SCN 2006 - Maiori, Italy
Duration: 6 Sep 20068 Sep 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4116 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Security and Cryptography for Networks, SCN 2006
Country/TerritoryItaly
CityMaiori
Period6/09/068/09/06

Keywords

  • Graph search games
  • Mobile adversary
  • Passive adversary
  • Unconditional security

Fingerprint

Dive into the research topics of 'Edge eavesdropping games'. Together they form a unique fingerprint.

Cite this