Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/2666
Title: | Modeling Efficient Multi-Chained Stream Signature Protocol Using Communicating Sequential Processeses | Authors: | Koltuksuz, Ahmet Özkan, Murat Külahçıoğlu, Burcu |
Keywords: | Network security Processeses Security protocol verification Communicating Sequential Processeses |
Publisher: | Institute of Electrical and Electronics Engineers Inc. | Source: | Koltuksuz, A., Özkan, M., and Külahçıoğlu, B. (2010). Modeling efficient multi-chained stream signature protocol using communicating sequential processeses. Paper presented at the 4th IEEE International Conference on Secure Software Integration and Reliability Improvement Companion. doi:10.1109/SSIRI-C.2010.23 | Abstract: | Communicating Sequential Processes (CSP) is a process algebra, designed for modeling and analyzing the behavior of concurrent systems. Several security protocols are modeled with CSP and verified using model-checking or theorem proving techniques successfully. Unlike other authentication protocols modeled using CSP, each of the Efficient Multi-chained Stream Signature (EMSS) protocol messages are linked to the previous messages, forming hash chains, which introduces difficulties for modeling and verification. In this paper; we model the EMSS stream authentication protocol using CSP and verify its authentication properties with model checking, by building an infinite state model of the protocol which is reduced into a finite state model. © 2010 IEEE. | Description: | 4th IEEE International Conference on Secure Software Integration and Reliability Improvement Companion, SSIRI-C 2010; Singapore; Singapore; 9 June 2010 through 11 June 2010 | URI: | http://doi.org/10.1109/SSIRI-C.2010.23 http://hdl.handle.net/11147/2666 |
ISBN: | 9780769540870 |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
Show full item record
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.