{'fraction_non_alphanumeric': 0.01330603889457523, 'fraction_numerical': 0.0, 'mean_word_length': 5.189873417721519, '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}}
An efficient offline grouping proof protocol using multiple types of tags

An offline grouping proof shows that multiple Radio Frequency Identification tags are scanned simultaneously, regardless of a reader device's network connectivity. However, the previous offline grouping proof schemes are unsuitable for passive tags, and do not handle errors that cause performance degradation, such as transmission loss or synchronization failure of shared values between tags and a back-end database. In this paper, we propose an efficient offline grouping proof scheme using multiple types of tags. It makes use of an agent tag which does computing operations instead of the passive tags to reduce the computational cost of them, thus it eventually shortens the time for generating a grouping proof. We show that the number of modules and operations of the passive tags in our scheme are less than half of the previous schemes while it achieves the enhanced security and scalability.