The distance-bounding protocol based on Russian cryptographic algorithms

In distance-bounding authentication protocols the Prover has to prove not only that it is a legitimate participant, but also that it is in a legitimate zone (e.g., in close proximity to the Verifier). Conventional authentication protocols are not designed to deal with the location of protocol parties. Using such protocols in case of RFID systems makes them vulnerable to simple relay attacks, which is a significant threat. Protocols that combine cryptographic mechanisms with technical measurements (e.g., time-of-flight or GPS location of the Prover) are often used to protect against relay attacks. In this paper we analyse existing distance-bounding authentication protocols and propose a new DB-RFID\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {DB \text {-} RFID}$$\end{document} distance-bounding protocol for RFID systems. DB-RFID\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {DB \text {-} RFID}$$\end{document} protocol develops the ideas of the most prominent Swiss-Knife protocol, which protects against a greater number of possible attacks. We also provide an initial security analysis of the protocol and propose a version of the protocol based on Russian standardized cryptographic algorithms.