DMCA
Soft Constraints for Security Protocol Analysis: Confidentiality (2001)
| Citations: | 22 - 12 self |
BibTeX
@MISC{Bella01softconstraints,
author = {Giampaolo Bella and Stefano Bistarelli},
title = {Soft Constraints for Security Protocol Analysis: Confidentiality},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We model any network configuration arising from the execution of a security protocol as a soft constraint satisfaction problem (SCSP). We formalise the protocol goal of confidentiality as a property of the solution for an SCSP, hence confidentiality always holds with a certain security level. The policy SCSP models the network configuration where all admissible protocol sessions have terminated successfully, and an imputable SCSP models a given network configuration. Comparing the solutions of these two problems elicits whether the given configuration hides a confidentiality attack. We can also compare attacks and decide which is the most significant. The approach is demonstrated on the asymmetric Needham-Schroeder protocol.
Keyphrases
security protocol analysis network configuration soft constraint protocol goal certain security level hence confidentiality security protocol policy scsp model admissible protocol session imputable scsp model confidentiality attack asymmetric needham-schroeder protocol soft constraint satisfaction problem
