Eavesdropping games-Reference-Cited by-同舟云学术

Eavesdropping games

Published:2000-03 Issue:2 Volume:47 Page:225-243
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Franklin Matthew¹,Galil Zvi²,Yung Moti³

Affiliation:

1. Xerox PARC, Palo Alto, CA

2. Columbia Univ., New York, NY

3. CertCo Inc., New York, NY

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/333979.333980

Reference20 articles.

1. BIENSTOCK D. AND SEYMOUR P. 1991. Monotonicity in graph searching. J. Algorithms 12 230- 245. 10.1016/0196-6774(91)90003-H BIENSTOCK D. AND SEYMOUR P. 1991. Monotonicity in graph searching. J. Algorithms 12 230- 245. 10.1016/0196-6774(91)90003-H

2. BREISCH R. 1967. An intuitive approach to speleo-topology. Southwestern Cavers (published by the Southwestern Region of the National Speleological Society) 6 72-78. BREISCH R. 1967. An intuitive approach to speleo-topology. Southwestern Cavers (published by the Southwestern Region of the National Speleological Society) 6 72-78.

3. A Zero-One Law for Boolean Privacy

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed CONGEST Algorithms against Mobile Adversaries;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

2. Connected Subgraph Defense Games;Algorithmica;2021-08-01

3. Bounding the Search Number of Graph Products;KYUNGPOOK MATH J;2019

4. Connected Subgraph Defense Games;Algorithmic Game Theory;2019

5. Complexity and monotonicity results for domination games;Theoretical Computer Science;2016-05