{'fraction_non_alphanumeric': 0.023305084745762712, 'fraction_numerical': 0.0, 'mean_word_length': 4.90625, '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}}
Reducing Revocation Lists in CS-Based Revocable Group Signature Scheme Using Vector Commitment

In the current ID-based user authentication systems, the user's personal use history can be traced, because the user's ID can be linked. Therefore, this may cause privacy issues. As a solution, group signatures have been researched to realize the anonymous authentication. The group signature requires a revocation function to revoke signatures generated by a user who leaves or is removed from a group. An efficient revocable group signature scheme using a tree structure called the Complete Subtree (CS) method has been proposed. However, the size of the revocation list depends on the number of revoked users. In this paper, we propose an extended scheme where the size of revocation list is reduced, by compressing a number of entries in the list by a vector commitment. We implement the proposed scheme on a PC, and evaluate the effectiveness.