Secure bits through queues

We investigate the idea of providing information-theoretic security at the network and data link layers by exploiting the timing information resulting from queuing of packets between a source, an intended receiver, and other users in a network. Specifically, we consider the secure transmission of me...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 37 - 41
Main Authors Dunn, B.P., Bloch, M., Laneman, J.N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
Communication system security
Cryptography
Data security
Information security
Information theory
Intelligent networks
Memoryless systems
Protocols
Stochastic processes
Timing
Online AccessGet full text
ISBN1424445353
9781424445356
DOI10.1109/ITWNIT.2009.5158537

Cover

More Information
Summary:We investigate the idea of providing information-theoretic security at the network and data link layers by exploiting the timing information resulting from queuing of packets between a source, an intended receiver, and other users in a network. Specifically, we consider the secure transmission of messages by encoding them onto the interarrival timing of packets that enter parallel queues. By leveraging recent results on the secrecy capacity of arbitrary wiretap channels, achievable secrecy rates are obtained. We also show that equivalent secrecy rates can be achieved using a deterministic encoding strategy, which provides an example contrasting the fact that for many memoryless channels a stochastic encoder is required to achieve non-zero secrecy rates.
ISBN:1424445353
9781424445356
DOI:10.1109/ITWNIT.2009.5158537