Formal Analysis of Secure Neighbor Discovery in Wireless Networks

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.


Published in:
Ieee Transactions On Dependable And Secure Computing, 10, 6, 355-367
Year:
2013
Publisher:
Los Alamitos, Ieee Computer Soc
ISSN:
1545-5971
Keywords:
Laboratories:




 Record created 2013-12-09, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)