Achievable rates for queue-based timing stegocodes

Ibtissam Ezzeddine, Pierre Moulin

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

Abstract

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
Pages379-383
Number of pages5
DOIs
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

Other

Other2009 IEEE Information Theory Workshop, ITW 2009
CountryItaly
CityTaormina, Sicily
Period10/11/0910/16/09

Fingerprint

Transmitters
Statistics
Communication

ASJC Scopus subject areas

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

Cite this

Ezzeddine, I., & Moulin, P. (2009). Achievable rates for queue-based timing stegocodes. In 2009 IEEE Information Theory Workshop, ITW 2009 (pp. 379-383). [5351197] (2009 IEEE Information Theory Workshop, ITW 2009). https://doi.org/10.1109/ITW.2009.5351197

Achievable rates for queue-based timing stegocodes. / Ezzeddine, Ibtissam; Moulin, Pierre.

2009 IEEE Information Theory Workshop, ITW 2009. 2009. p. 379-383 5351197 (2009 IEEE Information Theory Workshop, ITW 2009).

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

Ezzeddine, I & Moulin, P 2009, Achievable rates for queue-based timing stegocodes. in 2009 IEEE Information Theory Workshop, ITW 2009., 5351197, 2009 IEEE Information Theory Workshop, ITW 2009, pp. 379-383, 2009 IEEE Information Theory Workshop, ITW 2009, Taormina, Sicily, Italy, 10/11/09. https://doi.org/10.1109/ITW.2009.5351197
Ezzeddine I, Moulin P. Achievable rates for queue-based timing stegocodes. In 2009 IEEE Information Theory Workshop, ITW 2009. 2009. p. 379-383. 5351197. (2009 IEEE Information Theory Workshop, ITW 2009). https://doi.org/10.1109/ITW.2009.5351197
Ezzeddine, Ibtissam ; Moulin, Pierre. / Achievable rates for queue-based timing stegocodes. 2009 IEEE Information Theory Workshop, ITW 2009. 2009. pp. 379-383 (2009 IEEE Information Theory Workshop, ITW 2009).
@inproceedings{88f8fe41df664d8a958593dfa295ea98,
title = "Achievable rates for queue-based timing stegocodes",
abstract = "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.",
author = "Ibtissam Ezzeddine and Pierre Moulin",
year = "2009",
month = "12",
day = "7",
doi = "10.1109/ITW.2009.5351197",
language = "English (US)",
isbn = "9781424449835",
series = "2009 IEEE Information Theory Workshop, ITW 2009",
pages = "379--383",
booktitle = "2009 IEEE Information Theory Workshop, ITW 2009",

}

TY - GEN

T1 - Achievable rates for queue-based timing stegocodes

AU - Ezzeddine, Ibtissam

AU - Moulin, Pierre

PY - 2009/12/7

Y1 - 2009/12/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=76249091318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=76249091318&partnerID=8YFLogxK

U2 - 10.1109/ITW.2009.5351197

DO - 10.1109/ITW.2009.5351197

M3 - Conference contribution

AN - SCOPUS:76249091318

SN - 9781424449835

T3 - 2009 IEEE Information Theory Workshop, ITW 2009

SP - 379

EP - 383

BT - 2009 IEEE Information Theory Workshop, ITW 2009

ER -