{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/15966"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/15966","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Achievable rates for queue-based timing stegocodes","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Ezzeddine, Ibtissam M."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Moulin, Pierre"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-05-18T18:52:56Z","date_published":"2010-05-18T18:52:56Z","updated_at":"2026-07-22T22:25:08Z","subjects":["stegocodes","timing channel","steganography","mutual information","shannon's mappings"],"languages":["en"],"rights":["Copyright 2010 Ibtissam M. Ezzeddine"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/15966","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Moulin, Pierre"]},{"key":"dc:creator","label":"Author","values":["Ezzeddine, Ibtissam M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-05-18T18:52:56Z","2012-05-19T10:00:11Z","2010-5"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["stegocodes","timing channel","steganography","mutual information","shannon's mappings"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Ibtissam M. Ezzeddine"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/15966"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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","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"]},{"key":"dc:title","label":"Title","values":["Achievable rates for queue-based timing stegocodes"]}]}],"canonical_facts":{"dc:contributor":["Moulin, Pierre"],"dc:creator":["Ezzeddine, Ibtissam M."],"dc:date":["2010-05-18T18:52:56Z","2012-05-19T10:00:11Z","2010-5"],"dc:description":["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","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"],"dc:identifier":["http://hdl.handle.net/2142/15966"],"dc:language":["en"],"dc:rights":["Copyright 2010 Ibtissam M. Ezzeddine"],"dc:subject":["stegocodes","timing channel","steganography","mutual information","shannon's mappings"],"dc:title":["Achievable rates for queue-based timing stegocodes"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:08Z"}