Sciweavers

CSFW
2006
IEEE
13 years 10 months ago
A Temporal Logic Characterisation of Observational Determinism
Marieke Huisman, Pratik Worah, Kim Sunesen
CSFW
2006
IEEE
13 years 10 months ago
Verified Interoperable Implementations of Security Protocols
Karthikeyan Bhargavan, Cédric Fournet, Andr...
CSFW
2006
IEEE
13 years 10 months ago
Types and Effects for Secure Service Orchestration
A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security co...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
CSFW
2006
IEEE
14 years 13 days ago
On the Completeness of Attack Mutation Algorithms
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...
Shai Rubin, Somesh Jha, Barton P. Miller
CSFW
2006
IEEE
14 years 13 days ago
Information-Flow Security for Interactive Programs
Abstract. Interactive programs allow users to engage in input and output throughout execution. The ubiquity of such programs motivates the development of models for reasoning about...
Kevin R. O'Neill, Michael R. Clarkson, Stephen Cho...
CSFW
2006
IEEE
14 years 13 days ago
Privacy APIs: Access Control Techniques to Analyze and Verify Legal Privacy Policies
There is a growing interest in establishing rules to regulate the privacy of citizens in the treatment of sensitive personal data such as medical and financial records. Such rule...
Michael J. May, Carl A. Gunter, Insup Lee
CSFW
2006
IEEE
14 years 13 days ago
Encoding Information Flow in Haskell
This paper presents an embedded security sublanguage for enforcing information-flow policies in the standard Haskell programming language. The sublanguage provides useful informa...
Peng Li, Steve Zdancewic
CSFW
2006
IEEE
14 years 13 days ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
CSFW
2006
IEEE
14 years 13 days ago
Noninterference in the Presence of Non-Opaque Pointers
A common theoretical assumption in the study of information flow security in Java-like languages is that pointers are opaque – i.e., that the only properties that can be observ...
Daniel Hedin, David Sands