2016 • In Hancke, Gerard P.; Markantonakis, Konstantinos (Eds.) Radio Frequency Identification and IoT Security - 12th International Workshop, RFIDSec 2016, Hong Kong, China, November 30 - December 2, 2016, Revised Selected Papers
[en] Distance-bounding protocols use the round-trip time of a challenge-response cycle to provide an upper-bound on the distance between prover and verifier. In order to obtain an accurate upper-bound, the computation time at the prover’s side should be as short as possible, which can be achieved by precomputing the responses and storing them in a lookup table. However, such lookup-based distance bounding protocols suffer from a trade-off between the achieved security level and the size of the lookup table. In this paper, we study this security-memory trade-off problem for a large class of lookup-based distance bounding protocols; called layered protocols. Relying on an automata-based security model, we provide mathematical definitions for different design decisions used in previous lookup-based protocols, and perform general security analyses for each of them. We also formalize an interpretation of optimal trade-off and find a non-trivial protocol transformation approach towards optimality. That is to say, our transformation applied to any layered protocol results in either an improved or an equal protocol with respect to the optimality criterion. This transformation allows us to provide a subclass of lookup-based protocol that cannot be improved further, which means that it contains an optimal layered protocol.
Disciplines :
Computer science
Author, co-author :
Mauw, Sjouke ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Toro Pozo, Jorge Luis ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Trujillo Rasua, Rolando ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
External co-authors :
no
Language :
English
Title :
Optimality Results on the Security of Lookup-Based Protocols
Publication date :
December 2016
Event name :
Radio Frequency Identification and IoT Security - 12th International Workshop, RFIDSec 2016
Event organizer :
City University of Hong Kong
Event place :
Hong Kong, China
Event date :
from 30-11-2016 to 02-12-2016
Audience :
International
Main work title :
Radio Frequency Identification and IoT Security - 12th International Workshop, RFIDSec 2016, Hong Kong, China, November 30 - December 2, 2016, Revised Selected Papers
Editor :
Hancke, Gerard P.
Markantonakis, Konstantinos
Publisher :
Springer
ISBN/EAN :
978-3-319-62023-7
Pages :
137-150
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
FnR Project :
FNR10188265 - Symbolic Verification Of Distance-bounding And Multiparty Authentication Protocols, 2015 (01/06/2015-31/05/2019) - Jorge Luis Toro Pozo
Avoine, G., Bingöl, M.A., Kardas, S., Lauradoux, C., Martin, B.: A framework for analyzing RFID distance bounding protocols. J. Comput. Secur. 19(2), 289-317 (2011)
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). doi:10.1007/978-3-642-04474-8_21
Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Secure and lightweight distance- bounding. In: Avoine, G., Kara, O. (eds.) LightSec 2013. LNCS, vol. 8162, pp. 97-113. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40392-7_8
Bussard, L., Bagga, W.: Distance-bounding proof of knowledge to avoid realtime attacks. In: Sasaki, R., Qing, S., Okamoto, E., Yoshiura, H. (eds.) SEC 2005. IAICT, vol. 181, pp. 223-238. Springer, Boston, MA (2005). doi:10.1007/0-387-25660-1.15
Desmedt, Y., Goutier, C., Bengio, S.: Special uses and abuses of the fiat- shamir passport protocol (extended abstract). In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 21-39. Springer, Heidelberg (1988). doi:10.1007/3-540-48184-2.3
Ozhan Görel, A., Arslan, A., Akgön, M.: Non-uniform stepping approach to rfid distance bounding problem. In: Garcia-Alfaro, J., Navarro-Arribas, G., Cavalli, A., Leneutre, J. (eds.) DPM/SETOP -2010. LNCS, vol. 6514, pp. 64-78. Springer, Heidelberg (2011). doi:10.1007/978-3-642-19348-4_6
Hancke, G.P., Kuhn, M.G.: An RFID distance bounding protocol. In: Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SecureComm-2005), Athens, Greece, 5-9 September 2005, pp. 67-73. IEEE Computer Society, Washington, DC (2005)
Kardas, S., Kiraz, M.S., Bingol, M.A., Demirci, H.: A novel RFID distance bounding protocol based on physically unclonable functions. In: Juels, A., Paar, C. (eds.) RFIDSec 2011. LNCS, vol. 7055, pp. 78-93. Springer, Heidelberg (2012). doi:10. 1007/978-3-642-25286-0.6
Kim, C.H., Avoine, G.: RFID distance bounding protocols with mixed challenges. IEEE Trans. Wireless Commun. 10(5), 1618-1626 (2011)
Kim, C.H., Avoine, G., Koeune, F., Standaert, F.-X., Pereira, O.: The swiss- knife RFID distance bounding protocol. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 98-115. Springer, Heidelberg (2009). doi:10.1007/978-3-642-00730-9.7
Mauw, S., Toro-Pozo, J., Trujillo-Rasua, R.: A Class of precomputation-based distance-bounding protocols. In: Proceedings of the 1st IEEE European Symposium on Security and Privacy - EuroS&P’16. Saarbrücken, Germany (2016)
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)
Trujillo-Rasua, R., Martin, B., Avoine, G.: The poulidor distance-bounding protocol. In: Ors Yalcin, S.B. (ed.) RFIDSec 2010. LNCS, vol. 6370, pp. 239-257. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16822-2_19
