2026-09-19T06:29:46Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/15966 2023-07-10 col_2142_8888 col_2142_5131 com_2142_8887 com_2142_234 com_2142_5130

Moulin, Pierre Ezzeddine, Ibtissam M. 2010-05-18T18:52:56Z 2010-05-18T18:52:56Z 2012-05-19T10:00:11Z 2010-05-18T18:52:56Z This work studies stegocodes (data-hiding codes) for covert communication over timing channels. In a timing channel, the information resides in the packet interdeparture times as opposed to the packets themselves. The en- coding procedure should preserve the statistics of the packet interarrival process. Our steganographic codes are based on two novel ideas, namely, queue- based codes and Shannon's encoding functions for channels with causal side information at the transmitter. The embedding of information bits is done by a Geo/Geo/1 queue servicing the interarrival times. Shannon's theory of coding with causal side information at the transmitter is then used to study the queue-based stegocodes and their information-theoretic limits. Evaluating these limits for the Geo/Geo/1 queue is a formidable computational problem. An efficient computational approach is proposed to compute the maximum achievable rate of the queue-based stegocode and the optimal encoding functions. We also design simple practical codes, test them on a communication system while taking network noise into account, and compare their performance to the mappings under study. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-04-25T18:04:03Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Ezzeddine_Ibtissam.pdf: 527497 bytes, checksum: 092845c4d04c8e6208dd274a197553cc (MD5) Made available in DSpace on 2010-05-18T18:52:56Z (GMT). No. of bitstreams: 2 Ezzeddine_Ibtissam.pdf: 527497 bytes, checksum: 092845c4d04c8e6208dd274a197553cc (MD5) license.txt: 4068 bytes, checksum: 7823a594718d9e9bfac09ccc1cbb963e (MD5) Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by William Ingram (wingram2@illinois.edu) on 2010-05-18T18:54:48Z Item is restricted until 2012-05-18T18:54:47Z 2010-5 Item reinstated by Sarah Shreeves (sshreeve@illinois.edu) on 2012-05-19T10:00:11Z Item was in collections: Dissertations and Theses - Electrical and Computer Engineering (ID: 446) University of Illinois Dissertations and Theses (ID: 204) No. of bitstreams: 3 Ezzeddine_Ibtissam.pdf.txt: 78847 bytes, checksum: fcc3aa94c6be2204ab412f7a7a2a2003 (MD5) Ezzeddine_Ibtissam.pdf: 527497 bytes, checksum: 092845c4d04c8e6208dd274a197553cc (MD5) license.txt: 4068 bytes, checksum: 7823a594718d9e9bfac09ccc1cbb963e (MD5) Item released from any restrictions by Sarah Shreeves (sshreeve@illinois.edu) on 2012-05-19T10:00:11Z http://hdl.handle.net/2142/15966 en Copyright 2010 Ibtissam M. Ezzeddine stegocodes timing channel steganography mutual information shannon's mappings Achievable rates for queue-based timing stegocodes Electrical & Computer Eng 1933 Electrical & Computer Engr 1200 University of Illinois at Urbana-Champaign Thesis M.S. PHD:Electr & Computer Eng-UIUC 10KS1200PHD