Compositional refinement in agent-based security protocols

DOI10.1007/s00165-010-0164-1zbMath1245.68065OpenAlexW2017211568MaRDI QIDQ432140

Annabelle McIver, Carroll Morgan

Publication date: 3 July 2012

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-010-0164-1

zbMATH Keywords

compositional semanticsformalised secrecyhierarchical security reasoningrefinement of security

Mathematics Subject Classification ID

Cryptography (94A60) Logic in computer science (03B70) Network protocols (68M12) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Abstractions of non-interference security: probabilistic versus possibilistic ⋮ Probability timed automata for investigating communication processes

Cites Work

• Unnamed Item
• Unnamed Item
• The shadow knows: refinement and security in sequential programs
• Using probabilistic Kleene algebra pKA for protocol verification
• Power domains
• A calculus for cryptographic protocols: The spi calculus
• A semantic approach to secure information flow
• A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents
• A Proof System for Information Flow Security
• The Thousand-and-One Cryptographers
• Preserving Secrecy Under Refinement
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• A Couple of Novelties in the Propositional Calculus
• On Refinement-Closed Security Properties and Nondeterministic Compositions
• Static Analysis
• A per model of secure information flow in sequential programs

This page was built for publication: Compositional refinement in agent-based security protocols