Sciweavers

CSFW
2000
IEEE
13 years 8 months ago
Possibilistic Definitions of Security - An Assembly Kit
We present a framework in which different notions of security can be defined in a uniform and modular way. Each definition of security is formalized as a security predicate by ass...
Heiko Mantel
CSFW
2000
IEEE
13 years 8 months ago
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
James Heather, Steve Schneider
CSFW
2000
IEEE
13 years 8 months ago
Confidentiality for Mobile Code: The Case of a Simple Payment Protocol
We propose an approach to support confidentiality for mobile implementations of security-sensitive protocols using Java/JVM. An applet which receives and passes on confidential in...
Mads Dam, Pablo Giambiagi
CSFW
2000
IEEE
13 years 9 months ago
Secure Composition of Untrusted Code: Wrappers and Causality Types
We consider the problem of assembling concurrent software systems from untrusted or partially trusted o -the-shelf components, using wrapper programs to encapsulate components and...
Peter Sewell, Jan Vitek
CSFW
2000
IEEE
13 years 9 months ago
Reasoning about Secrecy for Active Networks
In this paper we develop a language of mobile agents called uPLAN for describing the capabilities of active (programmable) networks. We use a formal semantics for uPLAN to demonst...
Pankaj Kakkar, Carl A. Gunter, Martín Abadi
CSFW
2000
IEEE
13 years 9 months ago
How to Prevent Type Flaw Attacks on Security Protocols
A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. A number o...
James Heather, Gavin Lowe, Steve Schneider
CSFW
2000
IEEE
13 years 9 months ago
Protocol Independence through Disjoint Encryption
One protocol (called the primary protocol) is independent of other protocols (jointly called the secondary protocol) if the question whether the primary protocol achieves a securi...
Joshua D. Guttman, F. Javier Thayer
CSFW
2000
IEEE
13 years 9 months ago
Information Flow Analysis in a Discrete-Time Process Algebra
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
Riccardo Focardi, Roberto Gorrieri, Fabio Martinel...
CSFW
2000
IEEE
13 years 9 months ago
Local Names in SPKI/SDSI
We analyze the notion of “local names” in SPKI/SDSI. By interpreting local names as distributed groups, we develop a simple logic program for SPKI/SDSI’s linked localname sc...
Ninghui Li
CSFW
2000
IEEE
13 years 9 months ago
C3PO: A Tool for Automatic Sound Cryptographic Protocol Analysis
In this paper we present an improved logic for analysing authentication properties of cryptographic protocols, based on the SVO logic of Syverson and van Oorschot. Such logics are...
Anthony H. Dekker