Using temporal logics of knowledge in the formal verification of security protocols

Author(s):  
C. Dixon ◽  
M.-C.F. Gago ◽  
M. Fisher ◽  
W. van der Hoek
2003 ◽  
Vol 43 (5) ◽  
pp. 601-618 ◽  
Author(s):  
Tom Coffey ◽  
Reiner Dojen ◽  
Tomas Flanagan

2022 ◽  
Vol 2161 (1) ◽  
pp. 012046
Author(s):  
R Pradeep ◽  
N R Sunitha

Abstract A smart city is a technologically advanced metropolitan region with several connected devices that collects data using various electronic technologies, voice activation methods, and sensors. The information obtained from the data is utilised to efficiently manage assets, resources, and services; in turn, the data is used to enhance operations throughout the city. Achieving security for smart cities is one of the major challenges as the number of connected devices increases the vulnerability also increases. The security of a smart city system depends on the reliability of the security protocols used by the security systems. To design and develop a highly secure system for a smart city the security protocols used must be highly reliable. To prove the reliability of a security protocol the validation technique is not desirable because of its several drawbacks, these drawbacks can be overcome using the formal verification technique which provides the mathematical proof for its correctness. In this work, The Challenge-Handshake Authentication Protocol Point-to-Point (CHAP PPP) which is more commonly used in PPP authentication of smart cities is formally verified using the well-known verification technique known as the model checking technique. The Scyther model checker is the tool used to build the abstract security protocol model.


Author(s):  
AGATHE MERCERON ◽  
G. MICHELE PINNA

Formal verification of properties in reactive real-time systems is crucial, as these systems are often safety-critical. Such systems are successfully implemented using synchronous languages, where refinement is a relevant operation. This paper investigates the interplay between this operation and formal verification. It turns out that, while for the refined program component-based verification of properties expressed using suitable temporal logics is easily achieved, component-based verification from the point of view of the refining program is best achieved with observers. Our results are based on a translation of synchronous programs into Boolean automata. Their practical relevance is illustrated with a protocol case study.


Author(s):  
Tom Coffey

This chapter concerns the correct and reliable design of modern security protocols. It discusses the importance of formal verification of security protocols prior to their release by publication or implementation. A discussion on logic-based verification of security protocols and its automation provides the reader with an overview of the current state-of-the-art of formal verification of security protocols. The authors propose a formal verification centred development process for security protocols. This process provides strong confidence in the correctness and reliability of the designed protocols. Thus, the usage of weak security protocols in communication systems is prevented. A case-study on the development of a security protocol demonstrates the advantages of the proposed approach. The case-study concludes with remarks on the performance of automated logic-based verification and presents an overview of formal verification results of a range of modern security protocols.


Sign in / Sign up

Export Citation Format

Share Document