{'fraction_non_alphanumeric': 0.017341040462427744, 'fraction_numerical': 0.0038535645472061657, 'mean_word_length': 5.41358024691358, '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}}
Privacy-preserving grouping proof with key exchange in the multiple-party setting

Grouping proof is a very useful security primitive that can be used to prove the co-existence of multiple entities in an identification protocol. It can be incorporated into radio frequency identification protocols and used in many practical applications such as pharmaceutical distribution and manufacturing. However, the existing grouping proofs do not support secure key establishment, which is required in order to allow secure communication between the reader and the radio frequency identification tags after the identification process. In this paper, we propose a novel grouping proof with key exchange that allows the reader to establish a secure communication channel with the tags. We define the formal security models for grouping proof with key exchange and prove that the proposed generic protocol can achieve grouping proof soundness, session key security, contributiveness, and tag identity privacy. Copyright © 2016 John Wiley & Sons, Ltd.