Earticle

초록

영어

This paper shows the efficiency and the flexibility of the interpretation function-based method [8, 9, 11] through the analysis of some famous cryptographic protocols. In fact, by using the notion of interpretation function, this method gives general and sufficient conditions allowing to guarantee the secrecy property of cryptographic protocols. This result holds under a large class of equational theories, that makes the approach flexible and general. Moreover, the approach does not only help to prove the secrecy property, but also helps a lot to discover protocols weaknesses and to correct them. These advantages are discussed and illustrated by cases study of some protocols that are analyzed in different equational theories.

목차

Abstract
 1. Introduction
 2. Basic definitions
 3. Secrecy property
 4. Main result
 5. Guideline to Define a Safe Interpretation Function
  5.1. Restrictions on the Selection Function S
  5.2. Restrictions on the Function I
  5.3. Simple and Practical Steps to Construct F
  5.4. Example 1: The DEK Function
  5.5. Example 2: The DEKAN Function
 6. Analysis of Cryptographic Protocols under Different Equational Theories
  6.1. Who and Lam Protocol
  6.2. Shamir Three Pass Protocol and Commutativity of Encryption
  6.3. Bull Protocol and ⊕ Properties
  6.4. Needham-Schroeder Lowe Protocol and Homomorphism
 7. Conclusion
 References

저자

• Hanane Houmani [ LSFM Research Group, Computer Science Department, Laval University, Quebec, Canada ]
• Mohamed Mejri [ LSFM Research Group, Computer Science Department, Laval University, Quebec, Canada ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605