Verifying security protocols with PVS: widening the rank function approach

DOI10.1016/J.JLAP.2004.09.005zbMATH Open1078.68031DBLPjournals/jlp/EvansS05OpenAlexW2031129151WikidataQ60173606 ScholiaQ60173606MaRDI QIDQ2484411FDOQ2484411

Authors: S. A. Schneider, Neil D. Evans 

Publication date: 1 August 2005

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2004.09.005

Recommendations

• Communicating Sequential Processes. The First 25 Years
• scientific article; zbMATH DE number 1860614
• Verifying security protocols modelled by networks of automata
• Security protocol verification: symbolic and computational models
• SPVT: an efficient verification tool for security protocols

zbMATH Keywords

CSPPVSSecurity protocol analysisRank functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the security of public key protocols
• An attack on the Needham-Schroeder public-key authentication protocol

Cited In (6)

• Title not available (Why is that?)
• PVS embedding of cCSP semantic models and their relationship
• Verifying part of the ACCESS.bus protocol using PVS
• Formalization in PVS of balancing properties necessary for proving security of the Dolev-Yao cascade protocol model
• Communicating Sequential Processes. The First 25 Years
• SPVT: an efficient verification tool for security protocols

Uses Software

• PVS

This page was built for publication: Verifying security protocols with PVS: widening the rank function approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484411)