Sciweavers

CSFW
2007
IEEE
14 years 4 months ago
Secure information flow and program logics
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
Lennart Beringer, Martin Hofmann
CSFW
2007
IEEE
14 years 4 months ago
A Type Discipline for Authorization in Distributed Systems
We consider the problem of statically verifying the conformance of the code of a system to an explicit authorization policy. In a distributed setting, some part of the system may ...
Cédric Fournet, Andy Gordon, Sergio Maffeis
CSFW
2007
IEEE
14 years 4 months ago
Automaton-based Confidentiality Monitoring of Concurrent Programs
Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noni...
Gurvan Le Guernic
CSFW
2007
IEEE
14 years 6 months ago
LTL Model Checking for Security Protocols
Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their applicability...
Alessandro Armando, Roberto Carbone, Luca Compagna
CSFW
2007
IEEE
14 years 6 months ago
Collaborative Planning With Privacy
Collaboration among organizations or individuals is common. While these participants are often unwilling to share all their information with each other, some information sharing i...
Max I. Kanovich, Paul Rowe, Andre Scedrov
CSFW
2007
IEEE
14 years 6 months ago
Probability of Error in Information-Hiding Protocols
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
CSFW
2007
IEEE
14 years 6 months ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
CSFW
2007
IEEE
14 years 6 months ago
Reasoning about Concurrency for Security Tunnels
There has been excellent progress on languages for rigorously describing key exchange protocols and techniques for proving that the network security tunnels they establish preserv...
Alwyn Goodloe, Carl A. Gunter
CSFW
2007
IEEE
14 years 6 months ago
Creating Vulnerability Signatures Using Weakest Preconditions
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
David Brumley, Hao Wang, Somesh Jha, Dawn Xiaodong...
CSFW
2007
IEEE
14 years 6 months ago
Secure Implementations for Typed Session Abstractions
mplementations for Typed Session Abstractions Ricardo Corin1,2,3 Pierre-Malo Deni´elou1,2 C´edric Fournet1,2 Karthikeyan Bhargavan1,2 James Leifer1 1 MSR-INRIA Joint Centre 2 Mic...
Ricardo Corin, Pierre-Malo Deniélou, C&eacu...