Quantifying information flow

被引：73

作者：

Lowe, G ^{[1
]}

机构：

[1] Univ Oxford, Comp Lab, Oxford OX1 3QD, England

来源：

15TH IEEE COMPUTER SECURITY FOUNDATION WORKSHOP, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/CSFW.2002.1021804

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We extend definitions of information flow so as to quantify the amount of information passed; in other words, we give a formal definition of the capacity of covert channels. Our definition uses the process algebra CSP, and is based upon counting the number of different behaviours of a high level user that can be distinguished by a low level user.

引用

页码：18 / 31

页数：14

共 19 条

[1] ALLEN PG, 1991, P 4 IEEE COMP SEC FD
[2] TESTING EQUIVALENCES FOR PROCESSES
DENICOLA, R
HENNESSY, MCB
[J]. THEORETICAL COMPUTER SCIENCE, 1984, 34 (1-2) : 83 - 133
[3] Information flow analysis in a discrete-time process algebra
Focardi, R
Gorrieri, R
Martinelli, F
[J]. 13TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 2000, : 170 - 184
[4] Comparing two information flow security properties
Focardi, R
[J]. 9TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 1996, : 116 - 122
[5] Focardi R., 2002, P WORKSH ISS THEOR S
[6] Focardi Riccardo, 1995, J COMPUTER SECURITY
[7] FOSTER R, 1999, THESIS OXFORD U
[8] GRAY JW, 1991, P 1991 IEEE COMP SOC
[9] MCCULLOGH D, 1988, P COMP SEC FDN WORKS, P1
[10] MILLEN JK, 1987, P 1987 IEEE COMP SOC

← 1 2 →