Secure communication over radio channels

DOI10.1145/1400751.1400767zbMath1301.94112OpenAlexW2110818925MaRDI QIDQ2934337

Calvin Newport, Shlomi Dolev, Rachid Guerraoui

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) Network design and communication in computer systems (68M10) Cryptography (94A60) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (15)

Sade: competitive MAC under adversarial SINR ⋮ Colouring Non-sparse Random Intersection Graphs ⋮ Deterministic multi-channel information exchange ⋮ Competitive throughput in multi-hop wireless networks despite adaptive jamming ⋮ Who are you? Secure identities in single hop ad hoc networks ⋮ Broadcasting in an Unreliable SINR Model. ⋮ Selected combinatorial problems through the prism of random intersection graphs models ⋮ Modeling radio networks ⋮ Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks ⋮ On the chromatic number of non-sparse random intersection graphs ⋮ Monitoring churn in wireless networks ⋮ Secure and self-stabilizing clock synchronization in sensor networks ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ A resource-competitive jamming defense ⋮ Efficient and competitive broadcast in multi-channel radio networks

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