Abstract
We discuss the advantages and limitations of the main proof-based approaches to the formal verification of cryptographic protocols. We show possible routes for addressing their limitations by combining them with model-checking techniques. More precisely we argue that proof-based techniques can be used for providing a general framework, model-checking techniques for mechanization and invariant techniques for bringing precise understanding of protocol strengths and weaknesses.KeywordsModal LogicSecurity PropertyVisible ActionFormal VerificationCryptographic ProtocolThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
