Probability timed automata for investigating communication processes

Henryk Piech; Grzegorz Grodzki

International Journal of Applied Mathematics and Computer Science (2015)

  • Volume: 25, Issue: 2, page 403-414
  • ISSN: 1641-876X

Abstract

top
Exploitation characteristics behaves as a decreasing valors factor (DVF) which can be connected with degradation processes. It is a structure that consists of independent attributes which represent situations generally connected with a given exploitation factor. The multi-attribute structure contains attributes directly and indirectly referring to the main factor. Attribute states, by definition, can only maintain or decrease their values. Such situations are met in security, reliability, exploitation, fatigues and many complex one-directed or irreversible processes. The main goal refers to protocol security analysis during the realization of the communication run that specifies the assessment of the level of current and oncoming threats connected with cryptography authentication. In the communication run, the operations of different protocols mutually interleave. Our concept is based on the algorithm of attributes correction during exploitation process realization (Blanchet et al., 2008). The monitoring and correcting procedures make it possible to provide forecast information about possible threats on the basis of the structure of the current attribute values.

How to cite

top

Henryk Piech, and Grzegorz Grodzki. "Probability timed automata for investigating communication processes." International Journal of Applied Mathematics and Computer Science 25.2 (2015): 403-414. <http://eudml.org/doc/270463>.

@article{HenrykPiech2015,
abstract = {Exploitation characteristics behaves as a decreasing valors factor (DVF) which can be connected with degradation processes. It is a structure that consists of independent attributes which represent situations generally connected with a given exploitation factor. The multi-attribute structure contains attributes directly and indirectly referring to the main factor. Attribute states, by definition, can only maintain or decrease their values. Such situations are met in security, reliability, exploitation, fatigues and many complex one-directed or irreversible processes. The main goal refers to protocol security analysis during the realization of the communication run that specifies the assessment of the level of current and oncoming threats connected with cryptography authentication. In the communication run, the operations of different protocols mutually interleave. Our concept is based on the algorithm of attributes correction during exploitation process realization (Blanchet et al., 2008). The monitoring and correcting procedures make it possible to provide forecast information about possible threats on the basis of the structure of the current attribute values.},
author = {Henryk Piech, Grzegorz Grodzki},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {protocol logic; probabilistic timed automata; communication security},
language = {eng},
number = {2},
pages = {403-414},
title = {Probability timed automata for investigating communication processes},
url = {http://eudml.org/doc/270463},
volume = {25},
year = {2015},
}

TY - JOUR
AU - Henryk Piech
AU - Grzegorz Grodzki
TI - Probability timed automata for investigating communication processes
JO - International Journal of Applied Mathematics and Computer Science
PY - 2015
VL - 25
IS - 2
SP - 403
EP - 414
AB - Exploitation characteristics behaves as a decreasing valors factor (DVF) which can be connected with degradation processes. It is a structure that consists of independent attributes which represent situations generally connected with a given exploitation factor. The multi-attribute structure contains attributes directly and indirectly referring to the main factor. Attribute states, by definition, can only maintain or decrease their values. Such situations are met in security, reliability, exploitation, fatigues and many complex one-directed or irreversible processes. The main goal refers to protocol security analysis during the realization of the communication run that specifies the assessment of the level of current and oncoming threats connected with cryptography authentication. In the communication run, the operations of different protocols mutually interleave. Our concept is based on the algorithm of attributes correction during exploitation process realization (Blanchet et al., 2008). The monitoring and correcting procedures make it possible to provide forecast information about possible threats on the basis of the structure of the current attribute values.
LA - eng
KW - protocol logic; probabilistic timed automata; communication security
UR - http://eudml.org/doc/270463
ER -

References

top
  1. Basagiannis, S., Katsaros, P. and Pombortsis, A. (2010). An intruder model with message inspection for model checking security protocols, Computers and Security 29(1): 16-34. 
  2. Basin, D., Caleiro, C., Ramos, J. and Viganò, L. (2011). Distributed temporal logic for the analysis of security protocol models, Theoretical Computer Science 412(31): 4007-4043. Zbl1253.68053
  3. Blanchet, B., Abadi, M. and Fournet, C. (2008). Automated verification of selected equivalences for security protocols, Journal of Logic and Algebraic Programming 75(1): 3-51. Zbl1135.68007
  4. Burrows, M., Abadi, M. and Needham, R. (1990). A logic of authentication, ACM Transactions on Computer Systems 8(1): 18-36, DOI: 10.1145/77648.77649. Zbl0687.68007
  5. Ciobâcǎ, S., Delaune, S. and Kremer, S. (2012). Computing knowledge in security protocols under convergent equational theories, Journal of Automated Reasoning 48(2): 219-262. Zbl1242.68098
  6. Dechesne, F. and Wang, Y. (2010). To know or not to know: Epistemic approaches to security protocol verification, Synthese 177(1): 51-76. Zbl1225.03017
  7. Gosti, W., Villa, T., Saldanha, A. and Sangiovanni-Vincentelli, A. (2007). FSM encoding for BDD representations, International Journal of Applied Mathematics and Computer Science 17(1): 113-128, DOI: 10.2478/v10006-007-0011-6. Zbl1153.68553
  8. Gu, T. and Dong, R. (2005). A novel continuous model to approximate time Petri nets: Modelling and analysis, International Journal of Applied Mathematics and Computer Science 15(1): 141-150. Zbl1086.93041
  9. Kwiatkowska, M., Norman, G. and Parker, D. (2004). PRISM 2.0: A tool for probabilistic model checking, 1st International Conference on Quantitative Evaluation of Systems (QEST'04), Enschede, The Netherlands, pp. 322-323. 
  10. Kwiatkowska, M., Norman, G., Parker, D. and Sproston, J. (2003). Performance analysis of probabilistic timed automata using digital clocks, in K. Larsen and P. Niebert (Eds.), Formal Modeling and Analysis of Timed Systems (FORMATS'03), Lecture Notes in Computer Science, Vol. 2791, Springer-Verlag, Berlin/Heidelberg, pp. 105-120. Zbl1099.68534
  11. Lanotte, R., Maggiolo-Schettini, A. and Troina, A. (2010). Weak bisimulation for probabilistic timed automata, Theoretical Computer Science 411(50): 4291-4322. Zbl1208.68160
  12. Lindell, Y. and Pinkas, B. (2009). A proof of security of Yao's protocol for two-party computation, Journal of Cryptology 22(2): 161-188. Zbl1159.94364
  13. Luu, A., Sun, J., Liu, Y., Dong, J., Li, X. and Quan, T. (2012). SeVe: Automatic tool for verification of security protocols, Frontiers of Computer Science 6(1): 57-75. Zbl1251.68142
  14. McIver, A. and Morgan, C. (2011). Compositional refinement in agent-based security protocols, Formal Aspects of Computing 23(6): 711-737. Zbl1245.68065
  15. Pironti, A., Pozza, D. and Sisto, R. (2012). Formally based semi-automatic implementation of an open security protocol, Journal of Systems and Software 85(4): 835-849. 
  16. Sun, H., Wen, Q., Zhang, H. and Jin, Z. (2013). A novel pairing-free certificateless authenticated key agreement protocol with provable security, Frontiers of Computer Science 7(4): 544-557. 
  17. Xiong, L., Xiong, Y., Ma, J. and Wang, W. (2012). An efficient and security dynamic identity based authentication protocol for multi-server architecture using smart cards, Journal of Network and Computer Applications 35(2): 763-769. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.