Skip to main content
placeholder image

Constant-size dynamic k-times anonymous authentication

Journal Article


Download full-text (Open Access)

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.

UOW Authors


  •   Au, Man Ho Allen (external author)
  •   Susilo, Willy
  •   Mu, Yi (external author)
  •   Chow, Sherman S. M.. (external author)

Publication Date


  • 2013

Citation


  • 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.

Scopus Eid


  • 2-s2.0-84875252646

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=3400&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/2391

Has Global Citation Frequency


Number Of Pages


  • 12

Start Page


  • 249

End Page


  • 261

Volume


  • 7

Issue


  • 2

Place Of Publication


  • United States

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.

UOW Authors


  •   Au, Man Ho Allen (external author)
  •   Susilo, Willy
  •   Mu, Yi (external author)
  •   Chow, Sherman S. M.. (external author)

Publication Date


  • 2013

Citation


  • 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.

Scopus Eid


  • 2-s2.0-84875252646

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=3400&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/2391

Has Global Citation Frequency


Number Of Pages


  • 12

Start Page


  • 249

End Page


  • 261

Volume


  • 7

Issue


  • 2

Place Of Publication


  • United States