-
1
-
-
0003092378
-
A calculus for cryptographic protocols: The spi calculus
-
Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1-70 (1999)
-
(1999)
Information and Computation
, vol.148
, Issue.1
, pp. 1-70
-
-
Abadi, M.1
Gordon, A.D.2
-
2
-
-
26444497860
-
-
Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, L., Drielsma, P., Heám, P., Kouchnarenko, O., Mödersheim, J.M.S., von Oheimb, D., Rusinowitch, M., Santiago, J., Turuani, M., Viganò, L., Vigneron, L.: The avispa tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, 3576, pp. 281-285. Springer, Heidelberg (2005)
-
Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, L., Drielsma, P., Heám, P., Kouchnarenko, O., Mödersheim, J.M.S., von Oheimb, D., Rusinowitch, M., Santiago, J., Turuani, M., Viganò, L., Vigneron, L.: The avispa tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 281-285. Springer, Heidelberg (2005)
-
-
-
-
3
-
-
35048817493
-
Causality-based abstraction of multiplicity in cryptographic protocols
-
IEEE, Los Alamitos
-
Backes, M., Cortesi, A., Maffei, M.: Causality-based abstraction of multiplicity in cryptographic protocols. In: Proc. 20th IEEE Symposium on Computer Security Foundations (CSF), pp. 355-369. IEEE, Los Alamitos (2007)
-
(2007)
Proc. 20th IEEE Symposium on Computer Security Foundations (CSF)
, pp. 355-369
-
-
Backes, M.1
Cortesi, A.2
Maffei, M.3
-
4
-
-
48949092617
-
-
Backes, M., Lorenz, S., Maffei, M., Pecina, K.: The CASPA tool, www.infsec.cs.uni-sb.de/caspa
-
The CASPA tool
-
-
Backes, M.1
Lorenz, S.2
Maffei, M.3
Pecina, K.4
-
5
-
-
19744367735
-
Ofmc: A symbolic model checker for security protocols
-
Basin, D.A., Mödersheim, S., Viganò, L.: Ofmc: A symbolic model checker for security protocols. IJIS 4(3), 181-208 (2005)
-
(2005)
IJIS
, vol.4
, Issue.3
, pp. 181-208
-
-
Basin, D.A.1
Mödersheim, S.2
Viganò, L.3
-
6
-
-
0034822279
-
An efficient cryptographic protocol verifier based on Prolog rules
-
IEEE, Los Alamitos
-
Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: Proc. 14th IEEE Computer Security Foundations Workshop (CSFW), pp. 82-96. IEEE, Los Alamitos (2001)
-
(2001)
Proc. 14th IEEE Computer Security Foundations Workshop (CSFW)
, pp. 82-96
-
-
Blanchet, B.1
-
7
-
-
35248878042
-
Verification of cryptographic protocols: Tagging enforces termination
-
Gordon, A.D, ed, ETAPS 2003 and FOSSACS 2003, Springer, Heidelberg
-
Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol. 2620, pp. 136-152. Springer, Heidelberg (2003)
-
(2003)
LNCS
, vol.2620
, pp. 136-152
-
-
Blanchet, B.1
Podelski, A.2
-
8
-
-
24144452823
-
Static validation of security protocols
-
Bodei, C., Buchholtz, M., Degano, P., Nielson, F., Nielson, H.R.: Static validation of security protocols. Journal of Computer Security 13(3), 347-390 (2005)
-
(2005)
Journal of Computer Security
, vol.13
, Issue.3
, pp. 347-390
-
-
Bodei, C.1
Buchholtz, M.2
Degano, P.3
Nielson, F.4
Nielson, H.R.5
-
9
-
-
33749381421
-
-
Boichut, Y., Genet, T.: Feasible trace reconstruction for rewriting approximations. In: Pfenning, F. (ed.) RTA 2006. LNCS, 4098, pp. 123-135. Springer, Heidelberg (2006)
-
Boichut, Y., Genet, T.: Feasible trace reconstruction for rewriting approximations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 123-135. Springer, Heidelberg (2006)
-
-
-
-
10
-
-
4944247375
-
Formal analysis of multi-party contract signing
-
IEEE, Los Alamitos
-
Chadha, R., Kremer, S., Scedrov, A.: Formal analysis of multi-party contract signing. In: Proc. 17th IEEE Computer Security Foundations Workshop (CSFW), pp. 266-279. IEEE, Los Alamitos (2004)
-
(2004)
Proc. 17th IEEE Computer Security Foundations Workshop (CSFW)
, pp. 266-279
-
-
Chadha, R.1
Kremer, S.2
Scedrov, A.3
-
12
-
-
35048899619
-
Searching for shapes in cryptographic protocols
-
Grumberg, O, Huth, M, eds, TACAS 2007, Springer, Heidelberg
-
Doghmi, S., Guttman, J., Thayer, F.: Searching for shapes in cryptographic protocols. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 523-537. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4424
, pp. 523-537
-
-
Doghmi, S.1
Guttman, J.2
Thayer, F.3
-
13
-
-
84937398672
-
-
Genet, T., Tong, V.: Reachability Analysis of Term Rewriting Systems with Timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), 2250, pp. 695-706. Springer, Heidelberg (2001)
-
Genet, T., Tong, V.: Reachability Analysis of Term Rewriting Systems with Timbuk. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 695-706. Springer, Heidelberg (2001)
-
-
-
-
16
-
-
0032678887
-
Athena: A new efficient automatic checker for security protocol analysis
-
IEEE, Los Alamitos
-
Song, D.X.: Athena: a new efficient automatic checker for security protocol analysis. In: Proc. 12th IEEE Computer Security Foundations Workshop (CSFW), pp. 192-202. IEEE, Los Alamitos (1999)
-
(1999)
Proc. 12th IEEE Computer Security Foundations Workshop (CSFW)
, pp. 192-202
-
-
Song, D.X.1
-
17
-
-
0002508587
-
A lesson on authentication protocol design
-
Woo, T.Y.C., Lam, S.S.: A lesson on authentication protocol design. Operation Systems Review 28(3), 24-37 (1994)
-
(1994)
Operation Systems Review
, vol.28
, Issue.3
, pp. 24-37
-
-
Woo, T.Y.C.1
Lam, S.S.2
|