Unclonable dynamic k-times anonymous authentication
In previous works of k-times anonymous authentication,two problems have not been properly solved:1)how to allow application providers to assign different maximal numbers of access for each user without weakened anonymity,and 2)how to protect against massive clone attacks mounted by malicious users.T...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-07-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)07-0075-15/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!