Parallel Real Time Investigation of Communication Security Changes Based on Probabilistic Timed Automata

Conference paper
Part of the Lecture Notes in Business Information Processing book series (LNBIP, volume 255)

Abstract

The proposition is connected with the research of the security or threats referring to message decryption, user dishonesty, a non-fresh nonce, uncontrolled information jurisdiction, etc. (that means security properties - attributes), in network communication processes [3]. Encrypted messages are usually sent in the form of protocol operations. Protocols may be mutually interleaving, creating the so called runs, and their operations can appear as mutual parallel processes. The investigation regards both particular security attributes and their compositions referring to more general factors, such as: concrete users, protocols, public keys, secrets, messages, etc. Probabilistic timed automata (PTA) and Petri nets characterize the token set and the complex form of conditions which have to be fulfilled for the realization of transition [5]. The abovementioned situation forms a conception pertaining to the parallel strategy realized with the help of the Petri net that includes the set of security tokens (attributes) in each node.

Keywords

Tensor analysis Protocol security Auditing system Probabilistic timed automata 

References

  1. 1.
    Abraham, R., Marsden, J.E., Rating, T.: Manifolds, Tensor Analysis and Application, 2nd edn. Springer, New York (1988)CrossRefGoogle Scholar
  2. 2.
    Beauquier, D.: On probabilistic timed automata. Theoret. Comput. Sci. 292, 65–84 (2003)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Burrows, M., Abadi, M., Needham, R.: A logic of authentication. ACM Trans. Comput. Syst. 8(1), 18–36 (1990). doi: 10.1145/77648.77649 CrossRefMATHGoogle Scholar
  4. 4.
    Gjøsteen, K.: A new security proof for Damgård’s ElGamal. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 150–158. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distribution. Theoret. Comput. Sci. 282, 101–150 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Li, X., Xiong, Y., Ma, J., Wang, W.: An efficient and security dynamic identity based authentication protocol for multi-server architecture using smart cards. J. Netw. Comput. Appl. 35(2), 763–769 (2012)CrossRefGoogle Scholar
  7. 7.
    Lindell, Y., Pinkas, B.: A proof of security of Yaos protocol for two-party computation. J. Cryptol. 22(2), 161–188 (2009)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Luu, A., Sun, J., Liu, Y., Dong, J., Li, X., Quan, T.: SeVe: automatic tool for verification of security protocols. Front. Comput. Sci. 6(1), 57–75 (2012)MathSciNetMATHGoogle Scholar
  9. 9.
    McIver, A., Morgan, C.: Compositional refinement in agent-based security protocols. Formal Aspects Comput. 23(6), 711–737 (2011)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Piech, H., Grodzki, G.: Probability timed automata for investigating communication processes. Appl. Math. Comput. Sci. 25(2), 403–414 (2015)MathSciNetMATHGoogle Scholar
  11. 11.
    Piech, H., Grodzki, G.: The system conception of investigation of the communication security level in networks. In: Abramowicz, W. (ed.) BIS Workshops 2013. LNBIP, vol. 160, pp. 148–159. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  12. 12.
    Tudruj, M., Masko, L.: Toward massively parallel computation based on dynamic clusters with communication on the fly. In: IS on Parallel and Distributed Computing, Lille, France, pp. 155–162 (2005)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Czestochowa University of TechnologyCzestochowaPoland

Personalised recommendations