Petr nets, algebras, morphisms, and compositionality
Information and Computation
Handbook of logic in computer science (vol. 4)
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
Proving Security Protocols Correct
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Relating Strands and Multiset Rewriting for Security Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
On the relationship between strand spaces and multi-agent systems
ACM Transactions on Information and System Security (TISSEC)
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A compositional logic for proving security properties of protocols
Journal of Computer Security - Special issue on CSFW14
Theoretical Computer Science - Logic, semantics and theory of programming
Relating multiset rewriting and process algebras for security protocol analysis
Journal of Computer Security - Special issue on WITS'03
A comparison between strand spaces and multiset rewriting for security protocol analysis
Journal of Computer Security
A formal semantics for protocol narrations
Theoretical Computer Science
A Chart Semantics for the Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Universal concurrent constraint programing: symbolic semantics and applications to security
Proceedings of the 2008 ACM symposium on Applied computing
Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Dissecting the Meaning of an Encrypted Message: An Approach to Discovering the Goals of an Adversary
EuroISI '08 Proceedings of the 1st European Conference on Intelligence and Security Informatics
Time and Fairness in a Process Algebra with Non-blocking Reading
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Adding Branching to the Strand Space Model
Electronic Notes in Theoretical Computer Science (ENTCS)
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
Metareasoning about Security Protocols using Distributed Temporal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coordination-based Methodology for Security Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling and analysis of agent-based specifications of security protocols using CSANs and PDETool
IIT'09 Proceedings of the 6th international conference on Innovations in information technology
Distributed temporal logic for the analysis of security protocol models
Theoretical Computer Science
A declarative framework for security: secure concurrent constraint programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
A generic model for analyzing security protocols
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the inductive method. But neither of these approaches builds up the events of a protocol in a compositional way, so that there is an informal spring from the protocol to its model. By broadening the models to certain kinds of Petri nets, a restricted form of contextual nets, a compositional event-based semantics is given to an economical, but expressive, language for describing security protocols; so the events and dependency of a wide range of protocols are determined once and for all. The net semantics is formally related to a transition semantics, strand spaces and inductive rules, as well as trace languages and event structures, so unifying a range of approaches, as well as providing conditions under which particular, more limited, models are adequate for the analysis of protocols. The net semantics allows the derivation of general properties and proof principles which are demonstrated in establishing an authentication property, following a diagrammatic style of proof.