Security protocol verification: Symbolic and computational models

B Blanchet - International conference on principles of security and …, 2012 - Springer
Security protocol verification has been a very active research area since the 1990s. This
paper surveys various approaches in this area, considering the verification in the symbolic …

[BOG][B] Some tools

M Clavel, F Durán, S Eker, P Lincoln, N Martí-Oliet… - 2007 - Springer
This chapter describes some existing Maude-based tools that are available for download.
The first section describes tools concerned with analysis of either Maude specifications, or of …

Scyther: Semantics and verification of security protocols

CJF Cremers - 2006 - research.tue.nl
Recent technologies have cleared the way for large scale application of electronic
communication. The open and distributed nature of these communications implies that the …

Locus solum: From the rules of logic to the logic of rules

JY Girard - Mathematical structures in computer science, 2001 - cambridge.org
Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where
all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) …

[HTML][HTML] Lightweight authentication protocol for M2M communications of resource-constrained devices in industrial Internet of Things

E Lara, L Aguilar, MA Sanchez, JA García - Sensors, 2020 - mdpi.com
The Industrial Internet of Things (IIoT) consists of sensors, networks, and services to connect
and control production systems. Its benefits include supply chain monitoring and machine …

[PDF][PDF] Undecidability of bounded security protocols

J Mitchell, A Scedrov, N Durgin, P Lincoln - Workshop on formal methods …, 1999 - Citeseer
Using a multiset rewriting formalism with existential quanti cation, it is shown that protocol
security remains undecidable even when rather severe restrictions are placed on protocols …

Formal methods for cryptographic protocol analysis: Emerging issues and trends

C Meadows - IEEE journal on selected areas in …, 2003 - ieeexplore.ieee.org
The history of the application of formal methods to cryptographic protocol analysis spans
over 20 years and has been showing signs of new maturity and consolidation. Not only have …

Protocol insecurity with finite number of sessions is NP-complete

M Rusinowitch, M Turuani - 2001 - inria.hal.science
We investigate the complexity of the protocol insecurity problem for a finite number of
sessions (fixed number of interleaved runs). We show that this problem is NP-complete in a …

Multiset rewriting and the complexity of bounded security protocols

N Durgin, P Lincoln, J Mitchell… - Journal of Computer …, 2004 - journals.sagepub.com
We formalize the Dolev–Yao model of security protocols, using a notation based on multiset
rewriting with existentials. The goals are to provide a simple formal notation for describing …

[PDF][PDF] The Dolev-Yao intruder is the most powerful attacker

I Cervesato - 16th Annual Symposium on Logic in Computer Science …, 2001 - Citeseer
Most systems designed for the verification of security protocols operate under the unproved
assumption that an attack can only result from the combination of a fixed number of message …