ACM Home Page
Please provide us with feedback. Feedback
A complete and decidable security-specialised logic and its application to the TESLA protocol
Full text PdfPdf (260 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems table of contents
Hakodate, Japan
SESSION: Logics for agent systems table of contents
Pages: 145 - 152  
Year of Publication: 2006
ISBN:1-59593-303-4
Authors
Alessio Lomuscio  UCL, London, UK
Bozena Woźna  UCL, London, UK
Sponsors
IFMAS : The International Foundation for Multiagent Systems
ATAL : The International Workshop on Agent Theories, Architectures, and Languages
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 33,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1160633.1160658
What is a DOI?

ABSTRACT

We examine a logic to reason about security protocols by means of temporal and epistemic concepts. We report results on completeness and decidability of the formalism as well as its expressiveness. As a case study we apply the formalism in the analysis of TESLA, a secure stream multi-cast protocol.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
R. Accorsi, D. Basin, and L. Viganò. Towards an awareness-based semantics for security protocol analysis. In Post Proc. of LACPV'01, volume 55(1) of ENTCS, pp 5--24. Elsevier, 2003.
 
3
M. Archer. Proving correctness of the basic TESLA multicast stream authentication protocol with TAME. In Proc. of WITS'02, 2002.
 
4
 
5
 
6
M. Burrows, M. Abadi, and R. Needham. A logic of authentication. In Proc. of the Royal Society of London A, volume 426, pp. 233--271, 1989.
 
7
 
8
 
9
D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans. Inf. Theory, 29(2):198--208, 1983.
 
10
 
11
 
12
Li Gong, R. Needham, and R. Yahalom. Reasoning About Belief in Cryptographic Protocols. In Proceedings of IEEE Symposium on Research in Security and Privacy, pp. 234--248. IEEE Press, 1990.
 
13
 
14
J. Y. Halpern and R. Pucella. Modeling Adversaries in a Logic for Security Protocol Analysis. In Proc. of FASec'02, volume 2629 of LNCS, pp. 115--132. Springer-Verlag, 2002.
 
15
R. Kailar and V. D. Gligor. On belief evolution in authentication protocols. In Proc. of Computer Security Foundations Workshop IV, pp. 103--116. IEEE Press, 1991.
 
16
A. Lomuscio and B. Woźna. A combination of explicit and deductive knowledge with branching time: completeness and decidability results. In Post-proc. of DALT'05, volume 3904 of LNAI. 2006. To appear.
 
17
A. Lomuscio and F. Raimondi. MCMAS: A model checker for multi-agent systems. In Proc. of TACAS'06. Springer Verlag, March, 2006. To appear.
18
 
19
 
20
R. Pucella. Deductive Algorithmic Knowledge. In Proc. of SAIM'04, AI&M 22--2004, 2004.
 
21
 
22
M. Wooldridge. Reasoning about Rational Agents. MIT Press, 2000.


Collaborative Colleagues:
Alessio Lomuscio: colleagues
Bozena Woźna: colleagues