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/zh/article/74654277/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |