On the relationship between strand spaces and multi-agent systems

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2001, Pages 106-115

  Halpern, Joseph Y ^a   Pucella, Riccardo ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA;

STRAND SPACES;

MULTI AGENT SYSTEMS;

EID: 0035754511     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/501983.501999     Document Type: Conference Paper

References (21)

1. Defining liveness
2. Asynchronous protocols for optimistic fair exchange
3. A fair protocol for signing contracts
4. A logic of authentication
5. Distributed conflicts in communicating systems
6. Relating strands and multiset rewriting for security protocol analysis
7. A logical approach to multilevel security of probabilistic systems
8. Naming and identity in epistemic logic II: A first-order logic for naming
9. Naming and identity in propositional logics, Part I: The propositional case
10. A note on knowledge-based programs and specifications
11. A knowledge-based analysis of zero knowledge
12. Security models
13. Comparing the expressive power of the synchronous and the asynchronous pi-calculus
14. Analysis of a fair exchange protocol
15. Roles in cryptographic protocols
16. An authentication logic supporting synchronization, revocation, and recency
17. A logic for the analysis of cryptographic protocols
18. Towards a strand semantics for authentication logic
19. Mixed strand spaces
20. Strand spaces: Proving security protocols correct