François Pottier  Home/Search
Context Related
| pauillac.inria.fr/...csfw15long.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pauillac.inria.fr/~fpot...pottier (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One way of enforcing a mandatory access control policy is to use a static type system capable of guaranteeing a non-interference property. Non-interference requires that two processes with distinct "high"-level components, but common "low"-level structure, cannot be distinguished by "low"-level observers. We state this property in terms of a rather strict notion of process equivalence, namely weak barbed reduction congruence. (Update)
Context of citations to this paper: More
...systems are able to enforce noninterference with about the same precision as the other type systems for concurrent languages. Pottier [93] presents a syntactic technique that extends the calculus to a calculus of pairs of processes. Noninterference is reduced to a safety...
...information flow. The closest existing work on information flow in concurrent systems with a trusted execution platform [45, 52, 39, 6, 24, 19, 33] has produced restrictive analyses that rule out many practical programs. We expect that dealing with mutual distrust would...
Cited by: More
Type-Based Distributed Access Control (Extended Abstract) - Chothia, Duggan, Vitek (2003) (Correct)
Language-Based Information-Flow Security - Sabelfeld, Myers (2003) (Correct)
Using Replication and Partitioning to Build Secure.. - Zheng, Chong, Myers, .. (2003) (Correct)
Similar documents (at the sentence level):
40.4%: A Simple View of Type-Secure Information Flow in the π-Calculus - Pottier (2002) (Correct)
Active bibliography (related documents): More All
0.3: Type-Based Information Flow Analysis for the Pi-Calculus - Kobayashi (2003) (Correct)
0.2: Confining Data and Processes in Global Computing Applications - De Nicola, Gorla, Pugliese (2004) (Correct)
0.2: Observational Determinism for Concurrent Program Security - Zdancewic, Myers (2003) (Correct)
Similar documents based on text: More All
0.3: Secure Information Flow in a Multi-threaded Imperative Language - Smith, Volpano (1998) (Correct)
0.3: Constraint-Based Type Inference for Guarded Algebraic Data Types - Simonet, Pottier (2003) (Correct)
0.3: Confinement Properties for Multi-Threaded Programs - Smith (1999) (Correct)
Related documents from co-citation: More All
6: Information flow inference for ML - Pottier, Simonet - 2002
6: Probabilistic noninterference in a concurrent language - Volpano, Smith - 1998
5: Certification of programs for secure information flow (context) - Denning, Denning - 1977
BibTeX entry: (Update)
F. Pottier, "A simple view of type-secure information flow in the picalculus, June 2002, pp. 320--330. http://citeseer.ist.psu.edu/article/pottier02simple.html More
@misc{ pottier02simple,
author = "F. Pottier",
title = "A simple view of type-secure information flow in the picalculus",
text = "F. Pottier, A simple view of type-secure information flow in the picalculus,
June 2002, pp. 320--330.",
year = "2002",
url = "citeseer.ist.psu.edu/article/pottier02simple.html" }
Citations (may not include all citations):265 Secure computer systems: Unified exposition and Multics inte.. (context) - Bell, LaPadula - 1975
244 Cryptography and Data Security (context) - Denning - 1982
197 Barbed bisimulation - Milner, Sangiorgi - 1992
146 Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1993
139 Secure information flow in a multi-threaded imperative langu.. - Smith, Volpano - 1998
137 Laboratory for Foundations of Computer Science (context) - Milner, -calculus et al. - 1991
121 A core calculus of dependency - Abadi, Banerjee et al. - 1999
66 Graph types for monadic mobile processes - Yoshida - 1996
49 Secure information flow as typed process behaviour - Honda, Vasconcelos et al.
47 Information flow inference for ML - Pottier, Simonet - 2002
43 A classification of security properties for process algebras - Focardi, Gorrieri - 1995
39 A uniform type structure for secure information flow - Honda, Yoshida - 2002
38 Analysis and caching of dependencies - Abadi, Lampson et al.
37 resource access in the asynchronous pi-calculus (context) - Hennessy, Riely et al. - 2000
34 Information flow inference for free - Pottier, Conchon - 2000
30 Static analysis of processes for no read-up and no write-dow.. - Bodei, Degano et al. - 1999
29 A new type system for secure information flow - Smith - 2001
29 Secure composition of untrusted code: Wrappers and causality.. - Sewell, Vitek - 2000
26 Secure information flow and CPS - Zdancewic, Myers
20 ACM Transactions on Programming Languages and Systems (context) - Kobayashi, Pierce et al.
13 Linearity and bisimulation - Yoshida, Honda et al.
12 Non-interference for concurrent programs and thread systems - Boudol, Castellani - 2001
4 The security picalculus and noninterference - Hennessy
2 Technical Report MSC (context) - Yoshida, Honda et al.
2 Trust in the pi-calculus (context) - Hepburn, Wright - 2001
2 Type reconstruction for linear -calculus with I/O subtyping (context) - Igarashi, Kobayashi - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pauillac.inria.fr/~fpottier/biblio/pottier.html): More
Information Flow Inference For Free - Pottier, Conchon (2000) (Correct)
A 3-Part Type Inference Engine - Pottier (2000) (Correct)
An Implementation Of Caml-Light With Existential Types - Mauny, Pottier (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC