Networking with secrecy constraints

Parvathinathan Venkitasubramaniam, Ting He, Lang Tong

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

3 Citations (Scopus)

Abstract

Wireless Networks are susceptible to anonymous monitoring of transmissions by adversaries who can infer valuable infonnation about data flows in the network. It is therefore necessary to design network protocols that maintain secrecy of routes from eavesdroppers. In this work, we present a mathematical formulation of route secrecy when eavesdroppers observe transmission epochs of nodes. We consider networks where the nodes use receiver directed signaling schemes and each node has a strict delay constraint for relaying packets. We propose a scheduling technique to provide complete secrecy of routes, and based on that, characterize achievable rate regions for two-hop data routes under the given constraints. Furthermore, we extend the results when an additional constraint on packet loss is imposed.

Original languageEnglish (US)
Title of host publicationMilitary Communications Conference 2006, MILCOM 2006
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)1424406188, 9781424406180
DOIs
StatePublished - Jan 1 2006
EventMilitary Communications Conference 2006, MILCOM 2006 - Washington, D.C., United States
Duration: Oct 23 2006Oct 25 2006

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM

Other

OtherMilitary Communications Conference 2006, MILCOM 2006
CountryUnited States
CityWashington, D.C.
Period10/23/0610/25/06

Fingerprint

Packet loss
Wireless networks
Scheduling
Network protocols
Monitoring

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Venkitasubramaniam, P., He, T., & Tong, L. (2006). Networking with secrecy constraints. In Military Communications Conference 2006, MILCOM 2006 [4086613] (Proceedings - IEEE Military Communications Conference MILCOM). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MILCOM.2006.302351
Venkitasubramaniam, Parvathinathan ; He, Ting ; Tong, Lang. / Networking with secrecy constraints. Military Communications Conference 2006, MILCOM 2006. Institute of Electrical and Electronics Engineers Inc., 2006. (Proceedings - IEEE Military Communications Conference MILCOM).
@inproceedings{810ee89db3ea40dfa9e25796e1525266,
title = "Networking with secrecy constraints",
abstract = "Wireless Networks are susceptible to anonymous monitoring of transmissions by adversaries who can infer valuable infonnation about data flows in the network. It is therefore necessary to design network protocols that maintain secrecy of routes from eavesdroppers. In this work, we present a mathematical formulation of route secrecy when eavesdroppers observe transmission epochs of nodes. We consider networks where the nodes use receiver directed signaling schemes and each node has a strict delay constraint for relaying packets. We propose a scheduling technique to provide complete secrecy of routes, and based on that, characterize achievable rate regions for two-hop data routes under the given constraints. Furthermore, we extend the results when an additional constraint on packet loss is imposed.",
author = "Parvathinathan Venkitasubramaniam and Ting He and Lang Tong",
year = "2006",
month = "1",
day = "1",
doi = "10.1109/MILCOM.2006.302351",
language = "English (US)",
isbn = "1424406188",
series = "Proceedings - IEEE Military Communications Conference MILCOM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "Military Communications Conference 2006, MILCOM 2006",
address = "United States",

}

Venkitasubramaniam, P, He, T & Tong, L 2006, Networking with secrecy constraints. in Military Communications Conference 2006, MILCOM 2006., 4086613, Proceedings - IEEE Military Communications Conference MILCOM, Institute of Electrical and Electronics Engineers Inc., Military Communications Conference 2006, MILCOM 2006, Washington, D.C., United States, 10/23/06. https://doi.org/10.1109/MILCOM.2006.302351

Networking with secrecy constraints. / Venkitasubramaniam, Parvathinathan; He, Ting; Tong, Lang.

Military Communications Conference 2006, MILCOM 2006. Institute of Electrical and Electronics Engineers Inc., 2006. 4086613 (Proceedings - IEEE Military Communications Conference MILCOM).

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

TY - GEN

T1 - Networking with secrecy constraints

AU - Venkitasubramaniam, Parvathinathan

AU - He, Ting

AU - Tong, Lang

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Wireless Networks are susceptible to anonymous monitoring of transmissions by adversaries who can infer valuable infonnation about data flows in the network. It is therefore necessary to design network protocols that maintain secrecy of routes from eavesdroppers. In this work, we present a mathematical formulation of route secrecy when eavesdroppers observe transmission epochs of nodes. We consider networks where the nodes use receiver directed signaling schemes and each node has a strict delay constraint for relaying packets. We propose a scheduling technique to provide complete secrecy of routes, and based on that, characterize achievable rate regions for two-hop data routes under the given constraints. Furthermore, we extend the results when an additional constraint on packet loss is imposed.

AB - Wireless Networks are susceptible to anonymous monitoring of transmissions by adversaries who can infer valuable infonnation about data flows in the network. It is therefore necessary to design network protocols that maintain secrecy of routes from eavesdroppers. In this work, we present a mathematical formulation of route secrecy when eavesdroppers observe transmission epochs of nodes. We consider networks where the nodes use receiver directed signaling schemes and each node has a strict delay constraint for relaying packets. We propose a scheduling technique to provide complete secrecy of routes, and based on that, characterize achievable rate regions for two-hop data routes under the given constraints. Furthermore, we extend the results when an additional constraint on packet loss is imposed.

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

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

U2 - 10.1109/MILCOM.2006.302351

DO - 10.1109/MILCOM.2006.302351

M3 - Conference contribution

AN - SCOPUS:35148832503

SN - 1424406188

SN - 9781424406180

T3 - Proceedings - IEEE Military Communications Conference MILCOM

BT - Military Communications Conference 2006, MILCOM 2006

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Venkitasubramaniam P, He T, Tong L. Networking with secrecy constraints. In Military Communications Conference 2006, MILCOM 2006. Institute of Electrical and Electronics Engineers Inc. 2006. 4086613. (Proceedings - IEEE Military Communications Conference MILCOM). https://doi.org/10.1109/MILCOM.2006.302351