À propos de cet article

Citez

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.10.1016/j.cose.2009.08.003Search in Google Scholar

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.10.1016/j.tcs.2011.04.006Search in Google Scholar

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.10.1016/j.jlap.2007.06.002Search in Google Scholar

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.10.1145/77648.77649Search in Google Scholar

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.10.1007/s10817-010-9197-7Search in Google Scholar

Dechesne, F. and Wang, Y. (2010). To know or not to know: Epistemic approaches to security protocol verification, Synthese 177(1): 51-76.10.1007/s11229-010-9765-8Search in Google Scholar

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.10.2478/v10006-007-0011-6Search in Google Scholar

Gu, T. and Dong, R. (2005). A novel continuous model to approximate time Petri nets: Modelling and analysis, In ternational Journal of Applied Mathematics and Computer Science 15(1): 141-150.Search in Google Scholar

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.Search in Google Scholar

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.Search in Google Scholar

Lanotte, R., Maggiolo-Schettini, A. and Troina, A. (2010). Weak bisimulation for probabilistic timed automata, Theoretical Computer Science 411(50): 4291-4322.10.1016/j.tcs.2010.09.003Search in Google Scholar

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.10.1007/s00145-008-9036-8Search in Google Scholar

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.Search in Google Scholar

McIver, A. and Morgan, C. (2011). Compositional refinement in agent-based security protocols, Formal Aspects of Computing 23(6): 711-737.10.1007/s00165-010-0164-1Search in Google Scholar

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.10.1016/j.jss.2011.10.052Search in Google Scholar

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.10.1007/s11704-013-2305-1Search in Google Scholar

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. 10.1016/j.jnca.2011.11.009Search in Google Scholar

eISSN:
2083-8492
Langue:
Anglais
Périodicité:
4 fois par an
Sujets de la revue:
Mathematics, Applied Mathematics