Efficient identification protocol provably secure in standard model
Based on the hardness assumption of the collusion attack algorithm with k traitors （K-CAA） in a gap Diffie-Hellman （GDH） group, a new and efficient identification protocol is proposed. The new identification protocol is proven secure against impersonation under concurrent reset attack setting in sta...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2009-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails?columnId=74654277&Fpath=home&index=0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850214665163898880 |
|---|---|
| author | LI Yan-ping1 WANG Yu-min1 |
| author_facet | LI Yan-ping1 WANG Yu-min1 |
| author_sort | LI Yan-ping1 |
| collection | DOAJ |
| description | Based on the hardness assumption of the collusion attack algorithm with k traitors （K-CAA） in a gap Diffie-Hellman （GDH） group, a new and efficient identification protocol is proposed. The new identification protocol is proven secure against impersonation under concurrent reset attack setting in standard model. Due to its simplicity and naturalness, low-memory, low-computation costs, and better security, the proposed scheme is well suitable for using in computationally limited devices for identification such as smart cards. |
| format | Article |
| id | doaj-art-4922f68c6bcd4044b2e253f9d29df072 |
| institution | OA Journals |
| issn | 1000-436X |
| language | zho |
| publishDate | 2009-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-4922f68c6bcd4044b2e253f9d29df0722025-08-20T02:08:49ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2009-01-0130586174654277Efficient identification protocol provably secure in standard modelLI Yan-ping1WANG Yu-min1Based on the hardness assumption of the collusion attack algorithm with k traitors （K-CAA） in a gap Diffie-Hellman （GDH） group, a new and efficient identification protocol is proposed. The new identification protocol is proven secure against impersonation under concurrent reset attack setting in standard model. Due to its simplicity and naturalness, low-memory, low-computation costs, and better security, the proposed scheme is well suitable for using in computationally limited devices for identification such as smart cards.http://www.joconline.com.cn/thesisDetails?columnId=74654277&Fpath=home&index=0identification protocol;bilinear pairing;standard model |
| spellingShingle | LI Yan-ping1 WANG Yu-min1 Efficient identification protocol provably secure in standard model Tongxin xuebao identification protocol;bilinear pairing;standard model |
| title | Efficient identification protocol provably secure in standard model |
| title_full | Efficient identification protocol provably secure in standard model |
| title_fullStr | Efficient identification protocol provably secure in standard model |
| title_full_unstemmed | Efficient identification protocol provably secure in standard model |
| title_short | Efficient identification protocol provably secure in standard model |
| title_sort | efficient identification protocol provably secure in standard model |
| topic | identification protocol;bilinear pairing;standard model |
| url | http://www.joconline.com.cn/thesisDetails?columnId=74654277&Fpath=home&index=0 |
| work_keys_str_mv | AT liyanping1 efficientidentificationprotocolprovablysecureinstandardmodel AT wangyumin1 efficientidentificationprotocolprovablysecureinstandardmodel |