(Enter summary)
Abstract: This paper proposes a notion of weak probabilistic bisimulation for Markov
chains and shows how it can be used to justify the correctness of a recentlypublished
type system for secure information flow. The type system guarantees
that well-typed multi-threaded programs running under a uniform probabilistic
scheduler satisfy the probabilistic noninterference property. (Update)
Context of citations to this paper: More
...static analysis. Subsequent developments have been constantly reported [50] among which the work of Volpano and Smith [68, 64, 63, 55, 65, 56, 66, 67, 62, 53, 54] has recently attracted considerable attention from the mobile code community. They de ned an augmenting type...
Cited by: More
Proof Linking: A Modular Verification Architecture for Mobile Code .. - Fong (2004)
(Correct)
A Unifying Approach to the Security of Distributed and.. - Mantel, Sabelfeld (2002)
(Correct)
Proof Linking: Progress Report and Research Proposal - Fong (2002)
(Correct)
Similar documents (at the sentence level):
24.3%: Probabilistic Noninterference through Weak Probabilistic.. - Smith (2003)
(Correct)
Active bibliography (related documents): More All
0.3: Language-Based Information-Flow Security - Sabelfeld, Myers (2003)
(Correct)
0.1: On the Extension of Non-interference with Probabilities - Aldini (2002)
(Correct)
0.1: Two Formal Approaches for Approximating.. - Aldini, Bravetti.. (2004)
(Correct)
Similar documents based on text: More All
0.9: Secure Information Flow in a Multi-threaded Imperative Language - Smith, Volpano (1998)
(Correct)
0.8: Confinement Properties for Multi-Threaded Programs - Smith (1999)
(Correct)
0.6: Probabilistic Noninterference in a Concurrent Language - Volpano, Smith (1998)
(Correct)
Related documents from co-citation: More All
3: Security policies and security models (context) - Goguen, Meseguer - 1982
2: Cryptography and data security (context) - Denning - 1983
2: A parameterized type system for race-free Java programs (context) - Boyapati, Rinard - 2001
BibTeX entry: (Update)
Georey Smith. Weak probabilistic bisimulation for secure information ow. In Proceedings of the Workshop on Issues in the Theory of Security (WITS'02), Portland, Oregon, January 2002. http://citeseer.ist.psu.edu/smith01weak.html More
@misc{ rey02weak,
author = "G. rey",
title = "Weak probabilistic bisimulation for secure information ow",
text = "Georey Smith. Weak probabilistic bisimulation for secure information ow.
In Proceedings of the Workshop on Issues in the Theory of Security (WITS'02),
Portland, Oregon, January 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/smith01weak.html" }
Citations (may not include all citations):
276
Finite Markov Chains (context) - Kemeny, Snell - 1960
62
Probabilistic noninterference in a concurrent language
- Volpano, Smith - 1999
59
Probabilistic noninterference for multithreaded programs
- Sabelfeld, Sands - 2000
36
Weak bisimulation for fully probabilistic processes
- Baier, Hermanns - 1997
29
A new type system for secure information flow
- Smith - 2001
22
Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
13
Probabilistic information flow in a process algebra (context) - Aldini - 2001
12
Noninterference for concurrent programs and thread systems
- Boudol, Castellani - 2001
10
Type Based Techniques for Covert Channel Elimination and Reg.. (context) - Agat - 2000
Documents on the same site (http://www.cs.fiu.edu/~smithg/papers/): More
Verifying Secrets and Relative Secrecy - Volpano, Smith (2000)
(Correct)
Language Issues in Mobile Program Security - Volpano, Smith (1998)
(Correct)
Probabilistic Noninterference in a Concurrent Language - Volpano, Smith (1998)
(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