Abstract
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. Because the PCL composition theorems support compositional reasoning about security protocols, including parallel composition of different protocols, and sequential composition of protocol steps, it is particularly useful in carrying out larger-scale security protocol studies. In this paper, PCL is extened by strand space model(SSM) and temporal logic (TL) to better describe and verify complex protocols. Based on improved PCL, the TLS protocol is verified as an example and proved to satisfy authentication property.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
