Security Reconsideration and Efficiency Evaluation of Decentralized Multi-authority Anonymous Authentication Scheme

Abstract

We consider the security definition of decentralized multi-authority anonymous authentication schemes (DMA-AAuth) which was proposed by Anada-Arita at ICICS2018. The security is against causing-misauthentication attack, and we modify it to capture a threat of corrupted key-issuing authorities. Then we prove that the concrete scheme proposed by Anada at CANDAR'19 is secure under the new definition. Next, we evaluate efficiency of the concrete scheme by implementation. We use the C programming language with the TEPLA library.