Cited by 112Internet Traffic Analysis and Secure E-votingNetwork Security and Intrusion DetectionNetwork Traffic and Congestion Control

Revealing skype traffic: when randomness plays with you

Bonfiglio, Dario, Mellia, Marco, Meo, Michela, Rossi, Dario, Tofanelli, Paolo·2007·ACM SIGCOMM Computer Communication Review

Abstract

Skype is a very popular VoIP software which has recently attracted the attention of the research community and network operators. Following a closed source and proprietary design, Skype protocols and algorithms are unknown. Moreover, strong encryption mechanisms are adopted by Skype, making it very difficult to even glimpse its presence from a traffic aggregate. In this paper, we propose a framework based on two complementary techniques to reveal Skypetraffic in real time. The first approach, based on Pearson'sChi-Square test and agnostic to VoIP-related trafficcharacteristics, is used to detect Skype's fingerprint from the packet framing structure, exploiting the randomness introduced at the bit level by the encryption process. Conversely, the second approach is based on a stochastic characterization of Skype traffic in terms of packet arrival rate and packet length, which are used as features of a decision process based on Naive Bayesian Classifiers.In order to assess the effectiveness of the above techniques, we develop an off-line cross-checking heuristic based on deep-packet inspection and flow correlation, which is interesting per se. This heuristic allows us to quantify the amount of false negatives and false positives gathered by means of the two proposed approaches: results obtained from measurements in different networks show that the technique is very effective in identifying Skype traffic. While both Bayesian classifier and packet inspection techniques are commonly used, the idea of leveraging on randomness to reveal traffic is novel. We adopt this to identify Skype traffic, but the same methodology can be applied to other classification problems as well.

Integrity signals

Registry

Crossref · 10.1145/1282427.1282386

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

1 of the 11 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Bonfiglio, D., Mellia, M., Meo, M., Rossi, D., & Tofanelli, P.
Affiliations
  • Politecnico di Torino (IT)
  • Télécom Paris (FR)
  • Motorola (Italy) (IT)
Venue
ACM SIGCOMM Computer Communication Review
Published
2007-08-27
Volume
37
Issue
4
Pages
37-48
ISSN
0146-4833 (ISSN-L)
OpenAlex
W3160447194
Cited by
112
References
11
Citations by year
2026: 1 · 2024: 2 · 2022: 8 · 2021: 6 · 2020: 4 · 2019: 3 · 2018: 7 · 2017: 7 · 2016: 10 · 2015: 7 · 2014: 11 · 2013: 11 · 2012: 6
FWCI
7.89
Type
journal article
Language
en
Open access
closed
Locations
  • ACM SIGCOMM Computer Communication Review (publishedVersion)
  • PORTO@Iris (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
Keywords
Pearson chi-square test, packet arrival rate, packet size, naive Bayesian classifier, deep packet inspection, flow correlation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review