• DocumentCode
    2381863
  • Title

    Detecting covert channels within VoIP

  • Author

    Zhao, Hong ; Ansari, Nirwan

  • Author_Institution
    Fairleigh Dickinson Univ., Teaneck, NJ, USA
  • fYear
    2012
  • fDate
    21-22 May 2012
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    VoIP (Voice Over IP) was ranked third among the top 11 technologies of the decade in 2011. It is one of the most popular networking services. As it is readily adopted, the VoIP traffic is increasing steadily. The large amount of data transported by VoIP makes it ideal for creating covert channels. Attacks based on covert channels becomes a new challenge for network security. In this paper, possible covert channels via VoIP are analyzed, and an effective countermeasure to detect hidden messages in both SEQ (Sequence Number) and SSRC (Source Identifier) fields in the RTP protocol during conversation phase is proposed. This proposed method creates a new processing space, in which, normal traffic is analyzed and characterized by a proposed statistical model. This model is used in detecting hidden information in SSRCs and SEQs. Simulation results show that 100% detection rate can be realized. As the proposed model requires only a small amount of training data and no illegal traffic is used in the training, the computational complexity is small and can be used for on-line covert channel detection.
  • Keywords
    Internet telephony; computational complexity; protocols; telecommunication channels; telecommunication security; telecommunication traffic; RTP protocol; SEQ; SSRC; VoIP traffic; Voice over IP; computational complexity; conversation phase; covert channels detection; hidden messages detection; network security; networking services; sequence number; source identifier; Feature extraction; IP networks; Logic gates; Mixers; Protocols; Servers; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sarnoff Symposium (SARNOFF), 2012 35th IEEE
  • Conference_Location
    Newark, NJ
  • Print_ISBN
    978-1-4673-1465-7
  • Type

    conf

  • DOI
    10.1109/SARNOF.2012.6222709
  • Filename
    6222709