Volume- 4
Issue- 2
Year- 2016
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Dr.Abdulameer Khalaf Hussain
This paper presents a design of a secure covert channel . The proposed system generates a special covert channel used in sensitive applications. In order to enhance the covert of information, the participants in the communication channel must agree upon secure information and split it into two parts. From each part, the system generates a set of pseudo random numbers. Then the authenticated users select one of these numbers to be meaningful message. The system depends on the traditional prisoner's problem. The proposed system is tested against the traditional methods and it is implemented more effective in terms of hiding information from the observation of any active warden.
[1] B. Lampson, “A note on the confinement problem”, Commun. ACM, vol. 16, no. 10, Oct. 1973, pp. 613–15.
[2] M. A. Padlipsky, D. W. Snow, and P. A. Karger, “Limitations of end-to end encryption in secure computer networks”, Tech. Rep. ESD-TR-78-158, Mitre Corporation, August 1978.
[3] C. G. Girling, “Covert channels in LAN’s”, IEEE Trans. Software Engineering, vol. SE-13, no. 2, Feb. 1987, pp. 292–96.
[4] Q. YAO and P. ZHANG, “Coverting channel based on packet length”, vol.34 No.3 Computer Engineering, February 2008.
[5] B. Lampson, “A Note on the Confinement Problem,” Commun.ACM, vol. 16, no. 10, Oct. 1973, pp. 613–15.
[6] M. A. Padlipsky, D. W. Snow, and P. A. Karger, “Limitations of End-to-End Encryption in Secure Computer Networks,” Tech.Rep. ESD-TR-78-158, Mitre Corporation, August 1978.
[7] J. Postel, “Internet Protocol,” RFC 0791, IETF, Sept. 1981. http://www.ietf.org/rfc/rfc0791.txt.
[8] D. V. Forte et al., “SecSyslog: An Approach to Secure Logging Based on Covert Channels,” Proc. First Int’l. Wksp. Systematic Approaches to Digital Forensic Engineering, Nov. 2005, pp. 248– 63.
[9] The Honeynet Project, “Know Your Enemy: Sebek — A Kernel Based Data Capture Tool,” tech. rep., 2003, http://www.honeynet.org/papers/sebek.pdf.
[10] G. J. Simmons, “The Prisoners’ Problem and the Subliminal Channel,” Proc. Advances in Cryptology (CRYPTO), 1983, pp. 51– 67.
[11] S. Craver, “On Public-Key Steganography in the Presence of an Active Warden,” Proc. 2nd Int’l. Wksp. Information Hiding, Apr. 1998, pp. 355–68.
[12] Department of Defense. Trusted Computer System Evaluation Criteria, 1985.
[13] N. Proctor and P. Neumann. Architectural Implications of Covert Channels. SRI International, 1992.
[14] M. Owens. A Discussion of Covert Channels and Steganography.” SANS Institute, 2002.
[15] K. Reiland. Steganography and Covert Channels. PACISE conference. Bloomsburg, PA, 2005.
[16] G. Kessler. Steganography: Hiding Data Within Data. 2001.
[17] S. Qingni , W.Mian ,Z. Zhuangzhuang , Z. Zhi , Q. Sihan and W. Zhonghai ," A Covert Channel Using Event Channel State on Xen Hypervisor" , Proceeding of ICICS 2013 15th International Conference on Information and Communications Security - Volume 8233 , Pages 125-134 , 2013.
[18] K. Hassan , J. Mobin , A. Syed , and M. Fauzan ," Designing a cluster-based covert channel to evade disk investigation and forensics" , Computers & Security , Volume 30, Issue 1, January 2011, Pages 35–49.
[19] L. Song , "A covert channel in MAC protocols based on splitting algorithms" , Wireless Communications and Networking Conference, 2005 IEEE (Volume:2 ).
[20] W. Zhenghong , and R. Lee, , "Mutual Anonymous Communications: A New Covert Channel Based on Splitting Tree MAC" , INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE , 2007.
Associate Professor , Computer Department, Jerash/ College/ Faculty of Information Technology, Jerash, Jordan,Mobile No 00962796799969.,
No. of Downloads: 8 | No. of Views: 1150
Manali Shukla, Ishika Goyal, Bhavya Gupta, Jhanvi Sharma.
July 2024 - Vol 12, Issue 4
Dipti Prajapati, Samishtarani Sabat, Sanika Bhilare, Rashmi Vishe, Prof. Suman Bhujbal.
March 2024 - Vol 12, Issue 2
Anu Sharma, Vivek Kumar.
May 2023 - Vol 11, Issue 3
