|
CityU Institutional Repository >
CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Science >
CS - Master of Philosophy >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2031/4409
|
| Title: | Anonymous and authenticated key exchange |
| Other Titles: | Ni ming ren zheng he dui chen mi yao hu huan xie yi 匿名認證和對稱密鑰互換協議 |
| Authors: | Yang, Guomin (楊國民) |
| Department: | Dept. of Computer Science |
| Degree: | Master of Philosophy |
| Issue Date: | 2006 |
| Publisher: | City University of Hong Kong |
| Subjects: | Computer networks -- Security measures Public key infrastructure (Computer security) |
| Notes: | CityU Call Number: QA76.9.A25 Y36 2006 Includes bibliographical references (leaves 106-113) Thesis (M.Phil.)--City University of Hong Kong, 2006 viii, 113 leaves ; 30 cm. |
| Type: | Thesis |
| Abstract: | Authenticated key exchange (AKE, for short) protocols are mechanisms by which two or more parties that communicate over an insecure network can generate a shared secret key. They are a central piece for building secure communication channels (e.g. SSL, IPSec). However, after three decades of research, design and analysis of secure AKE protocols have been proved to be a non-trivial task. In this thesis, we target to propose some systematic ways for the construction of provably secure AKE protocols in di®erent settings. We will review and analyze previous security models and de¯nitions in both the standard and the password based settings. We also propose security requirements and a formal de¯nition for secure roaming since user mobility is becoming very important and getting widely available in our communications systems nowadays. In addition, we propose a set of desirable properties for the smart-card-based password authentication protocols and a generic con- struction framework. In particular, we show that a secure password based authentication and key exchange protocol can be transformed e±ciently to a smart-card-based password authentication and key exchange scheme satis- fying all of our desirable properties provided that there exist pseudorandom functions and collision resistant hash functions. As user privacy is also becoming a notable security issue, we further provide methods to transform all the protocols presented in this thesis to user-anonymous versions |
| Online Catalog Link: | http://lib.cityu.edu.hk/record=b2147131 |
| Appears in Collections: | CS - Master of Philosophy
|
Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.
|