000124979 001__ 124979
000124979 005__ 20190117210459.0
000124979 037__ $$aCONF
000124979 245__ $$aSecure Communication Over Radio Channels
000124979 260__ $$c2008
000124979 269__ $$a2008
000124979 336__ $$aConference Papers
000124979 520__ $$aWe study the problem of secure communication in a multi-channel, single-hop radio network with a malicious adversary that can cause collisions and spoof messages. We assume no pre-shared secrets or trusted-third-party infrastructure. The main contribution of this paper is f-AME: a randomized (f)ast-(A)uthenticated (M)essage (E)xchange protocol that enables nodes to exchange messages in a reliable and authenticated manner. It runs in O(|E|t^2 log n) time and has optimal resilience to disruption, where E is the set of pairs of nodes that need to swap messages, n is the total number of nodes, C the number of channels, and t < C the number of channels on which the adversary can participate in each round. We then show how to use f-AME to establish of a shared secret group key, which can be used to implement a secure, reliable and authenticated long-lived communication service. The resulting service requires O(nt^3 log n) rounds for the setup phase, and O(t log n) rounds for an arbitrary pair to communicate. By contrast, existing solutions in this setting rely on pre-shared secrets, trusted third-party infrastructure, and/or the assumption that all interference is non-malicious.
000124979 6531_ $$aWireless Radio Networks
000124979 6531_ $$aMalicious (Byzantine) Interference
000124979 6531_ $$aRandomized Algorithms
000124979 6531_ $$aNCCR-MICS
000124979 6531_ $$aNCCR-MICS/CL1
000124979 700__ $$aDolev, Shlomi
000124979 700__ $$0240435$$aGilbert, Seth$$g176464
000124979 700__ $$0240335$$aGuerraoui, Rachid$$g105326
000124979 700__ $$aNewport, Calvin
000124979 7112_ $$a27th Annual Symposium on Principles of Distributed Computing$$cToronto, Canada$$dAugust, 2008
000124979 773__ $$tProceedings of the 27th Annual Symposium on Principles of Distributed Computing
000124979 8564_ $$uhttp://www.podc.org/podc2008/$$zURL
000124979 8564_ $$s255105$$uhttps://infoscience.epfl.ch/record/124979/files/Point2Point.pdf$$zn/a
000124979 909C0 $$0252114$$pDCL$$xU10407
000124979 909CO $$ooai:infoscience.tind.io:124979$$pconf$$pIC
000124979 937__ $$aLPD-CONF-2008-023
000124979 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000124979 980__ $$aCONF