A knowledge-based analysis of zero knowledge
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
Naming and identity in epistemic logic part II: a first-order logic for naming
Artificial Intelligence
Reasoning about knowledge
An authentication logic supporting synchronization, revocation, and recency
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strand spaces: proving security protocols correct
Journal of Computer Security
Distributed Conflicts in Communicating Systems
ECOOP '94 Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Relating Strands and Multiset Rewriting for Security Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Roles in Cryptographic Protocols
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
A note on knowledge-based programs and specifications
Distributed Computing
A logical approach to multilevel security of probabilistic systems
Distributed Computing
A comparison between strand spaces and multiset rewriting for security protocol analysis
Journal of Computer Security
Anonymity and information hiding in multiagent systems
Journal of Computer Security
| Hi-index | 0.00 |
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 systems parameterized by the choice of agents in the strand space. We also show that not every multi-agent system of interest can be expressed as a strand space. This reveals a lack of expressiveness in the strand-space framework that can be characterized by our translation. To highlight this lack of expressiveness, we show one simple way in which strand spaces can be extended to model more systems.