Distributed protocols against mobile eavesdroppers

DOI10.1007/BFB0022145MaRDI QIDQ6084554zbMATH OpenOpenAlexFDO

Authors P. G. Spirakis, B. Tampakas, Hera Antonopoulou

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) Network protocols (68M12) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3934919
• Probabilistic Key Predistribution in Mobile Networks Resilient to Node-Capture Attacks
• Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
• scientific article; zbMATH DE number 1583940
• scientific article; zbMATH DE number 2084801

Cites work

• A Chernoff Bound for Random Walks on Expander Graphs
• Eavesdropping games
• How to withstand mobile virus attacks (extended abstract)
• scientific article; zbMATH DE number 4050992 (Why is no real title available?)
• Maximum hitting time for random walks on graphs
• On a random walk problem arising in self-stabilizing token management
• The complexity of searching a graph

Cited in

(3)

• Distributed call-tracking for security
• Probabilistic Key Predistribution in Mobile Networks Resilient to Node-Capture Attacks
• scientific article; zbMATH DE number 2084801 (Why is no real title available?)

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

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