Secure communication over radio channels

DOI10.1145/1400751.1400767MaRDI QIDQ2934337zbMATH OpenOpenAlexFDO

Authors Shlomi Dolev, Calvin Newport, Rachid Guerraoui, Seth Gilbert

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/124979

zbMATH Keywords

randomized algorithmswireless radio networksmalicious (Byzantine) interference

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Cryptography (94A60) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Reliable communication over partially authenticated networks
• scientific article; zbMATH DE number 1304089
• scientific article; zbMATH DE number 2086727
• Broadcast in radio networks tolerating Byzantine adversarial behavior
• Perfectly secure message transmission

Cited in

(17)

• Efficient and competitive broadcast in multi-channel radio networks
• Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks
• Colouring Non-sparse Random Intersection Graphs
• Competitive throughput in multi-hop wireless networks despite adaptive jamming
• Monitoring churn in wireless networks
• Broadcasting in an Unreliable SINR Model.
• Secure and self-stabilizing clock synchronization in sensor networks
• Sade: competitive MAC under adversarial SINR
• Leveraging channel diversity to gain efficiency and robustness for wireless broadcast
• Deterministic multi-channel information exchange
• Enabling short fragments for uncoordinated spread spectrum communication
• Who are you? Secure identities in single hop ad hoc networks
• Trusted computing for fault-prone wireless networks
• Selected combinatorial problems through the prism of random intersection graphs models
• Modeling radio networks
• A resource-competitive jamming defense
• On the chromatic number of non-sparse random intersection graphs

This page was built for publication: Secure communication over radio channels

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