k-times attribute-based authentication scheme using direct anonymous attestation
s: At present, the main drawbacks of existing k-times attribute-based authentication (abbreviated to k-TABA) schemes and related attribute-based authentication schemes are that the computation cost of the authentication process depends on the size of the access formula and none of these schemes cons...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2018-12-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018279/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850097904405970944 |
|---|---|
| author | Xin LIU Qiuliang XU Bin ZHANG Bo ZHANG |
| author_facet | Xin LIU Qiuliang XU Bin ZHANG Bo ZHANG |
| author_sort | Xin LIU |
| collection | DOAJ |
| description | s: At present, the main drawbacks of existing k-times attribute-based authentication (abbreviated to k-TABA) schemes and related attribute-based authentication schemes are that the computation cost of the authentication process depends on the size of the access formula and none of these schemes considers the problems of member revocation and attribute update. A new k-TABA scheme was constructed based on the building blocks of direct anonymous attestation, set membership proof and ciphertext-policy attribute-based encryption. Moreover, in order to reduce user's calculation as much as possible, the underlying attribute-based encryption scheme was modified, and then the main decryption operations were outsourced by using the key binding technique of Green et al. The new scheme can be deployed on a trusted platform and support expressive authentication policies. In addition, it also satisfies several ideal properties, such as registration process verifiability, member revocation, attribute update, and so on. The significant performance advantage of the new scheme is that the computation overhead of the user in the authentication phase is constant. |
| format | Article |
| id | doaj-art-daa144296f0a4425ac84838bb74bedb5 |
| institution | DOAJ |
| issn | 1000-436X |
| language | zho |
| publishDate | 2018-12-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-daa144296f0a4425ac84838bb74bedb52025-08-20T02:40:51ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2018-12-013911313359722404k-times attribute-based authentication scheme using direct anonymous attestationXin LIUQiuliang XUBin ZHANGBo ZHANGs: At present, the main drawbacks of existing k-times attribute-based authentication (abbreviated to k-TABA) schemes and related attribute-based authentication schemes are that the computation cost of the authentication process depends on the size of the access formula and none of these schemes considers the problems of member revocation and attribute update. A new k-TABA scheme was constructed based on the building blocks of direct anonymous attestation, set membership proof and ciphertext-policy attribute-based encryption. Moreover, in order to reduce user's calculation as much as possible, the underlying attribute-based encryption scheme was modified, and then the main decryption operations were outsourced by using the key binding technique of Green et al. The new scheme can be deployed on a trusted platform and support expressive authentication policies. In addition, it also satisfies several ideal properties, such as registration process verifiability, member revocation, attribute update, and so on. The significant performance advantage of the new scheme is that the computation overhead of the user in the authentication phase is constant.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018279/attribute-based authenticationdirect anonymous attestationciphertext-policy attribute-based encryptionlinear secret sharingoutsourced decryption |
| spellingShingle | Xin LIU Qiuliang XU Bin ZHANG Bo ZHANG k-times attribute-based authentication scheme using direct anonymous attestation Tongxin xuebao attribute-based authentication direct anonymous attestation ciphertext-policy attribute-based encryption linear secret sharing outsourced decryption |
| title | k-times attribute-based authentication scheme using direct anonymous attestation |
| title_full | k-times attribute-based authentication scheme using direct anonymous attestation |
| title_fullStr | k-times attribute-based authentication scheme using direct anonymous attestation |
| title_full_unstemmed | k-times attribute-based authentication scheme using direct anonymous attestation |
| title_short | k-times attribute-based authentication scheme using direct anonymous attestation |
| title_sort | k times attribute based authentication scheme using direct anonymous attestation |
| topic | attribute-based authentication direct anonymous attestation ciphertext-policy attribute-based encryption linear secret sharing outsourced decryption |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018279/ |
| work_keys_str_mv | AT xinliu ktimesattributebasedauthenticationschemeusingdirectanonymousattestation AT qiuliangxu ktimesattributebasedauthenticationschemeusingdirectanonymousattestation AT binzhang ktimesattributebasedauthenticationschemeusingdirectanonymousattestation AT bozhang ktimesattributebasedauthenticationschemeusingdirectanonymousattestation |