• DocumentCode
    2499214
  • Title

    Separate Enciphering of Correlated Messages for Confidentiality in Distributed Networks

  • Author

    Luh, W. ; Kundur, D.

  • Author_Institution
    Texas A&M Univ., College Station
  • fYear
    2007
  • fDate
    26-30 Nov. 2007
  • Firstpage
    1637
  • Lastpage
    1641
  • Abstract
    This paper studies distributed joint secrecy and compression suitable for sensor networks. A capacity region that characterizes the tradeoff between compression and secrecy is derived. We demonstrate for the two-node case that under the restriction of separate enciphering (i.e., no inter-node collaboration) unconditional secrecy by both parties cannot be achieved simultaneously. A fundamental design rule for lightweight encoder implementation critical for secrecy based on distributed source coding using syndromes and Reed-Solomon codes is presented highlighting practical feasibility.
  • Keywords
    Reed-Solomon codes; correlation methods; cryptography; data compression; matrix algebra; parity check codes; source coding; telecommunication security; wireless sensor networks; Reed-Solomon codes; correlated messages; distributed joint secrecy-compression; distributed network confidentiality; distributed source coding; lightweight encoder implementation; parity check matrices; sensor networks; separate enciphering; syndromes; Circuits; Collaboration; Costs; Cryptography; Data security; Protection; Reed-Solomon codes; Sensor phenomena and characterization; Source coding; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
  • Conference_Location
    Washington, DC
  • Print_ISBN
    978-1-4244-1042-2
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2007.315
  • Filename
    4411225