Sciweavers

232 search results - page 26 / 47
» Verifying persistent security properties
Sort
View
CSFW
2006
IEEE
14 years 2 months ago
Cryptographically Sound Theorem Proving
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
Christoph Sprenger, Michael Backes, David A. Basin...
SACMAT
2009
ACM
14 years 3 months ago
Towards formal security analysis of GTRBAC using timed automata
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
Samrat Mondal, Shamik Sural, Vijayalakshmi Atluri
FSTTCS
2003
Springer
14 years 1 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
ASIAN
2009
Springer
269views Algorithms» more  ASIAN 2009»
13 years 6 months ago
Noninterference with Dynamic Security Domains and Policies
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
Robert Grabowski, Lennart Beringer
POPL
2001
ACM
14 years 9 months ago
Secure safe ambients
Secure Safe Ambients (SSA) are a typed variant of Safe Ambients [9], whose type system allows behavioral invariants of ambients to be expressed and verified. The most significant a...
Michele Bugliesi, Giuseppe Castagna