Secrecy of cryptographic protocols under equational theory

被引:8
作者
Houmani, H. [1 ]
Mejri, M. [1 ]
Fujita, H. [2 ]
机构
[1] Univ Laval, Ste Foy, PQ G1K 7P4, Canada
[2] Iwate Prefectural Univ, Takizawa, Iwate 0200193, Japan
基金
加拿大自然科学与工程研究理事会;
关键词
Secrecy; Cryptographic protocols; Equational theory; SECURITY PROTOCOLS;
D O I
10.1016/j.knosys.2008.11.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper gives a novel approach to verify the secrecy property of cryptographic protocols under equational theories. indeed, by using the notion of interpretation functions, this paper presents some sufficient and practical conditions allowing to guarantee the secrecy property of cryptographic protocols under any equational theory. An interpretation function is a safe means by which an agent can estimate the security level of message components that he receives so that he can handle them correctly. Also, this paper proves that polynomials help a lot with the construction of an interpretation function and gives a guideline on how to construct such functions together with an example and how to use it to analyse a cryptographic protocol. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:160 / 173
页数:14
相关论文
共 16 条
[1]   Secrecy by typing in security protocols [J].
Abadi, M .
JOURNAL OF THE ACM, 1999, 46 (05) :749-786
[2]   Deciding knowledge in security protocols under equational theories [J].
Abadi, Martin ;
Cortier, Veronique .
THEORETICAL COMPUTER SCIENCE, 2006, 367 (1-2) :2-32
[3]  
BOREALE M, 2002, J TELECOMMUNICATION, P28
[4]  
COMON H, 2002, J TELECOMMUNICATIONS
[5]  
Comon-Lundh H, 2003, LECT NOTES COMPUT SC, V2706, P148
[6]  
DEBBABI M, 1997, P 2 INT WORKSH ENT S
[7]  
DELICATA R, 2005, CSFW 05, P126
[8]  
Dershowitz N., 1990, Formal Models and Semantics, P243
[9]  
HOUMANI H, 2007, INT C SEC CRYPT SECR
[10]  
HOUMANI H, 2003, FDN COMPUTER SECURIT, P85