Protocol analysis with time

DOI10.1007/978-3-030-65277-7_7zbMath1492.94055arXiv2010.13707OpenAlexW3093757258MaRDI QIDQ2152027

Damián Aparicio-Sánchez, José Meseguer, Santiago Escobar, Julia Sapiña, Catherine A. Meadows

Publication date: 6 July 2022

Full work available at URL: https://arxiv.org/abs/2010.13707

zbMATH Keywords

cryptographic protocolsMaude-NPA protocol

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Protocol analysis with time and space ⋮ An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis

Cites Work

• Unnamed Item
• Towards the automated verification of cyber-physical security protocols: bounding the number of timed intruders
• Symbolic timed trace equivalence
• Solving SAT and SAT Modulo Theories
• Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
• A Symbolic Framework to Analyse Physical Proximity in Security Protocols

This page was built for publication: Protocol analysis with time