http://www.freestarwarsgamesgiveaway.com STAR WARS GAMES - Get the games for completely F...
Educational games - TEDxManhattanBeach - Sean Bouchard - Chocolate Covered Broccoli: Building Better...
http://freexboxgames.info Do you want to get your free xbox games for your xbox 360? You ...
http://www.freestarwarsgamesgiveaway.com Simply follow THREE simple steps to get free sta...
Check out Head Games on the Science Channel Saturdays at 9pm ET/PT. science.discovery.com
citeseer |
(0) (0 Votes)
|
Views: (1057) Date: (13-05-09) Pages: () |
Abstract: 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.