Compositional refinement in agent-based security protocols

DOI10.1007/S00165-010-0164-1MaRDI QIDQ432140zbMATH OpenOpenAlexFDO

Authors 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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Network protocols (68M12)

Recommendations

• Secure protocol composition
• Proof-based design of security protocols
• Safely composing security protocols
• On the use of data refinement in the development of secure communications systems
• Safely Composing Security Protocols

Cites work

• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 605806 (Why is no real title available?)
• A Couple of Novelties in the Propositional Calculus
• A calculus for cryptographic protocols: The spi calculus
• A per model of secure information flow in sequential programs
• A proof system for information flow security
• A refinement theory that supports reasoning about knowledge and time for synchronous agents
• A semantic approach to secure information flow
• On refinement-closed security properties and nondeterministic compositions
• Power domains
• Preserving Secrecy Under Refinement
• Static Analysis
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• The Thousand-and-One Cryptographers
• The shadow knows: refinement and security in sequential programs
• Using probabilistic Kleene algebra pKA for protocol verification

Cited in

(7)

• Proof-based design of security protocols
• On the use of data refinement in the development of secure communications systems
• Security properties: two agents are sufficient
• Probability timed automata for investigating communication processes
• Information Security
• Abstractions of non-interference security: probabilistic versus possibilistic
• Theory of Cryptography

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

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