A probabilistic approach to information hiding

Authors:
Annabelle McIver;Carroll Morgan
Affiliations:
The Department of Computing, Macquarie University, Sydney, 2109, Australia;Department of Computer Science and Engineering, The University of New South Wales, Sydney, 2052, Australia
Venue:
Programming methodology
Year:
2003

Citing 6
Cited 7

A CSP formulation of non-interference and unwinding

Cipher: IEEE Computer Society Technical Committee Newsletter on Security & Privacy
Probabilistic predicate transformers

ACM Transactions on Programming Languages and Systems (TOPLAS)
A semantic approach to secure information flow

Science of Computer Programming - Special issue on mathematics of program construction
Cryptography and data security

Cryptography and data security
A Discipline of Programming

A Discipline of Programming
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency

A static analysis for quantifying information flow in a simple imperative language

Journal of Computer Security
An Interval-based Abstraction for Quantifying Information Flow

Electronic Notes in Theoretical Computer Science (ENTCS)
Quantifying information flow with beliefs

Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Data Refinement with Probability in Mind

Electronic Notes in Theoretical Computer Science (ENTCS)
Quantified Interference for a While Language

Electronic Notes in Theoretical Computer Science (ENTCS)
Information theory and security: quantitative information flow

SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Statistical measurement of information leakage

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Security in a computer system must at some level be regarded as the control of information flow. Here we approach the issue 'from first principles', linking information flow in the sense of Shannon to a sequential programming model enriched with probabilities. From that we extract criteria for secure encapsulation of data, and we discuss the interaction of our criteria with refinement.