Constant-size dynamic k-TAA

Man Ho Allen Au, Willy Susilo, Yi Mu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

181 Citations (Scopus)


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. Dynamic k-TAA allows application providers to independently grant or revoke users from their own access group so as to provide better control over their clients. In terms of time and space complexity, existing dynamic k-TAA schemes are of complexities O(k), where k is the allowed number of authentication. In this paper, we construct a dynamic k-TAA scheme with space and time complexities of O(log(k)). We also outline how to construct dynamic k-TAA scheme with a constant proving effort. Public key size of this variant, however, is O(k). We then construct an ordinary k-TAA scheme from the dynamic scheme. We also describe a trade-off between efficiency and setup freeness of AP, in which AP does not need to hold any secret while maintaining control over their clients. To build our system, we modify the short group signature scheme into a signature scheme and provide efficient protocols that allow one to prove in zero-knowledge the knowledge of a signature and to obtain a signature on a committed block of messages. We prove that the signature scheme is secure in the standard model under the q-SDH assumption. Finally, we show that our dynamic k-TAA scheme, constructed from bilinear pairing, is secure in the random oracle model.
Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - 5th International Conference, SCN 2006, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540380809, 9783540380801
Publication statusPublished - 1 Jan 2006
Externally publishedYes
Event5th International Conference on Security and Cryptography for Networks, SCN 2006 - Maiori, Italy
Duration: 6 Sept 20068 Sept 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4116 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Conference on Security and Cryptography for Networks, SCN 2006


  • Dynamic k-TAA
  • K-TAA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


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

Cite this