Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method
Most applications in the Internet such as e-banking and e-commerce use the SET and the NSL protocols to protect the communication channel between the client and the server. Then, it is crucial to ensure that these protocols respect some security properties such as confidentiality, authentication, an...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Journal of Computer Networks and Communications |
Online Access: | http://dx.doi.org/10.1155/2012/254942 |
id |
doaj-3f783f69fce848b197b5fa0c361cb130 |
---|---|
record_format |
Article |
spelling |
doaj-3f783f69fce848b197b5fa0c361cb1302020-11-25T00:12:30ZengHindawi LimitedJournal of Computer Networks and Communications2090-71412090-715X2012-01-01201210.1155/2012/254942254942Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based MethodHanane Houmani0Mohamed Mejri1EAS Group, ENSEM, Hassan II University, Casablanca, MoroccoLSFM Group, Laval University, Quebec, QC, CanadaMost applications in the Internet such as e-banking and e-commerce use the SET and the NSL protocols to protect the communication channel between the client and the server. Then, it is crucial to ensure that these protocols respect some security properties such as confidentiality, authentication, and integrity. In this paper, we analyze the SET and the NSL protocols with respect to the confidentiality (secrecy) property. To perform this analysis, we use the interpretation functions-based method. The main idea behind the interpretation functions-based technique is to give sufficient conditions that allow to guarantee that a cryptographic protocol respects the secrecy property. The flexibility of the proposed conditions allows the verification of daily-life protocols such as SET and NSL. Also, this method could be used under different assumptions such as a variety of intruder abilities including algebraic properties of cryptographic primitives. The NSL protocol, for instance, is analyzed with and without the homomorphism property. We show also, using the SET protocol, the usefulness of this approach to correct weaknesses and problems discovered during the analysis.http://dx.doi.org/10.1155/2012/254942 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hanane Houmani Mohamed Mejri |
spellingShingle |
Hanane Houmani Mohamed Mejri Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method Journal of Computer Networks and Communications |
author_facet |
Hanane Houmani Mohamed Mejri |
author_sort |
Hanane Houmani |
title |
Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method |
title_short |
Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method |
title_full |
Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method |
title_fullStr |
Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method |
title_full_unstemmed |
Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method |
title_sort |
formal analysis of set and nsl protocols using the interpretation functions-based method |
publisher |
Hindawi Limited |
series |
Journal of Computer Networks and Communications |
issn |
2090-7141 2090-715X |
publishDate |
2012-01-01 |
description |
Most applications in the Internet such as e-banking and e-commerce use the SET and the NSL protocols to protect the communication channel between the client and the server. Then, it is crucial to ensure that these protocols respect some security properties such as confidentiality, authentication, and integrity. In this paper, we analyze the SET and the NSL protocols with respect to the confidentiality (secrecy) property. To perform this analysis, we use the interpretation functions-based method. The main idea behind the interpretation functions-based technique is to give sufficient conditions that allow to guarantee that a cryptographic protocol respects the secrecy property. The flexibility of the proposed conditions allows the verification of daily-life protocols such as SET and NSL. Also, this method could be used under different assumptions such as a variety of intruder abilities including algebraic properties of cryptographic primitives. The NSL protocol, for instance, is analyzed with and without the homomorphism property. We show also, using the SET protocol, the usefulness of this approach to correct weaknesses and problems discovered during the analysis. |
url |
http://dx.doi.org/10.1155/2012/254942 |
work_keys_str_mv |
AT hananehoumani formalanalysisofsetandnslprotocolsusingtheinterpretationfunctionsbasedmethod AT mohamedmejri formalanalysisofsetandnslprotocolsusingtheinterpretationfunctionsbasedmethod |
_version_ |
1725399194782400512 |