The Community for Technology Leaders
Green Image
Issue No. 06 - Nov.-Dec. (2013 vol. 10)
ISSN: 1545-5971
pp: 355-367
Marcin Poturalski , Swiss Fed. Inst. of Technol. in Lausanne, Lausanne, Switzerland
Panos Papadimitratos , R. Inst. of Technol., Stockholm, Sweden
Jean-Pierre Hubaux , Swiss Fed. Inst. of Technol. in Lausanne, Lausanne, Switzerland
We develop a formal framework for the analysis of security protocols in wireless networks. The framework captures characteristics necessary to reason about neighbor discovery protocols, such as the neighbor relation, device location, and message propagation time. We use this framework to establish general results about the possibility of neighbor discovery. In particular, we show that time-based protocols cannot in general provide secure neighbor discovery. Given this insight, we also use the framework to prove the security of four concrete neighbor discovery protocols, including two novel time-and-location-based protocols. We mechanize the model and some proofs in the theorem prover Isabelle.
Wireless networks, Formal verification, Knowledge discovery, Computer security, Security of data,distance bounding, Neighbor discovery, relay attack, formal verification
Marcin Poturalski, Panos Papadimitratos, Jean-Pierre Hubaux, "Formal Analysis of Secure Neighbor Discovery in Wireless Networks", IEEE Transactions on Dependable and Secure Computing, vol. 10, no. , pp. 355-367, Nov.-Dec. 2013, doi:10.1109/TDSC.2013.17
385 ms
(Ver 3.3 (11022016))