On symbolic analysis of cryptographic protocols
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/33331 |
| _version_ | 1826188357356486656 |
|---|---|
| author | Patil, Akshay (Akshay R.) |
| author2 | Ronald L. Rivest and Ran Canetti. |
| author_facet | Ronald L. Rivest and Ran Canetti. Patil, Akshay (Akshay R.) |
| author_sort | Patil, Akshay (Akshay R.) |
| collection | MIT |
| description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. |
| first_indexed | 2024-09-23T07:58:06Z |
| format | Thesis |
| id | mit-1721.1/33331 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T07:58:06Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/333312019-04-09T15:51:18Z On symbolic analysis of cryptographic protocols Patil, Akshay (Akshay R.) Ronald L. Rivest and Ran Canetti. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. Includes bibliographical references (p. 91-94). The universally composable symbolic analysis (UCSA) framework layers Dolev-Yao style symbolic analysis on top of the universally composable (UC) secure framework to construct computationally sound proofs of cryptographic protocol security. The original proposal of the UCSA framework by Canetti and Herzog (2004) focused on protocols that only use public key encryption to achieve 2-party mutual authentication or key exchange. This thesis expands the framework to include protocols that use digital signatures as well. In the process of expanding the framework, we identify a flaw in the framework's use of UC ideal functionality FKE. We also identify issues that arise when combining FKE with the current formulation of ideal signature functionality FSI,. Motivated by these discoveries, we redefine the FPKE and FsIG functionalities appropriately. by Akshay Patil. M.Eng. 2006-07-13T15:15:55Z 2006-07-13T15:15:55Z 2005 2005 Thesis http://hdl.handle.net/1721.1/33331 62326058 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 94 p. 4556148 bytes 4560019 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Patil, Akshay (Akshay R.) On symbolic analysis of cryptographic protocols |
| title | On symbolic analysis of cryptographic protocols |
| title_full | On symbolic analysis of cryptographic protocols |
| title_fullStr | On symbolic analysis of cryptographic protocols |
| title_full_unstemmed | On symbolic analysis of cryptographic protocols |
| title_short | On symbolic analysis of cryptographic protocols |
| title_sort | on symbolic analysis of cryptographic protocols |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/33331 |
| work_keys_str_mv | AT patilakshayakshayr onsymbolicanalysisofcryptographicprotocols |