Constant-size dynamic k-times anonymous authentication

Man Ho Allen Au, Willy Susilo, Yi Mu, Sherman S.M. Chow

Research output: Journal article publicationJournal articleAcademic researchpeer-review

36 Citations (Scopus)


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((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.
Original languageEnglish
Article number6355604
Pages (from-to)249-261
Number of pages13
JournalIEEE Systems Journal
Issue number2
Publication statusPublished - 1 Jan 2013
Externally publishedYes


  • Anonymity
  • applied cryptography
  • authentication
  • implementation
  • pairings

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering


Dive into the research topics of 'Constant-size dynamic k-times anonymous authentication'. Together they form a unique fingerprint.

Cite this