Cart (Loading....) | Create Account
Close category search window

Towards More Efficient Distance Bounding Protocols for Use in Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Meadows, C. ; Naval Res. Lab., Washington, DC ; Syverson, P. ; LiWu Chang

In this paper we describe two secure protocols for estimating distance in sensor networks based on time of flight of signals. Both have lower message complexity and lower overhead than similar protocols offering the same degree of security. One is a distance bounding protocol, in which a dishonest node that is not in collusion with any other dishonest nodes can pretend to be further away than it is, but not any closer. Another is an authenticated distance estimation protocol in which an honest node can compute its distance from another honest node without fear of their communication being hijacked by an attacker. We provide a formal analysis to show that these protocols satisfy their security properties

Published in:

Securecomm and Workshops, 2006

Date of Conference:

Aug. 28 2006-Sept. 1 2006

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.