Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

Authors:
M. Franklin;Z. Galil;M. Yung
Affiliations:
Columbia Univ., NY, USA;Columbia Univ., NY, USA;-
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 3

Maintaining Security in the Presence of Transient Faults

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On the Domination Search Number

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
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

We initiate a graph-theoretic approach to study the (information-theoretic) maintenance of privacy in distributed environments in the presence of a bounded number of mobile eavesdroppers ("bugs"). For two fundamental privacy problems-secure message transmission and distributed database maintenance-we assume an adversary is "playing eavesdropping games," coordinating the movement of the bugs among the sites to learn the current memory contents. We consider various mobility settings (adversaries), motivated by the capabilities (strength) of the bugging technologies (e.g., how fast can a bug be reassigned). We combinatorially characterize and compare privacy maintenance problems, determine their feasibility (under numerous bug models), suggest protocols for the feasible cases, and analyze their computational complexity.