Design and analysis of identification schemes without certificates
This thesis contributes to the study and advancement in the area of identification protocols without certificates. The contributions can be categorised into two main areas. Firstly, this work delves into advancing identity-based identification (IBI), where a user can implicitly certify himself using h...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 出版: |
2014
|
| 主題: | |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | This thesis contributes to the study and advancement in the area of identification protocols without certificates. The contributions can be categorised into two main areas.
Firstly, this work delves into advancing identity-based identification (IBI), where a user can implicitly certify himself using his identity-string. The section of
the thesis begins with a review of Crescenzo’s attempt to tackle Bellare et al.’s open problem of whether the Beth IBI scheme is secure against active/concurrent attacks
and a result showing that Crescenzo’s solution is flawed. An alternative solution is presented to achieve security against active/concurrent attackers with even better
security guarantee using the discrete logarithm assumption instead of its one-more counterpart. Furthermore, this technique is extended to Schnorr’s IBI scheme as well,
resulting in two schemes provable secure in the random oracle model. |
|---|