Constant-size dynamic k-times anonymous authentication

Authors

Man Ho Au, University of WollongongFollow
Willy Susilo, University of WollongongFollow
Yi Mu, University of WollongongFollow
Sherman S. M Chow, University of Hong Kong

RIS ID

90225

Publication Details

Au, M. Ho., Susilo, W., Mu, Y. & Chow, S. S. M. (2013). Constant-size dynamic k-times anonymous authentication. IEEE Systems Journal, 7 (2), 249-261.

Abstract

Dynamic k-times anonymous authentication (k-TAA) schemes allow members of a group to be authenticated anonymously by application providers for a bounded number of times, where application providers can independently and dynamically grant or revoke access right to members in their own group. In this paper, we construct a dynamic k-TAA scheme with space and time complexities of O(log(k)) and a variant, in which the authentication protocol only requires constant time and space complexities at the cost of O(k) -sized public key. We also describe some tradeoff issues between different system characteristics. We detail all the zero-knowledge proof-of-knowledge protocols involved and show that our construction is secure in the random oracle model under the q-strong Diffie-Hellman assumption and q-decisional Diffie-Hellman inversion assumption. We provide a proof-of-concept implementation, experiment on its performance, and show that our scheme is practical.