Edge eavesdropping games

Authors:
Amos Beimel;Matthew Franklin
Affiliations:
Department of Computer Science, Ben-Gurion University;Department of Computer Science, University of California, Davis
Venue:
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Year:
2006

Citing 9
Cited 0

Searching and pebbling

Theoretical Computer Science
Monotonicity in graph searching

Journal of Algorithms
How to withstand mobile virus attacks (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

Journal of the ACM (JACM)
Secure distributed storage and retrieval

Theoretical Computer Science
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract)

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Optimal Resiliency Against Mobile Faults

FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing

Quantified Score

Hi-index	0.00

Visualization

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.