Abstract
Cryptographic protocols have been widely used to protect communications over insecure network environments. Existing cryptographic protocols usually contain flaws. To analyze these protocols and find potential flaws in them, the secure properties of them need be studied in depth. This paper attempts to provide a new framework to analyze and prove the secure properties in these protocols. A number of predicates and action functions are used to model the network communication environment. Domain rules are given to describe the transitions of principals' knowledge and belief states. An example of public key authentication protocols has been studied and analysed.
Original language | English (US) |
---|---|
Title of host publication | Conference Proceedings of the 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 |
Editors | T. Dahlberg, R. Oliver, A. Sen, G. Xue |
Pages | 3-9 |
Number of pages | 7 |
State | Published - Dec 12 2005 |
Externally published | Yes |
Event | 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 - Phoenix, AZ, United States Duration: Apr 7 2005 → Apr 9 2005 |
Other
Other | 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 |
---|---|
Country/Territory | United States |
City | Phoenix, AZ |
Period | 4/7/05 → 4/9/05 |
All Science Journal Classification (ASJC) codes
- General Engineering