Sciweavers

CSFW
1998
IEEE
13 years 8 months ago
Probabilistic Noninterference in a Concurrent Language
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
Dennis M. Volpano, Geoffrey Smith
CSFW
1998
IEEE
13 years 8 months ago
Two Facets of Authentication
Martín Abadi
CSFW
1998
IEEE
13 years 8 months ago
Data Level Inference Detection in Database Systems
Existing work on inference detection for database systems mainly employ functional dependencies in the database schema to detect inferences. It has been noticed that analyzing the...
Raymond W. Yip, Karl N. Levitt
CSFW
1998
IEEE
13 years 8 months ago
Honest Ideals on Strand Spaces
In security protocol analysis, it is important to learn general principles that limit the abilities of an attacker, and that can be applied repeatedly to a variety of protocols. W...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
CSFW
1998
IEEE
13 years 8 months ago
Formal Analysis of a Non-Repudiation Protocol
This paper applies the theory of Communicating Sequential Processes (CSP) to the modelling and analysis of a non-repudiation protocol. Non-repudiation protocols di er from authent...
Steve Schneider
CSFW
1998
IEEE
13 years 8 months ago
Proving Security Protocols with Model Checkers by Data Independence Techniques
Model checkers such as FDR have been extremely e ective in checking for, and nding, attacks on cryptographic protocols { see, for example 11, 12, 14] and many of the papers in 3]....
A. W. Roscoe