A simple framework for real-time cryptographic protocol analysis with compositional proof rules
From MaRDI portal
Publication:1887729
DOI10.1016/J.SCICO.2004.01.001zbMath1073.68029OpenAlexW2159256409MaRDI QIDQ1887729
Roberto Gorrieri, Fabio Martinelli
Publication date: 22 November 2004
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2004.01.001
Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Dynamics Security Policies and Process Opacity for Timed Process Algebras ⋮ Constraint Abstraction in Verification of Security Protocols ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ Tempus fugit: How to plug it ⋮ Formal models and analysis of secure multicast in wired and wireless networks ⋮ Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting
This page was built for publication: A simple framework for real-time cryptographic protocol analysis with compositional proof rules
