We consider secure positioning in wireless environments where mobile nodes use a trusted infrastructure to prove their location: a node claims a position and wants to prove to the verification infrastructure that it is actually located in that position. We propose a system that uses the notion of dynamic verifiers and provides security against collusion attack in which the adversary corrupts a set of nodes and its aim is to claim a position where none of the corrupted nodes are located. We give a detailed analysis of the system and show that under reasonable assumptions the protocol will reject false claims and the success probability of the adversary can be made arbitrarily small. We also give the results of our simulation that closely match the analysis. Our protocol is the first secure positioning protocol with security against collusion attack. © 2011 Springer-Verlag.
CITATION STYLE
Safa, N. A., Sarkar, S., Safavi-Naini, R., & Ghaderi, M. (2011). Secure localization using dynamic verifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6879 LNCS, pp. 1–20). Springer Verlag. https://doi.org/10.1007/978-3-642-23822-2_1
Mendeley helps you to discover research relevant for your work.