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: | LI Yan-ping1, WANG Yu-min1 |
|---|---|
| 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!
|
Similar Items
-
Provably secure secret sharing scheme based on bilinear maps
by: LI Hui-xian1, et al.
Published: (2008-01-01) -
Provably secure partially blind signature without trusted PKG
by: FENG Tao1, et al.
Published: (2010-01-01) -
Research of STR multicast key management protocol based on bilinear pairing in ad hoc network
by: ZHOU Fu-cai1, et al.
Published: (2008-01-01) -
New signcryption algorithm for secure communication of ad hoc networks
by: ZHANG Chuan-rong1, et al.
Published: (2010-01-01) -
Efficient method of constructing parameters in R-ate paring
by: LI Bin, et al.
Published: (2010-01-01)