Sciweavers

1679 search results - page 29 / 336
» Security Properties and CSP
Sort
View
CONCUR
2005
Springer
14 years 1 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters
ESORICS
2005
Springer
14 years 1 months ago
Enforcing Non-safety Security Policies with Program Monitors
We consider the enforcement powers of program monitors, which intercept security-sensitive actions of a target application at run time and take remedial steps whenever the target a...
Jay Ligatti, Lujo Bauer, David Walker
SP
2008
IEEE
195views Security Privacy» more  SP 2008»
14 years 2 months ago
Automated Formal Analysis of a Protocol for Secure File Sharing on Untrusted Storage
We study formal security properties of a state-of-the-art protocol for secure file sharing on untrusted storage, in the automatic protocol verifier ProVerif. As far as we know, ...
Bruno Blanchet, Avik Chaudhuri
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
EUROCRYPT
2004
Springer
14 years 1 months ago
Black-Box Composition Does Not Imply Adaptive Security
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
Steven Myers