#### DMCA

## Soft constraints for security (2004)

### Cached

### Download Links

- [www.sci.unich.it]
- [www.dmi.unipg.it]
- [www.dmi.unipg.it]
- DBLP

### Other Repositories/Bibliography

Venue: | In First International Workshop on Views On Designing Complex Architectures (VODCA |

Citations: | 2 - 0 self |

### Citations

463 | Partial constraint satisfaction
- Freuder, Wallace
- 1992
(Show Context)
Citation Context ...e solved as a constraint solving problem A further advantage to using a constraint based framework is that it becomes possible to carry out a quantitative analysis of integrity using soft constraints =-=[6,7,8,2,18,19,11,14,17]-=-. A quantitative analysis provides a fine-grained measure of how secure a system is, rather than the simple coarsegrained false/true provided by the conventional ‘crisp’ constraints. A cryptographic p... |

454 |
A comparison of commercial and military computer security policiesi
- Clark, Wilson
- 1987
(Show Context)
Citation Context ...ils about the nature of the reliability of its infrastructure, then S is as dependably safe as R at interface that is described by the set of variables E if and only if S⇓E ⊑ R⇓E Separation of duties =-=[20, 10]-=- is a common implementation technique for achieving integrity. While fault-tolerant techniques replicate an operation, separation of duties can be thought of as a partitioning of the operation across ... |

327 | Valued constraint satisfaction problems: Hard and easy problems
- Schiex, Fargier, et al.
- 1995
(Show Context)
Citation Context ...e solved as a constraint solving problem A further advantage to using a constraint based framework is that it becomes possible to carry out a quantitative analysis of integrity using soft constraints =-=[6,7,8,2,18,19,11,14,17]-=-. A quantitative analysis provides a fine-grained measure of how secure a system is, rather than the simple coarsegrained false/true provided by the conventional ‘crisp’ constraints. A cryptographic p... |

259 | An Attack on the NeedhamSchroeder Public Key Authentication Protocol
- Lowe
- 1995
(Show Context)
Citation Context ...ives Nb inside message 3, he would conclude that A was at the other end of the network because Nb must have been obtained from message 2, and no-one but A could perform this operation. Lowe discovers =-=[16]-=- that the protocol suffers the attack in Figure 6, whereby a malicious principal C masquerades as a principal A with a principal B, after A initiated a session with C. The attack, which sees C interle... |

209 |
Dependability: Basic concepts and terminology
- Laprie, ed
- 1992
(Show Context)
Citation Context ...s, the implementation of the system is not sufficiently robust to be able to deal with internal failures in a safe way and uphold the original probity requirement. △ 7sBella, Bistarelli, and Foley In =-=[15]-=-, integrity is given as one attribute of dependability. Dependability is characterized as a “property of a computer system such that reliance can be justifiably placed on the service it delivers” [15]... |

192 |
Semiring-based constraint solving and optimization
- Bistarelli, Montanari, et al.
- 1997
(Show Context)
Citation Context ...e solved as a constraint solving problem A further advantage to using a constraint based framework is that it becomes possible to carry out a quantitative analysis of integrity using soft constraints =-=[6,7,8,2,18,19,11,14,17]-=-. A quantitative analysis provides a fine-grained measure of how secure a system is, rather than the simple coarsegrained false/true provided by the conventional ‘crisp’ constraints. A cryptographic p... |

114 | Semiringbased CSPs and valued CSPs: frameworks, properties, and comparison, Constraints 4:3
- Bistarelli, Montanari, et al.
- 1999
(Show Context)
Citation Context ... soft constraints are currently available. In the following, we refer to the formalization based on c-semirings [6,7,9,2], which can be shown to generalize and express both crisp and soft constraints =-=[7,3]-=-. 2.1 Semiring-based CSPs A semiring-based constraint assigns to each instantiation of its variables an associated value from a partially ordered set. When dealing with crisp constraints, the values a... |

108 | Constraint Solving over Semirings
- Bistarelli, Montanari, et al.
- 1995
(Show Context)
Citation Context |

99 | Fuzzy constraint satisfaction
- Ruttkay
- 1994
(Show Context)
Citation Context |

87 |
Uncertainty in constraint satisfaction problems: a probabilistic approac h
- Fargier, Lang
- 1993
(Show Context)
Citation Context |

87 | Possibilistic constraint satisfaction problems or ‘How to handle soft constraints
- Schiex
- 1992
(Show Context)
Citation Context |

58 | True Concurrency in Concurrent Constraint Programming
- Montanari, Rossi
- 1991
(Show Context)
Citation Context |

18 | Soft constraint programming to analysing security protocols, Theory and Practice of Logic Programming
- Bella, Bistarelli
(Show Context)
Citation Context ...n SCSP where the chosen c-semiring is: SCSP = 〈{false,true}, ∨, ∧,false,true〉. Many other “soft” CSPs (Probabilistic, weighted, . . . ) can be modeled by using a suitable semiring structure (Sprob = 〈=-=[0, 1]-=-,max, ×, 0, 1〉, Sweight = 〈R,min, +, +∞, 0〉, . . . ). c1 〈a〉 → 0.9 〈b〉 → 0.1 〈c〉 → 0.9 〈a, a〉 → 0.8 〈a, b〉 → 0.2 〈a, c〉 → 0.2 〈b, a〉 → 0 X Y 〈b, b〉 → 0 〈b, c〉 → 0.1 〈c, a〉 → 0.8 〈c, b〉 → 0.2 〈c, c〉 → ... |

14 |
2003): A Non-Functional Approach to System Integrity
- Foley
(Show Context)
Citation Context ...m the results of [4,5], we describe how constraint solving can be used to model and analyze the effectiveness of application system integrity policies. In the following we show by using examples from =-=[12,13]-=-, how functional requirements can be expressed as requirements in terms of constraints on variables that are invariant over the lifetime of the system. Supplier shipnote payment V ship Enterprise veri... |

