Mutual anonymous communications: A new covert channel based on splitting tree MAC

Wang Zhenghong; Deng Jing; Ruby B. Lee

doi:10.1109/INFCOM.2007.315

Mutual anonymous communications: A new covert channel based on splitting tree MAC

Wang Zhenghong, Deng Jing, Ruby B. Lee

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

15 Scopus citations

Abstract

Known covert channel based on splitting algorithms in Medium Access Control (MAC) protocols requires the receiver's knowledge of the sender's identity. In this paper we present a new covert channel that does not have this restriction. In such a channel, multiple senders may operate independently without knowing each other, and the receiver can learn the transmitted information without knowing the identity of any covert sender a priori. These properties make the channel robust to malfunctioning senders, and more importantly help protect the secrecy of senders' identity which is essential for covert communications. We also analyze the capacity of our proposed covert channel.

Original language	English (US)
Title of host publication	Proceedings - IEEE INFOCOM 2007
Subtitle of host publication	26th IEEE International Conference on Computer Communications
Pages	2531-2535
Number of pages	5
DOIs	https://doi.org/10.1109/INFCOM.2007.315
State	Published - 2007
Event	IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States Duration: May 6 2007 → May 12 2007

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Other

Other	IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
Country/Territory	United States
City	Anchorage, AK
Period	5/6/07 → 5/12/07

All Science Journal Classification (ASJC) codes

General Computer Science
Electrical and Electronic Engineering

Keywords

Covert channels
Medium access control
Security

Access to Document

10.1109/INFCOM.2007.315

Cite this

@inproceedings{f26253fc0e454cc5b4150a3ad24aa9a9,

title = "Mutual anonymous communications: A new covert channel based on splitting tree MAC",

abstract = "Known covert channel based on splitting algorithms in Medium Access Control (MAC) protocols requires the receiver's knowledge of the sender's identity. In this paper we present a new covert channel that does not have this restriction. In such a channel, multiple senders may operate independently without knowing each other, and the receiver can learn the transmitted information without knowing the identity of any covert sender a priori. These properties make the channel robust to malfunctioning senders, and more importantly help protect the secrecy of senders' identity which is essential for covert communications. We also analyze the capacity of our proposed covert channel.",

keywords = "Covert channels, Medium access control, Security",

author = "Wang Zhenghong and Deng Jing and Lee, {Ruby B.}",

year = "2007",

doi = "10.1109/INFCOM.2007.315",

language = "English (US)",

isbn = "1424410479",

series = "Proceedings - IEEE INFOCOM",

pages = "2531--2535",

booktitle = "Proceedings - IEEE INFOCOM 2007",

note = "IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications ; Conference date: 06-05-2007 Through 12-05-2007",

}

Zhenghong, W, Jing, D & Lee, RB 2007, Mutual anonymous communications: A new covert channel based on splitting tree MAC. in Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications., 4215897, Proceedings - IEEE INFOCOM, pp. 2531-2535, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, United States, 5/6/07. https://doi.org/10.1109/INFCOM.2007.315

TY - GEN

T1 - Mutual anonymous communications

T2 - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications

AU - Zhenghong, Wang

AU - Jing, Deng

AU - Lee, Ruby B.

PY - 2007

Y1 - 2007

N2 - Known covert channel based on splitting algorithms in Medium Access Control (MAC) protocols requires the receiver's knowledge of the sender's identity. In this paper we present a new covert channel that does not have this restriction. In such a channel, multiple senders may operate independently without knowing each other, and the receiver can learn the transmitted information without knowing the identity of any covert sender a priori. These properties make the channel robust to malfunctioning senders, and more importantly help protect the secrecy of senders' identity which is essential for covert communications. We also analyze the capacity of our proposed covert channel.

AB - Known covert channel based on splitting algorithms in Medium Access Control (MAC) protocols requires the receiver's knowledge of the sender's identity. In this paper we present a new covert channel that does not have this restriction. In such a channel, multiple senders may operate independently without knowing each other, and the receiver can learn the transmitted information without knowing the identity of any covert sender a priori. These properties make the channel robust to malfunctioning senders, and more importantly help protect the secrecy of senders' identity which is essential for covert communications. We also analyze the capacity of our proposed covert channel.

KW - Covert channels

KW - Medium access control

KW - Security

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

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

U2 - 10.1109/INFCOM.2007.315

DO - 10.1109/INFCOM.2007.315

M3 - Conference contribution

AN - SCOPUS:34548355102

SN - 1424410479

SN - 9781424410477

T3 - Proceedings - IEEE INFOCOM

SP - 2531

EP - 2535

BT - Proceedings - IEEE INFOCOM 2007

Y2 - 6 May 2007 through 12 May 2007

ER -

Mutual anonymous communications: A new covert channel based on splitting tree MAC

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this