Application of distance bounding protocols with random challenges over RFID noisy communication systems
Application of distance bounding protocols with random challenges over RFID noisy communication systems
- Author(s): A. Falahati and H. Jannati
- DOI: 10.1049/cp.2012.0607
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
IET Conference on Wireless Sensor Systems (WSS 2012) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): A. Falahati and H. Jannati Source: IET Conference on Wireless Sensor Systems (WSS 2012), 2012 page ()
- Conference: IET Conference on Wireless Sensor Systems (WSS 2012)
- DOI: 10.1049/cp.2012.0607
- ISBN: 978-1-84919-625-3
- Location: London, UK
- Conference date: 18-19 June 2012
- Format: PDF
Distance bounding protocols are proposed based upon the round trip time measurements of the executed messages to protect RFID systems against the relay attack. The existing distance bounding protocols employed by RFID systems are divided into two categories generally called, with random challenges or with mixed challenges. Since RFID systems and distance bounding protocols are particularly susceptible to noise, in this paper, the security analysis of distance bounding protocols with random challenges is performed over a noisy channel. This analysis is achieved by computing an attacker's success probability due to mafia fraud and distance fraud attacks in a noisy environment. In this case, the analysis as well as simulation results show that increasing the number of iterations (rounds) makes the attacker's success probability to decrease and adversely it can causes the rejection probability of a valid tag due to channel errors to increase. Therefore, the proper values for the number of iterations and the total number of errors that are acceptable are computed to obtain the optimal false-accept and false-reject probabilities in a noisy environment. (5 pages)
Inspec keywords: probability; radiofrequency identification; telecommunication security; iterative methods; protocols
Subjects: Protocols; Interpolation and function approximation (numerical analysis); RFID systems; Other topics in statistics
Related content
content/conferences/10.1049/cp.2012.0607
pub_keyword,iet_inspecKeyword,pub_concept
6
6