{'fraction_non_alphanumeric': 0.020682523267838676, 'fraction_numerical': 0.0, 'mean_word_length': 5.285714285714286, '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 Implementation of a Pairing-Based Anonymous Credential System with Constant Complexity

An anonymous credential system allows the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. One of the applications is the privacy-enhancing electronic ID (eID). A previously proposed anonymous credential system achieves the constant complexity for the number of user’s attributes. However, due to the use of RSA-based cryptography, it still suffers from a high cost computation. Recently, we proposed an anonymous credential system with the constant complexity using a pairingbased accumulator, where more efficient ECC (Elliptic Curve Cryptography) can be used instead of the RSA. In this paper, we present an implementation of the anonymous credential system in the application to the eID. We show the practicality of the system from experimental results that the processing times are constantly less than a second.