Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11832072_1 | Security in Communication Networks |
Keywords | Field | DocType |
proactive security problem,complete graph,bounded number,eavesdropped channel,mobile eavesdropper,communication channel,mobile adversary,unconditional security,graph search games.,edge eavesdropping game,passive adversary,communication channels | Complete graph,Graph,Eavesdropping,Computer science,Computer security,Cryptography,Secrecy,Communication channel,Adversary,Distributed computing,Bounded function | Conference |
Volume | ISSN | ISBN |
4116 | 0302-9743 | 3-540-38080-9 |
Citations | PageRank | References |
1 | 0.35 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amos Beimel | 1 | 1079 | 64.40 |
| Matthew K. Franklin | 2 | 959 | 119.11 |