Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A zero-one law for Boolean privacy
SIAM Journal on Discrete Mathematics
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
Perfectly secure message transmission
Journal of the ACM (JACM)
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Distributed pursuit-evasion: some aspects of privacy and security in distributed computing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the domination search number
Discrete Applied Mathematics
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing
Searching expenditure and interval graphs
Discrete Applied Mathematics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A Self-stabilizing Algorithm for Graph Searching in Trees
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Searching cycle-disjoint graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Arc searching digraphs without jumping
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Fast searching games on graphs
Journal of Combinatorial Optimization
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Boundary-Optimal triangulation flooding
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Information and Computation
Lower bounds on edge searching
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.01 |
We initiate a graph-theoretic study of privacy in distributed environments with mobile eavesdroppers ("bugs"). For two privacy tasks—distributed database maintenance and message transmission—a computationally unbounded adversary “plays an eavesdrpping game,” coordinating the moment of the bugs among the sites to learn the current memory contents. Many different adversaries are considered, motivated by differences in eavesdropping technologies. We characterize the feasibility of the two privacy tasks combinatorially, construct protocols for the feasible cases, and analyze their computational complexity.