10 | Semirings for Soft Constraint Solving and - Bistarelli - 2004 |

10 | Analysis of integrity policies using soft constraints
- Bistarelli, Foley
- 2003
(Show Context)
Citation Context ...cy may have been incorrectly specified and, as a result, a user may be authorized to modify information that can lead to an unexpected system compromise. In this section, inspired from the results of =-=[4,5]-=-, we describe how constraint solving can be used to model and analyze the effectiveness of application system integrity policies. In the following we show by using examples from [12,13], how functiona... |

8 | Evaluating system integrity
- Foley
- 1998
(Show Context)
Citation Context ...m the results of [4,5], we describe how constraint solving can be used to model and analyze the effectiveness of application system integrity policies. In the following we show by using examples from =-=[12,13]-=-, how functional requirements can be expressed as requirements in terms of constraints on variables that are invariant over the lifetime of the system. Supplier shipnote payment V ship Enterprise veri... |

5 |
A Constraint Based Framework for Dependability Goals: Integrity
- Bistarelli, Foley
- 2003
(Show Context)
Citation Context ...cy may have been incorrectly specified and, as a result, a user may be authorized to modify information that can lead to an unexpected system compromise. In this section, inspired from the results of =-=[4,5]-=-, we describe how constraint solving can be used to model and analyze the effectiveness of application system integrity policies. In the following we show by using examples from [12,13], how functiona... |

3 |
General Accounting Office, Accounting and
- States
- 1996
(Show Context)
Citation Context ...ils about the nature of the reliability of its infrastructure, then S is as dependably safe as R at interface that is described by the set of variables E if and only if S⇓E ⊑ R⇓E Separation of duties =-=[20, 10]-=- is a common implementation technique for achieving integrity. While fault-tolerant techniques replicate an operation, separation of duties can be thought of as a partitioning of the operation across ... |