Change search
ReferencesLink to record
Permanent link

Direct link
Formal Analysis of Secure Neighbor Discovery in Wireless Networks
KTH, School of Electrical Engineering (EES), Communication Networks.
2013 (English)Report (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Keyword [en]
neighbor discovery, relay attack, formal verication, distance bounding
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-116106OAI: diva2:590710

QC 20130212

Available from: 2013-01-21 Created: 2013-01-15 Last updated: 2013-02-12Bibliographically approved

Open Access in DiVA

No full text

Other links

EPFL Technical Report 167782

Search in DiVA

By author/editor
Papadimitratos, Panagiotis
By organisation
Communication Networks
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 48 hits
ReferencesLink to record
Permanent link

Direct link