Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Prudent Engineering Practice for Cryptographic Protocols
IEEE Transactions on Software Engineering
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Using CSP to Detect Errors in the TMN Protocol
IEEE Transactions on Software Engineering
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Kerberos Version 4: Inductive Analysis of the Secrecy Goals
ESORICS '98 Proceedings of the 5th European Symposium on Research in Computer Security
Formal Verification of Cardholder Registration in SET
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
Over-Constrained Systems
Some new attacks upon security protocols
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Concurrent constraint programming languages
Concurrent constraint programming languages
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Soft Concurrent Constraint Programming
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
Combining dependent annotations for relational algebra
Proceedings of the 15th International Conference on Database Theory
| Hi-index | 0.00 |
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.