A uniform type structure for secure information flow

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 81-92

  Honda, Kohei ^a   Yoshida, Nobuko ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS; DATA STRUCTURES; MATHEMATICAL MODELS; SECURITY OF DATA;

DEPENDENCY CORE CALCULUS; SECURE INFORMATION FLOW;

PROGRAMMING THEORY;

EID: 0036040303     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503281     Document Type: Conference Paper

References (42)

1. Secrecy in programming-language semantics
2. A core calculus of dependency
3. Full abstraction for PCF, 1994
4. Fully abstract game semantics for general references
5. Transforming out timing leaks
6. Sequentiality and the π-calculus
7. Asynchrony and the pi-calculus
8. Noninterference for concurrent programs
9. Certification of programs for secure information flow
10. Non-interference for the analysis of cryptographic protocols
11. Linear logic
12. The SLam calculus: Programming with secrecy and integrity
13. Information flow vs resource access in the asynchronous pi-calculus
14. Types for dyadic interaction
15. Composing processes
16. Language primitives and type discipline for structured communication-based programming
17. An object calculus for asynchronous communication
18. Secure information flow as typed process behaviour
19. On reduction-based process semantics
20. Game-theoretic analysis of call-by-value computation
21. Inductive, coinductive, and pointed types
22. "On full abstraction for PCF": I, II and III
23. Linear types and π-calculus
24. Functions as processes
25. A calculus of mobile processes
26. Trust in the λ-calculus
27. Information flow inference for free
28. Typing and subtyping for mobile processes
29. Process algebra and non-interference
30. π-calculus, internal mobility, and agent-passing calculi
31. A per model of secure information flow in sequential programs
32. A new type system for secure information flow
33. Secure information flow in a multi-threaded imperative language
34. Type inference for polymorphic references
35. Typed concurrent objects
36. Graph types for mobile processes
37. Strong normalisation in the π-calculus
38. Linearity and bisimulation
39. Secure information flow and CPS