{'fraction_non_alphanumeric': 0.019975031210986267, 'fraction_numerical': 0.0, 'mean_word_length': 4.897058823529412, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A mafia and distance fraud high-resistance RFID distance bounding protocol

A practical approach to prevent location-based attacks in RFID systems is the use of Distance Bounding (DB) protocols. These protocols enable an entity to determine an upper bound on the physical distance to another entity as well as to authenticate it. It makes, rejection of the requests located out of this distance limitation. So far, many DB protocols have been designed with the aim of resistance to location-based attacks. In this paper, we propose a unilateral DB protocol using delay concept while sending two random binary challenges. This protocol can resist better than other unilateral DB protocols against mafia and distance fraud attacks. In addition, the proposed protocol can be applied to passive RFID tags.