Probabilistic Noninterference in a Concurrent Language
Loading...
Authors
Volpano, Dennis
Smith, Geoffrey
Subjects
Advisors
Date of Issue
1998-06-00
Date
Publisher
IEEE Computer
Language
Abstract
In (15) we give a type system that guarantees that well typed multi threaded programs are possibilistically noninterfering If thread scheduling is probabilistic , however, then well typed programs may have probabilistic timing channels We describe how they can be eliminated without making the type system more restrictive We show that well typed concurrent programs are probabilistically noninterfering if every total command with a high guard executes atomically The proof uses the concept of a probabilistic state of a computation following the work of Kozen [10]1.
Type
Article
Description
Proceedings of Fourteenth Computer Security Applications Conference
Series/Report No
Department
Computer Science (CS)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Proceedings of the 11th IEEE Computer Security Foundations Workshop, Rockport, MA, pp. 34-43, June 1998
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.