Distributed protocols against mobile eavesdroppers

DOI10.1007/bfb0022145zbMath1524.68018OpenAlexW2113215250MaRDI QIDQ6084554

Paul G. Spirakis, Hera Antonopoulou, B. Tampakas

Publication date: 1 December 2023

Published in: Distributed Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0022145

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Cites Work

• Unnamed Item
• The complexity of searching a graph
• Maximum hitting time for random walks on graphs
• A Chernoff Bound for Random Walks on Expander Graphs
• How to withstand mobile virus attacks (extended abstract)
• On a random walk problem arising in self-stabilizing token management
• Eavesdropping games

This page was built for publication: Distributed protocols against mobile eavesdroppers