On the relationship between strand spaces and multi-agent systems

@article{Halpern2003OnTR,
  title={On the relationship between strand spaces and multi-agent systems},
  author={Joseph Y. Halpern and Riccardo Pucella},
  journal={ArXiv},
  year={2003},
  volume={cs.CR/0306107}
}
Strand spaces are a popular framework for the analysis of security protocols. Strand spaces have some similarities to a formalism used successfully to model protocols for distributed systems, namely multi-agent systems. We explore the exact relationship between these two frameworks here. It turns out that a key difference is the handling of agents, which are unspecified in strand spaces and explicit in multi-agent systems. We provide a family of translations from strand spaces to multi-agent… Expand
A comparison between strand spaces and multiset rewriting for security protocol analysis
TLDR
The relationship illustrated here between multiset rewriting specifications and strand spaces suggests refinements to both frameworks, and deepens the understanding of the Dolev-Yao model. Expand
Adjusting a Knowledge-Based Algorithm for Multi-agent Communication for CPS
TLDR
This work shows the adjustments that have to be made to the knowledge-based algorithm for multi-agent communication for it to handle changes of initiator and shows that the gaining of knowledge required for a successful CPS process is still guaranteed. Expand
Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis
TLDR
This paper formally investigates the relationship between this version of distributed temporal logic and strand spaces, which is one of the most successful and widespread formalisms for analyzing security protocols. Expand
Anonymity and information hiding in multiagent systems
TLDR
This work gives several definitions of anonymity with respect to agents, actions, and observers in multiagent systems, and relates these definitions to other definitions of information hiding, such as secrecy. Expand
Relating Process Algebras and Multiset Rewriting ( for Example for Security Protocol Analysis )
Distributed systems are abstractly viewed as either a collection of agents communicating through a global state, or as a set of processes that evolve by pairwise exchanging messages. Languages andExpand
Modelling cryptographic protocols in a theory of action
TLDR
It is argued that not only is a full declarative specification necessary, but it is also much more flexible than previous approaches, permitting among other things interleaved runs of different protocols and participants with varying abilities. Expand
A Multi-agent Approach Toward the Security Analysis of the 802.11i Handshake Protocol
TLDR
This paper formally verify the authentication of a WMN by translating aWMN into a multi-agent system (MAS), where each node represents an agent of the MAS, and applying the strand system verification strategy to prove the correctness of MAS's authentication. Expand
Trust Management in Strand Spaces: A Rely-Guarantee Method
TLDR
The strand space framework for protocol analysis is extended by associating formulas from a trust management logic with the transmit and receive actions of the protocol principals by combining trust management theories with nonce-based cryptographic protocols. Expand
Role Interchange for Anonymity and Privacy of Voting
TLDR
It is shown that role interchangeability in a multiagent system is characterized by the existence of role-interchange functions on the set of traces corresponding to the system. Expand
Distributed temporal logic for the analysis of security protocol models
TLDR
This work illustrates how DTL can be used to formalize security models, protocols, and properties, and presents three concrete examples of metareasoning, and proves a general theorem about sufficient conditions for data to remain secret during communication. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 28 REFERENCES
Strand Spaces: Proving Security Protocols Correct
TLDR
The approach is distinguished from other work by the simplicity of the model, the precision of the results it produces, and the ease of developing intelligible and reliable proofs even without automated support. Expand
Events in security protocols
TLDR
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, aswell as providing conditions under which particular, more limited, models are adequate for the analysis of protocols. Expand
Events in Security Protocols
TLDR
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, aswell as providing conditions under which particular, more limited, models are adequate for the analysis of protocols. Expand
Naming and Identity in Epistemic Logic Part II: A First-Order Logic for Naming
TLDR
The main technical result of this paper is a first-order modal logic, specified both axiomatically and semantically (by a variant of possible-worlds semantics), that is expressive enough to cope with all the difficulties discussed. Expand
Naming and Identity in Epistemic Logics Part I: The Propositional Case
TLDR
The principles involved inModal epistemic logics for many agents often assume a xed one-to-one correspondence between agents and the names for agents that occur in the language, but this assumption restricts the applicability of any logic. Expand
Relating strands and multiset rewriting for security protocol analysis
TLDR
The strand formalism is extended with a way of incrementally growing bundles in order to emulate an execution of a protocol with parametric strands and directly relates the intruder theory from the multiset rewriting formalism to the penetrator strands. Expand
Towards a Strand Semantics for Authentication Logic
TLDR
The idea of using strand spaces as the model of computation underlying a semantics for BAN-style expressions is discussed, to help to integrate some of the approaches to security protocol analysis and to hopefully provide BAN logics with a clearer, more useful underlying model than they have had to date. Expand
Mixed strand spaces
TLDR
This paper identifies a simple and easily verified characteristic of protocols, and shows that the Otway-Rees protocol remains correct even when used in combination with other protocols that have this characteristic. Expand
Distributed Conflicts in Communicating Systems
We argue that the alternative composition operator of CCS not only lacks expressiveness, but also provides a too abstract description of conflicting activities. Hence, we propose to replace it with aExpand
Reasoning about knowledge
TLDR
Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed systems, artificial intelligence, and game theory. Expand
...
1
2
3
...