Sciweavers

136
Voted
CSFW
1997
IEEE
15 years 7 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith
178
Voted
CSFW
1997
IEEE
15 years 7 months ago
Verifying authentication protocols with CSP
This paper presents a general approach for analysis and veri cation of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by ...
Steve Schneider
125
Voted
CSFW
1997
IEEE
15 years 7 months ago
Unreliable Intrusion Detection in Distributed Computations
Dahlia Malkhi, Michael K. Reiter
98
Voted
CSFW
1997
IEEE
15 years 7 months ago
Mechanized proofs for a recursive authentication protocol
Lawrence C. Paulson
104
Voted
CSFW
1997
IEEE
15 years 7 months ago
Proving Properties of Security Protocols by Induction
Lawrence C. Paulson
122
Voted
CSFW
1997
IEEE
15 years 7 months ago
Strategies against Replay Attacks
Abstract— Replay attacks on security protocols have been discussed for quite some time in the literature. However, the efforts to address these attacks have been largely incomple...
Tuomas Aura