The TAMARIN prover for the symbolic analysis of security protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8044 LNCS, Issue , 2013, Pages 696-701

  Meier, Simon ^a   Schmidt, Benedikt ^b   Cremers, Cas ^a   Basin, David ^a  

^a ETH ZURICH   (Switzerland)

^b IMDEA SOFTWARE INSTITUTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ADVERSARY MODELS; EQUATIONAL REASONING; ITS APPLICATIONS; SECURITY PROTOCOLS; SYMBOLIC ANALYSIS;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

COMPUTER AIDED ANALYSIS;

EID: 84881193419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39799-8_48     Document Type: Conference Paper

References (15)

1. Cremers, C.J.F.: The Scyther Tool: Verification, falsification, and analysis of security protocols. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 414-418. Springer, Heidelberg (2008)
2. LaMacchia, B., Lauter, K., Mityagin, A.: Stronger security of authenticated key exchange. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol. 4784, pp. 1-16. Springer, Heidelberg (2007)
3. Schmidt, B., Meier, S., Cremers, C., Basin, D.: Automated analysis of Diffie-Hellman protocols and advanced security properties. In: Proc. CSF. IEEE (2012)
4. Meier, S.: Advancing Automated Security Protocol Verification. PhD thesis (2013)
5. Schmidt, B.: Formal Analysis of Key Exchange Protocols and Physical Protocols. PhD thesis (2012)
6. Comon-Lundh, H., Delaune, S.: The finite variant property: How to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 294-307. Springer, Heidelberg (2005) (Pubitemid 41313364)
7. http://www.infsec.ethz.ch/research/software/tamarin
8. Arapinis, M., Ritter, E., Ryan, M.: Statverif: Verification of stateful processes. In: Proc. CSF. IEEE (2011)
9. Mödersheim, S.: Abstraction by set-membership: verifying security protocols and web services with databases. In: Proc. CCS, pp. 351-360. ACM (2010)
10. Delaune, S., Kremer, S., Ryan, M.D., Steel, G.: Formal analysis of protocols based on TPM state registers. In: Proc. CSF, pp. 66-80. IEEE (2011)
11. Künnemann, R., Steel, G.: YubiSecure? Formal security analysis results for the YubiKey and YubiHSM. In: Jøsang, A., Samarati, P., Petrocchi, M. (eds.) STM 2012. LNCS, vol. 7783, pp. 257-272. Springer, Heidelberg (2013)
12. Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties. TCS 367, 162-202 (2006)
13. Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: Proc. CSFW. IEEE (2001)
14. Küsters, R., Truderung, T.: Reducing protocol analysis with xor to the xor-free case in the Horn theory based approach. J. Autom. Reasoning 46(3-4), 325-352 (2011)
15. Pankova, A., Laud, P.: Symbolic analysis of cryptographic protocols containing bilinear pairings. In: Proc. CSF. IEEE (2012)