File Detection on Network Traffic Using Approximate Matching

  • Breitinger F
  • Baggili I
N/ACitations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

In recent years, Internet technologies changed enormously and allow faster Internet connections, higher data rates and mobile usage. Hence, it is possible to send huge amounts of data / files easily which is often used by insiders or attackers to steal intellectual property. As a consequence, data leakage prevention systems (DLPS) have been developed which analyze network traffic and alert in case of a data leak. Although the overall concepts of the detection techniques are known, the systems are mostly closed and commercial. Within this paper we present a new technique for network traffic analysis based on approximate matching (a.k.a fuzzy hashing) which is very common in digital forensics to correlate similar files. This paper demonstrates how to optimize and apply them on single network packets. Our contri-bution is a straightforward concept which does not need a comprehensive configuration: hash the file and store the digest in the database. Within our experiments we obtained false positive rates between 10 −4 and 10 −5 and an algorithm throughput of over 650 Mbit/s.

Cite

CITATION STYLE

APA

Breitinger, F., & Baggili, I. (2014). File Detection on Network Traffic Using Approximate Matching. Journal of Digital Forensics, Security and Law. https://doi.org/10.15394/jdfsl.2014.1168

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free