A Symbolic Framework to Analyse Physical Proximity in Security Protocols

DOI10.4230/LIPICS.FSTTCS.2018.29OpenAlexW2907830512MaRDI QIDQ5090968FDOQ5090968

Authors: Alexandre Debant, Stéphanie Delaune, Cyrille Wiedling 

Publication date: 21 July 2022

Full work available at URL: https://hal.archives-ouvertes.fr/hal-02390222

Recommendations

• Let’s Get Physical: Models and Methods for Real-World Security Protocols
• Sound proof of proximity of knowledge
• Optimal Proximity Proofs Revisited
• Optimal proximity proofs
• Formal analysis of distance bounding with secure hardware

zbMATH Keywords

verificationformal methodsprocess algebracryptographic protocolsdolev-Yao model

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites Work

• Mobile values, new names, and secure communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards the automated verification of cyber-physical security protocols: bounding the number of timed intruders
• Bounded memory protocols
• Secure and lightweight distance-bounding
• Analysing routing protocols: four nodes topologies are sufficient
• Efficient public-key distance bounding protocol

Cited In (1)

• Protocol analysis with time

This page was built for publication: A Symbolic Framework to Analyse Physical Proximity in Security Protocols

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