Eavesdropping games

DOI10.1145/333979.333980MaRDI QIDQ5385336zbMATH OpenOpenAlexFDO

Authors Matthew Franklin, Zvi Galil, Moti Yung

Publication date 5 May 2008

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/333979.333980

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Edge Eavesdropping Games
• Secure Hypergraphs: Privacy from Partial Broadcast
• Privacy in Non-private Environments
• scientific article; zbMATH DE number 1263179
• Privacy in non-private environments

Cited in

(21)

• Sweeping graphs with large clique number
• On the domination search number
• Monotonicity of strong searching on digraphs
• Complexity and monotonicity results for domination games
• Communication-optimal proactive secret sharing for dynamic groups
• Mixed Search Number of Permutation Graphs
• Edge Eavesdropping Games
• Fast searching games on graphs
• Searching expenditure and interval graphs
• Bounding the search number of graph products
• BOUNDARY-OPTIMAL TRIANGULATION FLOODING
• Connected subgraph defense games
• Distributed protocols against mobile eavesdroppers
• Fugitive-search games on graphs and related parameters
• Distributed CONGEST Algorithms against Mobile Adversaries
• Who started this rumor? Quantifying the natural differential privacy of gossip protocols
• Connected graph searching
• Monotonicity of the cops and robber game for bounded depth treewidth
• Strong-mixed searching and pathwidth
• A network game with attackers and a defender
• An annotated bibliography on guaranteed graph searching

This page was built for publication: Eavesdropping games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385336)