5 citations found. Retrieving documents...
G. Smith. A new type system for secure information ow. In 14th IEEE Computer Security Foundations Workshop, 2001.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A Type System for Robust Declassification - Zdancewic (2003)   (7 citations)  (Correct)

....the program. Whether such a generalization would be useful in practice, and how to precisely characterize the con dentiality properties of the resulting programs remains for future work. 12 5 Related work There has been much recent work in security typed languages, ranging from simple calculi [25,7,1,21,24,30,23,8] to full featured languages [10,31,16,2] For a recent survey of this work, see Sabelfeld and Myers paper [20] The simplest and most standard approach to declassi cation is to restrict its uses to those performed by a trusted subject, similar to the DLM requirement that a function possess the ....

Geo rey Smith. A new type system for secure information ow. In Proc. of the 14th IEEE Computer Security Foundations Workshop, pages 115-125. IEEE Computer Society Press, June 2001.


Proof Linking: Progress Report and Research Proposal - Fong (2002)   (Correct)

....classi cation source to high classi cation destination. Denning [18, 16, 17] rst applied this idea to the control of information ow in high level programming languages through 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 system on a prototypical high level imperative programming language, so that programmers may decorate a variable by a discrete sensitivity level. They have proven a form of ....

Geo rey Smith. A new type system for secure information ow. In Proceedings of the 14th IEEE Computer Security Foundations, pages 115-125, Cape Breton, Nova Scotia, June 2001. 34


Static Confidentiality Enforcement for Distributed Programs - Sabelfeld, Mantel (2002)   (7 citations)  (Correct)

....inputs do not interfere with low observable behavior of the system (low outputs, timing, etc. Originating from early work of Denning [15, 17] and Cohen [13, 14] a large body of work has followed the noninterference based approach to con dentiality for various programming languages including [2, 22, 47, 49, 29, 6, 44, 45, 43, 12, 32, 46]. We follow this line of work in our de nition of security for a language enriched with message passing. Information ow in distributed languages. As computing systems become increasingly connected, multi threaded and distributed programming languages become increasingly important [8] ....

....we aim to construct a compositional security property for a message passing enabled language. Timing sensitive security. Multi threadedness (assuming a shared memory and execution on a single processor) has been a major focus of research in the context of noninterference based con dentiality [22, 47, 49, 44, 43, 12, 32, 46]. Common to these studies is the observation that if a program s timing behavior depends on high data, then the scheduler may re ect this dependence on the values of low variables. Suppose h and l are high and low variables, i.e. variables that initially store high and low data, respectively. ....

[Article contains additional citation context not shown here]

G. Smith. A new type system for secure information ow. In Proc. of IEEE Computer Security Foundations Workshop, pages 115-125, June 2001.


Noninterference for Concurrent Programs and Thread Systems - Boudol, Castellani (2001)   (10 citations)  (Correct)

....instance, with our notion of type it is very easy to deal with the standard wait=signal primitives used for synchronisation and cooperative scheduling. By the time we started revising this paper, and thanks also to one of the anonymous referees, we became aware of an independent paper by G. Smith [17] which was about to appear (indeed, within a similar time frame as our extended abstract [4] As it turns out, Smith s paper proposes a type system which is identical to ours, with the additional possibility of recording the running time of programs when this is known statically, thus ....

G. Smith. A new type system for secure information ow. In 14th IEEE Computer Security Foundations Workshop, 2001.


Noninterference for Concurrent Programs and Thread Systems - Boudol, Castellani (2001)   (10 citations)  (Correct)

No context found.

G. Smith. A new type system for secure information ow. In 14th IEEE Computer Security Foundations Workshop, 2001.

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