{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:21:53Z","timestamp":1740172913023,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T00:00:00Z","timestamp":1715904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T00:00:00Z","timestamp":1715904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-024-00524-2","type":"journal-article","created":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T10:09:36Z","timestamp":1715940576000},"page":"485-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The distance-bounding protocol based on Russian cryptographic algorithms"],"prefix":"10.1007","volume":"20","author":[{"given":"Vladimir","family":"Belsky","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1642-9349","authenticated-orcid":false,"given":"Anastasiia","family":"Chichaeva","sequence":"additional","affiliation":[]},{"given":"Vasily","family":"Shishkin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9281-417X","authenticated-orcid":false,"given":"Kirill","family":"Tsaregorodtsev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,17]]},"reference":[{"key":"524_CR1","volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"B Schneier","year":"2007","unstructured":"Schneier, B.: Applied Cryptography: Protocols, Algorithms, and Source Code in C. Wiley (2007)"},{"key":"524_CR2","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., Paterson, M.B.: Cryptography: Theory and Practice, 4th edn (2019)","DOI":"10.1201\/9781315282497"},{"key":"524_CR3","unstructured":"Mitrokotsa, A., Beye, M., Peris-Lopez, P.: Classification of RFID Threats based on Security Principles. Security Lab, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology (2011)"},{"key":"524_CR4","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: Sound proof of proximity of knowledge. In: Au, M.-H., Miyaji, A. (eds.) Provable Security, pp. 105\u2013126. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-26059-4_6"},{"key":"524_CR5","unstructured":"ISO\/IEC 29167-10 Information technology\u2014automatic identification and data capture techniques\u2014part 10: Crypto suite AES-128 security services for air interface communications (2017)"},{"key":"524_CR6","unstructured":"Desmedt, Y.: Major security problems with the \u201cunforgeable\u201d (Feige)-Fiat-Shamir proofs of identity and how to overcome them. In: Proceedings of SECURICOM, vol. 88, pp. 15\u201317 (1988)"},{"key":"524_CR7","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Practical and provably secure distance-bounding. In: Desmedt, Y. (ed.) Information Security, pp. 248\u2013258. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-27659-5_18"},{"key":"524_CR8","doi-asserted-by":"crossref","unstructured":"Brands, S., Chaum, D.: Distance-bounding protocols. In: Helleseth, T. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201993, pp. 344\u2013359. Springer, Berlin (1994)","DOI":"10.1007\/3-540-48285-7_30"},{"key":"524_CR9","doi-asserted-by":"crossref","unstructured":"Cremers, C., Rasmussen, K.B., Schmidt, B., Capkun, S.: Distance hijacking attacks on distance bounding protocols. In: 2012 IEEE Symposium on Security and Privacy, pp. 113\u2013127. IEEE (2012)","DOI":"10.1109\/SP.2012.17"},{"key":"524_CR10","unstructured":"Gorj\u00f3n, X.T., van den Breekel, J., van Iterson, P.: Protecting against relay attacks forging increased distance reports. Research Project, Universiteit van Amsterdam (2015)"},{"key":"524_CR11","doi-asserted-by":"crossref","unstructured":"Chandran, N., Goyal, V., Moriarty, R., Ostrovsky, R.: Position based cryptography. In: Halevi, S. (ed.) Advances in Cryptology\u2014CRYPTO 2009, pp. 391\u2013407. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03356-8_23"},{"key":"524_CR12","doi-asserted-by":"crossref","unstructured":"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\u201905), pp. 67\u201373 (2005)","DOI":"10.1109\/SECURECOMM.2005.56"},{"issue":"9","key":"524_CR13","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1002\/wcm.590","volume":"8","author":"J Munilla","year":"2008","unstructured":"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\u20131232 (2008)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"524_CR14","doi-asserted-by":"crossref","unstructured":"Kim, C.H., Avoine, G.: RFID distance bounding protocol with mixed challenges to prevent relay attacks. In: Garay, J.A., Miyaji, A., Otsuka, A. (ed.) Cryptology and Network Security, pp. 119\u2013133. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-10433-6_9"},{"key":"524_CR15","doi-asserted-by":"crossref","unstructured":"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.) Information Security, pp. 250\u2013261. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04474-8_21"},{"key":"524_CR16","doi-asserted-by":"crossref","unstructured":"Reid, J., Nieto, J.M.G., Tang, T., Senadji, B.: Detecting relay attacks with timing-based protocols. In: Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, ASIACCS \u201907, pp. 204\u2013213. Association for Computing Machinery, New York (2007)","DOI":"10.1145\/1229285.1229314"},{"key":"524_CR17","doi-asserted-by":"crossref","unstructured":"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.) Information Security and Cryptology\u2014ICISC 2008, pp. 98\u2013115. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-00730-9_7"},{"key":"524_CR18","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: Private and secure public-key distance bounding. In: B\u00f6hme, R., Okamoto, T. (eds.) Financial Cryptography and Data Security, pp. 207\u2013216. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-47854-7_12"},{"issue":"11","key":"524_CR19","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"524_CR20","unstructured":"GOST 34.13-2018. Information technology. Cryptographic data security. Modes of operation for block ciphers (2018)"},{"key":"524_CR21","unstructured":"GOST 34.12-2018. Information technology. Cryptographic data security. Block ciphers (2018)"},{"key":"524_CR22","unstructured":"R 50.1.113-2016. Information technology. Cryptographic data security. Cryptographic algorithms accompanying the application of electronic digital signature and hash function (2016)"},{"key":"524_CR23","unstructured":"GOST 34.11-2018. Information technology. Cryptographic data security. Hash function (2018)"},{"key":"524_CR24","unstructured":"Kumar, S., Paar, C.: Are standards compliant elliptic curve cryptosystems feasible on RFID. In: Workshop on RFID Security, pp. 12\u201314. Citeseer (2006)"},{"key":"524_CR25","first-page":"41","volume":"8","author":"M O\u2019Neill","year":"2008","unstructured":"O\u2019Neill, M., et al.: Low-cost SHA-1 hash function architecture for RFID tags. RFIDSec 8, 41\u201351 (2008)","journal-title":"RFIDSec"},{"key":"524_CR26","doi-asserted-by":"crossref","unstructured":"Feldhofer, M., Rechberger, C.: A case against currently used hash functions in RFID protocols. In: Meersman, R., Tari, Z., Herrero, P. (eds.) On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, pp. 372\u2013381. Springer, Berlin (2006)","DOI":"10.1007\/11915034_61"},{"key":"524_CR27","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y.: Hash functions and RFID tags: mind the gap. In: Oswald, E., Rohatgi, P. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2008, pp. 283\u2013299. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85053-3_18"},{"key":"524_CR28","doi-asserted-by":"crossref","unstructured":"Brelurut, A., Gerault, D., Lafourcade, P.: Survey of distance bounding protocols and threats. In: Garcia-Alfaro, J., Kranakis, E., Bonfante, G. (eds.) Foundations and Practice of Security, pp. 29\u201349. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-30303-1_3"},{"key":"524_CR29","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Dr\u0103gan, C.C., Dupressoir, F., G\u00e9rault, D., Lafourcade, P.: Mechanised models and proofs for distance-bounding. In: 2021 IEEE 34th Computer Security Foundations Symposium (CSF), pp. 1\u201316. IEEE (2021)","DOI":"10.1109\/CSF51468.2021.00049"},{"issue":"5","key":"524_CR30","first-page":"1","volume":"51","author":"G Avoine","year":"2018","unstructured":"Avoine, G., Bing\u00f6l, M.A., Boureanu, I., \u010capkun, S., Hancke, G., Karda\u015f, S., Kim, C.H., Lauradoux, C., Martin, B., Munilla, J., et al.: Security of distance-bounding: a survey. ACM Comput. Surv. CSUR 51(5), 1\u201333 (2018)","journal-title":"ACM Comput. Surv. CSUR"},{"issue":"2","key":"524_CR31","doi-asserted-by":"publisher","first-page":"289","DOI":"10.3233\/JCS-2010-0408","volume":"19","author":"G Avoine","year":"2011","unstructured":"Avoine, G., Bing\u00f6l, M.A., Karda\u015f, S., Lauradoux, C., Martin, B.: A framework for analyzing RFID distance bounding protocols. J. Comput. Secur. 19(2), 289\u2013317 (2011)","journal-title":"J. Comput. Secur."},{"issue":"2","key":"524_CR32","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Inf. theory 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. theory"},{"key":"524_CR33","doi-asserted-by":"crossref","unstructured":"D\u00fcrholz, U., Fischlin, M., Kasper, M., Onete, C.: A formal approach to distance-bounding RFID protocols. In: Lai, X., Zhou, J., Li, H. (eds.) Information Security, pp. 47\u201362. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-24861-0_4"},{"key":"524_CR34","unstructured":"Fischlin, M., Onete, C.: Provably secure distance-bounding: an analysis of prominent protocols. Cryptol. ePrint Arch. 2012, 128 (2012)"},{"key":"524_CR35","doi-asserted-by":"crossref","unstructured":"Avoine, G., Lauradoux, C., Martin, B.: How secret-sharing can defeat terrorist fraud. In: Proceedings of the Fourth ACM Conference on Wireless Network Security, WiSec \u201911, pp. 145\u2013156. Association for Computing Machinery, New York, NY, USA (2011)","DOI":"10.1145\/1998412.1998437"},{"key":"524_CR36","doi-asserted-by":"crossref","unstructured":"Fischlin, M., Onete, C.: Terrorism in distance bounding: modeling terrorist-fraud resistance. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) Applied Cryptography and Network Security, pp. 414\u2013431. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38980-1_26"},{"key":"524_CR37","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Secure and lightweight distance-bounding. In: Avoine, G., Kara, O. (eds.) Lightweight Cryptography for Security and Privacy, pp. 97\u2013113. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-40392-7_8"},{"key":"524_CR38","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: Towards secure distance bounding. In: Moriai, S. (ed.) Fast Software Encryption, pp. 55\u201367. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-43933-3_4"},{"key":"524_CR39","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: On modeling terrorist frauds. In: Susilo, W., Reyhanitabar, R. (eds.) Provable Security, pp. 1\u201320. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-41227-1_1"},{"key":"524_CR40","doi-asserted-by":"crossref","unstructured":"Boureanu, I., Mitrokotsa, A., Vaudenay, S.: On the pseudorandom function assumption in (secure) distance-bounding protocols. In: Hevia, A., Neven, G. (eds.) Progress in Cryptology\u2014LATINCRYPT 2012, pp. 100\u2013120. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33481-8_6"},{"key":"524_CR41","unstructured":"Peris-Lopez, P., Hernandez-Castro, J.C., van der Lubbe, J.C.A., Tapiador, J.M.E.: Shedding some light on RFID distance bounding protocols and terrorist attacks. Technical report (2009)"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00524-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-024-00524-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00524-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T10:09:51Z","timestamp":1736417391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-024-00524-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,17]]},"references-count":41,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["524"],"URL":"https:\/\/doi.org\/10.1007\/s11416-024-00524-2","relation":{},"ISSN":["2263-8733"],"issn-type":[{"type":"electronic","value":"2263-8733"}],"subject":[],"published":{"date-parts":[[2024,5,17]]},"assertion":[{"value":"27 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}