Fast probabilistic simulation, nontermination, and secure information flow

PLAS'07 - Proceedings of the 2007 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security

Volumn , Issue , 2007, Pages 67-72

  Smith, Geoffrey ^a   Alpízar, Rafael ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Probabilistic noninterference; Type systems

Indexed keywords

NONINTERFERENCE PROPERTY; NONTERMINATION; PROBABILISTIC PROGRAMS; SECURE INFORMATION FLOW;

APPROXIMATION ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; MARKOV PROCESSES; PROBABILISTIC LOGICS; PROBABILITY; SECURITY OF DATA;

INFORMATION SYSTEMS;

EID: 36448950520     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1255329.1255341     Document Type: Conference Paper

References (23)

1. T. Amtoft, S. Bandhakavi, and A. Banerjee. A logic for information flow in object-oriented programs. In POPL, 2006. Extended version available as KSU CIS-TR-2005-1.
2. A. Askarov and A. Sabelfeld. Gradual release: Unifying declassification, encryption and key release policies. In 2007 IEEE Symposium on Security and Privacy. To appear.
3. A. Banerjee, R. Giacobazzi, and I. Mastroeni. What you lose is what you leak: Information leakage in declassification policies. In MFPS, 2007.
4. A. Banerjee and D. A. Naumann. Stack-based access control for secure information flow. Journal of Functional Programming, 15(2):131-177, 2005. Special issue on Language Based Security.
5. G. Barthe, P. R. D'Argenio, and T. Rezk. Secure information flow by self-composition. In CSFW, 2004.
6. N. Benton. Simple relational correctness proofs for static analyses and program transformations. In POPL, 2004.
7. N. Broberg and D. Sands. Flow locks. In ESOP, 2006.
8. S. Chong and A. C. Myers. Security policies for downgrading. In CCS, 2004.
9. E. S. Cohen. Information transmission in sequential programs. In A. K. J. Richard A. DeMillo, David P. Dobkin and R. J. Lipton, editors, Foundations of Secure Computation, pages 297-335. Academic Press, 1978.
10. A. Darvas, R. Hähnle, and D. Sands. A theorem proving approach to analysis of secure information flow. In SPC, 2005.
11. D. E. Denning. Cryptography and Data Security. Addison-Wesley, 1982.
12. B. Hicks, D. King, P. McDaniel, and M. Hicks. Trusted declassification: high-level policy for a security-typed language. In PLAS, 2006.
13. H. Mantel and D. Sands. Controlled declassification based on intransitive noninterference. In APLAS, 2004.
14. C. Morgan. The shadow knows: Refinement of ignorance in sequential programs. In Mathematics of Program Construction, volume 4014 of LNCS, 2006.
15. A. C. Myers. JFlow: Practical mostly-static information flow control. In POPL, 1999.
16. D. A. Naumann. From coupling relations to mated invariants for secure information flow and data abstraction. In ESORICS, 2006.
17. M. Pistoia, A. Banerjee, and D. A. Naumann. Beyond stack inspection: A unified access-control and information-flow security model. In 2007 IEEE Symposium on Security and Privacy. To appear.
18. J. C. Reynolds. The Craft of Programming. Prentice-Hall, 1981.
19. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, Jan. 2003.
20. A. Sabelfeld and A. C. Myers. A model for delimited information release. In ISSS, 2004.
21. A. Sabelfeld and D. Sands. Dimensions and principles of declassification. In CSFW, 2005. Full version to appear in Journal of Computer Security, 2007.
22. T. Terauchi and A. Aiken. Secure information flow as a safety problem. In SAS, 2005.
23. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996.