Networking with Secrecy Constraints
Parvathinathan Venkitasubramaniam, Ting He, Lang Tong

Citation
Parvathinathan Venkitasubramaniam, Ting He, Lang Tong. "Networking with Secrecy Constraints". IEEE MILCOM 2006, Washington D.C, October, 2006.

Abstract
Wireless Networks are susceptible to anonymous monitoring of transmissions by adversaries who can infer valuable information 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.

Electronic downloads

• VenkHeTong06MILCOM.pdf · application/pdf · 151 kbytes

Citation formats

• HTML

  Parvathinathan Venkitasubramaniam, Ting He, Lang Tong. <a
  href="http://www.truststc.org/pubs/159.html"
  >Networking with Secrecy Constraints</a>, IEEE
  MILCOM 2006, Washington D.C, October, 2006.

• Plain text

  Parvathinathan Venkitasubramaniam, Ting He, Lang Tong.
  "Networking with Secrecy Constraints". IEEE MILCOM
  2006, Washington D.C, October, 2006.

• BibTeX

  @inproceedings{VenkitasubramaniamHeTong06_NetworkingWithSecrecyConstraints,
      author = {Parvathinathan Venkitasubramaniam and Ting He and
                Lang Tong},
      title = {Networking with Secrecy Constraints},
      booktitle = {IEEE MILCOM 2006, Washington D.C},
      month = {October},
      year = {2006},
      abstract = {Wireless Networks are susceptible to anonymous
                monitoring of transmissions by adversaries who can
                infer valuable information 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. },
      URL = {http://www.truststc.org/pubs/159.html}
  }
  

Posted by Lang Tong on 8 Feb 2007.
For additional information, see the Publications FAQ or contact webmaster at www truststc org..