Capacity estimation of non-synchronous covert channels

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2005, Pages

  Wang, Zhenghong ^a   Lee, Ruby B ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY;

CAPACITY ESTIMATION; CHANNEL ANALYSIS; CHANNEL'S CAPACITY; COVERT CHANNELS; ESTIMATION METHODS; GENERAL BASE; INFORMATION RATES; RELIABLE COMMUNICATION; SYNCHRONOUS CHANNELS; SYNCHRONOUS MODELS;

SYNCHRONIZATION;

EID: 85116487865     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2005.47     Document Type: Conference Paper

References (20)

1. R.A. Kemmerer, "Shared Resource Matrix Methodology: An Approach to Identifying storage and Timing Channels," ACM Transactions on Computer Systems, vol. 1, issue 3, pp. 256-277, August 1983.
2. B.W. Lampson, "A Note on the Confinement Problem," Communications ofthe ACM, vol. 16, issue 10, pp. 613-615, October 1973.
3. National Computer Security Center, "A Guide to Understanding Covert Channel Analysis of Trusted Systems," NCSC-TG-30, November 1993, available at http://www.radium.ncsc.mil/tpep/library/rainbow/.
4. John McHugh, "Covert Channel Analysis: A Chapter of the Handbook for the Computer Security Certification of Trusted Systems," December 1995, available at http://chacs.nrl.navy.mil/publications/handbook/.
5. J.K. Millen, "Covert Channel Capacity," Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 60-66, April 1987.
6. S.B. Lipner, "A Comment on the Confinement Problem," Operating Systems Review, vol. 9, issue 5, pp. 192-196, November 1975.
7. M. Schaefer, B. Gold, R. Linde, and J. Scheid, "Program Confinement in KVM/370," Proceedings of the 1977 Annual ACM Conference, pp. 404-410, October 1977.
8. J.C. Huskamp, "Covert Communication Channels in Timesharing Systems," Technical Report UCB-CS-78-02, Ph.D. Thesis, University of California, Berkeley, CA, 1978.
9. D.E. Denning, "Cryptography and Data Security," Addison-Wesley, Reading, Massachusetts, 1983.
10. I.S. Moskowitz and A.R. Miller, "Simple Timing Channels," Proceedings of IEEE Computer Symposium on Research in Security and Privacy, pp. 56-64, May 1994.
11. I.S. Moskowitz, S.J. Greenwald, and M.H. Kang, "An Analysis of the Timed-Z Channel," Proceedings of IEEE Computer Symposium on Security and Privacy, pp. 2-11, May 1996.
12. K.Sh. Zigangirov, "Sequential Decoding for A Binary Channel with Drop Outs and Insertions," Problemy Peredachi Informatsii, vol. 5, issue 2, pp. 22-30, 1969.
13. M.C. Davey and D.J.C. Mackey, "Reliable Communication over Channels with Insertions, Deletions, and Substitutions," IEEE Trans, on Information Theory, vol. 47, no.2, pp. 687-698, February 2001.
14. Dave Leigh, "Capacity of Insertion and Deletion Channels," Project Report, 2001, available at http://www.inference.phv.cam.ac.uk/is/papers/
15. J.K. Millen, "Finite-State Noiseless Covert Channels," Proceedings of the Computer Security Foundations Workshop II, pp. 81-86, June 1989.
16. T. Cover and J. Thomas, "Elements of Information Theory," John Wiley & Sons Inc., New York, 1991.
17. R.L. Doburshin, "Shannon's Theorems for Channels with Synchronization Errors," Problemy Peredachi Informatsii, vol.3, No.4, pp.18-36, 1967
18. N.D. Vvedenskaya and R.L. Doburshin, "The Computation on a Computer of The Channel Capacity of a Line with Symbol Drop-out," Problemy Peredachi Informatsii, vol.4, No.3, pp.92-95, 1968.
19. A.S. Dolgopolov, "Capacity Bounds for a Channel with Synchronization Errors," Problemy Peredachi Informatsii, vol.26, No.2, pp.27-37, 1990.
20. J. Luo, A. Ephremides, "On the Throughput, Capacity and Stability Regions of Random Multiple Access", submitted to IEEE Trans, on Information Theory, February 2005.