Computer Science – Cryptography and Security
Scientific paper
2010-03-28
Computer Science
Cryptography and Security
22 pages, Appeared in Foundations of Computer Security, (Affiliated workshop of LICS 2009, Los Angeles, CA).
Scientific paper
Distance bounding protocols are used by nodes in wireless networks to calculate upper bounds on their distances to other nodes. However, dishonest nodes in the network can turn the calculations both illegitimate and inaccurate when they participate in protocol executions. It is important to analyze protocols for the possibility of such violations. Past efforts to analyze distance bounding protocols have only been manual. However, automated approaches are important since they are quite likely to find flaws that manual approaches cannot, as witnessed in literature for analysis pertaining to key establishment protocols. In this paper, we use the constraint solver tool to automatically analyze distance bounding protocols. We first formulate a new trace property called Secure Distance Bounding (SDB) that protocol executions must satisfy. We then classify the scenarios in which these protocols can operate considering the (dis)honesty of nodes and location of the attacker in the network. Finally, we extend the constraint solver so that it can be used to test protocols for violations of SDB in these scenarios and illustrate our technique on some published protocols.
Bruhadeshwar Bezawada
Kothapalli Kishore
Malladi Sreekanth
No associations
LandOfFree
Automatic analysis of distance bounding protocols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Automatic analysis of distance bounding protocols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic analysis of distance bounding protocols will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-127787