Files in this item

FilesDescriptionFormat

application/pdf

application/pdfEzzeddine_Ibtissam.pdf (527kB)
(no description provided)PDF

Description

Title:Achievable rates for queue-based timing stegocodes
Author(s):Ezzeddine, Ibtissam M.
Advisor(s):Moulin, Pierre
Department / Program:Electrical & Computer Eng
Discipline:Electrical & Computer Engr
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):stegocodes
timing channel
steganography
mutual information
shannon's mappings
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.
Issue Date:2010-05-18
URI:http://hdl.handle.net/2142/15966
Rights Information:Copyright 2010 Ibtissam M. Ezzeddine
Date Available in IDEALS:2010-05-18
2012-05-19
Date Deposited:May 2010


This item appears in the following Collection(s)

Item Statistics