Abstract
RFID System is vulnerable for man-in-the-middle attack. Distance bounding protocols are designed for authentication while taking into consideration the distance measure. Distance bounding protocols solve the problem of man-in-the-middle attack in practical. In the known protocols from public literatures, the mafia fraud probability is usually very high, or the memory requirement is large. In this paper, we propose an efficient distance bounding protocol, which uses a single bit to challenge, and it does not require the final signature as many existing such protocols do. The protocol uses a linear memory and has a good probability in resisting against mafia fraud attack.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Desmedt, Y.: Major security problems with the unforgeable(feige)-fiat-shamir proofs of identity and how to overcome them. In: SecuriCom, vol. 88, pp. 15–17 (1988)
Desmedt, Y.G., Goutier, C., Bengio, S.: Special uses and abuses of the fiat shamir passport protocol. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 21–39. Springer, Heidelberg (1988)
Bengio, S., Brassard, G., Desmedt, Y.G., Goutier, C., Quisquater, J.J.: Secure implementation of identification systems. J. Cryptol. 4(3), 175–183 (1991)
Brands, S., Chaum, D.: Distance bounding protocols. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 344–359. Springer, Heidelberg (1994)
Hancke, G.P., Kuhn, M.G.: An rfid distance bounding protocol. In: First International Conference on Security and Privacy for Emerging Areas in Communications Networks. SecureComm 2005, pp. 67–73. IEEE (2005)
Munilla, J., Peinado, A.: Distance bounding protocols for rfid enhanced by using void-challenges and analysis in noisy channels. Wirel. Commun. Mob. Comput. 8(9), 1227–1232 (2008)
Avoine, G., Floerkemeier, C., Martin, B.: RFID distance bounding multistate enhancement. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol. 5922, pp. 290–307. Springer, Heidelberg (2009)
Zhuang, Y., Yang, A., Wong, D.S., Yang, G., Xie, Q.: A highly efficient RFID distance bounding protocol without real-time PRF evaluation. In: Lopez, J., Huang, X., Sandhu, R. (eds.) NSS 2013. LNCS, vol. 7873, pp. 451–464. Springer, Heidelberg (2013)
Kim, C.H., Avoine, G.: RFID distance bounding protocols with mixed challenges. IEEE Trans. Wirel. Commun. 10(5), 1618–1626 (2011)
Jannati, H., Falahati, A.: Mutual distance bounding protocol with its implementability over a noisy channel and its utilization for key agreement in peer-to-peer wireless networks. Wirel. Pers. Commun. 1–23 (2013)
Avoine, G., Tchamkerten, A.: An efficient distance bounding RFID authentication protocol: balancing false-acceptance rate and memory requirement. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 250–261. Springer, Heidelberg (2009)
Avoine, G., Bingl, M.A., Karda, S., Lauradoux, C., Martin, B.: A framework for analyzing RFID distance bounding protocols. J. Comput. Secur. 19(2), 289–317 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhai, L., Wu, C. (2015). An Efficient RFID Distance Bounding Protocol. In: Herrero, Á., Baruque, B., Sedano, J., Quintián, H., Corchado, E. (eds) International Joint Conference. CISIS 2015. Advances in Intelligent Systems and Computing, vol 369. Springer, Cham. https://doi.org/10.1007/978-3-319-19713-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-19713-5_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19712-8
Online ISBN: 978-3-319-19713-5
eBook Packages: EngineeringEngineering (R0)