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.

Meeting Name

IEEE International Performance, Computing, and Communications Conference, 2005

Department(s)

Computer Science

Sponsor(s)

Engineering and Physical Sciences Research Council
K. C. Wong Education Foundation
National Natural Science Foundation (China)

Keywords and Phrases

Inference Mechanisms; Telecommunication Society

Library of Congress Subject Headings

Computer network protocols
Cryptography

Document Type

Article - Conference proceedings

Document Version

Final Version

File Type

text

Language(s)

English

Rights

© 2005 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Full Text Link

Share

 
COinS