Security Models and Proofs for Key Establishment Protocols
| dc.contributor.author | Ng, Eddie M. | en |
| dc.date.accessioned | 2006-08-22T14:20:57Z | |
| dc.date.available | 2006-08-22T14:20:57Z | |
| dc.date.issued | 2005 | en |
| dc.date.submitted | 2005 | en |
| dc.description.abstract | In this thesis we study the problem of secure key establishment, motivated by the construction of secure channels protocols to protect information transmitted over an open network. In the past, the purported security of a key establishment protocol was justified if it could be shown to withstand popular attack scenarios by heuristic analysis. Since this approach does not account for all possible attacks, the security guarantees are limited and often insufficient. This thesis examines the provable security approach to the analysis of key establishment protocols. We present the security models and definitions developed in 2001 and 2002 by Canetti and Krawczyk, critique the appropriateness of the models, and provide several security proofs under the definitions. In addition, we consider the importance of the key compromise impersonation resilience property in the context of these models. We list some open problems that were encountered in the study. | en |
| dc.format | application/pdf | en |
| dc.format.extent | 503090 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10012/1072 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.rights | Copyright: 2005, Ng, Eddie M.. All rights reserved. | en |
| dc.subject | Mathematics | en |
| dc.title | Security Models and Proofs for Key Establishment Protocols | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 1 of 1