File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/JSYST.2012.2221931
- Scopus: eid_2-s2.0-84875252646
- WOS: WOS:000318170300008
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Constant-size dynamic k-times anonymous authentication
Title | Constant-size dynamic k-times anonymous authentication |
---|---|
Authors | |
Keywords | authentication applied cryptography Anonymity implementation pairings |
Issue Date | 2013 |
Citation | IEEE Systems Journal, 2013, v. 7, n. 2, p. 249-261 How to Cite? |
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((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. © 2007-2012 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/280790 |
ISSN | 2023 Impact Factor: 4.0 2023 SCImago Journal Rankings: 1.402 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Susilo, Willy | - |
dc.contributor.author | Mu, Yi | - |
dc.contributor.author | Chow, Sherman S.M. | - |
dc.date.accessioned | 2020-02-17T14:34:57Z | - |
dc.date.available | 2020-02-17T14:34:57Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | IEEE Systems Journal, 2013, v. 7, n. 2, p. 249-261 | - |
dc.identifier.issn | 1932-8184 | - |
dc.identifier.uri | http://hdl.handle.net/10722/280790 | - |
dc.description.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((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. © 2007-2012 IEEE. | - |
dc.language | eng | - |
dc.relation.ispartof | IEEE Systems Journal | - |
dc.subject | authentication | - |
dc.subject | applied cryptography | - |
dc.subject | Anonymity | - |
dc.subject | implementation | - |
dc.subject | pairings | - |
dc.title | Constant-size dynamic k-times anonymous authentication | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/JSYST.2012.2221931 | - |
dc.identifier.scopus | eid_2-s2.0-84875252646 | - |
dc.identifier.volume | 7 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 249 | - |
dc.identifier.epage | 261 | - |
dc.identifier.eissn | 1937-9234 | - |
dc.identifier.isi | WOS:000318170300008 | - |
dc.identifier.issnl | 1932-8184 | - |