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
相关论文
共 50 条
  • [1] A Core Calculus for Equational Proofs of Cryptographic Protocols
    Gancher, Joshua
    Sojakova, Kristina
    Fan, Xiong
    Shi, Elaine
    Morrisett, Greg
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL): : 866 - 892
  • [2] Ensuring the correctness of cryptographic protocols with respect to secrecy
    Houmani, Hanane
    Mejri, Mohamed
    SECRYPT 2008: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2008, : 184 - 189
  • [3] Sufficient conditions for secrecy under equational theories
    Houmani, Hanane
    Mejri, Mohamed
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON INFORMATION SECURITY AND ASSURANCE, 2008, : 380 - 383
  • [4] Secrecy by Witness-Functions under Equational Theories
    Fattahi, Jaouhar
    Mejri, Mohamed
    PROCEEDINGS OF THE 2015 7TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTERS AND ARTIFICIAL INTELLIGENCE (ECAI), 2015,
  • [5] Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
    Bozzano, M
    Delzanno, G
    JOURNAL OF SYMBOLIC COMPUTATION, 2004, 38 (05) : 1375 - 1415
  • [6] Automatic Verification for Secrecy of Cryptographic Protocols in First-Order Logic
    Han, Jihong
    Zhou, Zhiyong
    Wang, Yadi
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2009, 5 (01): : 14 - 14
  • [7] Automatic verification for secrecy of cryptographic protocols in first-order logic
    Han, Jihong
    Zhou, Zhiyong
    Wang, Yadi
    INTERNATIONAL SYMPOSIUM ON ADVANCES IN COMPUTER AND SENSOR NETWORKS AND SYSTEMS, PROCEEDINGS: IN CELEBRATION OF 60TH BIRTHDAY OF PROF. S. SITHARAMA IYENGAR FOR HIS CONTRIBUTIONS TO THE SCIENCE OF COMPUTING, 2008, : 75 - 80
  • [8] Deciding knowledge in security protocols under equational theories
    Abadi, Martin
    Cortier, Veronique
    THEORETICAL COMPUTER SCIENCE, 2006, 367 (1-2) : 2 - 32
  • [9] Accelerating Cryptographic Protocols: A Review of Theory and Technologies
    Hakkala, Antti
    Virtanen, Seppo
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON COMMUNICATION THEORY, RELIABILITY, AND QUALITY OF SERVICE (CTRQ 2011), 2011, : 103 - 109
  • [10] Deciding knowledge in security protocols under equational theories
    Abadi, M
    Cortier, V
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 46 - 58