Achievable rates for queue-based timing stegocodes

Ibtissam Ezzeddine, Pierre Moulin

Research output: Chapter in Book/Report/Conference proceedingConference contribution


This paper 1 studies stegocodes 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 encoding 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.

Original languageEnglish (US)
Title of host publication2009 IEEE Information Theory Workshop, ITW 2009
Number of pages5
StatePublished - Dec 7 2009
Event2009 IEEE Information Theory Workshop, ITW 2009 - Taormina, Sicily, Italy
Duration: Oct 11 2009Oct 16 2009

Publication series

Name2009 IEEE Information Theory Workshop, ITW 2009


Other2009 IEEE Information Theory Workshop, ITW 2009
CityTaormina, Sicily

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Information Systems
  • Electrical and Electronic Engineering


Dive into the research topics of 'Achievable rates for queue-based timing stegocodes'. Together they form a unique fingerprint.

Cite this