Flow-based Encrypted Traffic Analysis

Add to your list(s) Download to your calendar using vCal

• Daniel Poliakov, Brno University of Technology
• Thursday 28 November 2024, 15:00-16:00
• Computer Lab, FW11.

If you have a question about this talk, please contact Richard Mortier.

Network traffic classification is essential for ensuring Quality of Service, enforcing policies, or identifying malware, botnets, and their corresponding command-and-control servers. However, the growing complexity of encrypted traffic, due to the prevalence of TLS , QUIC, and DNS over HTTPS , presents significant challenges to traditional traffic analysis techniques. This talk will discuss advancements in machine learning for processing encrypted network data at the flow level in high-speed computer networks, outlining methods that leverage statistical information from metadata such as packet lengths and inter-arrival times. The talk will cover different statistical data representations on input, modelling architectures, and open problems in flow embedding extraction, contrastive learning, and model transfer.

Bio: Daniel Poliakov is a Ph.D. student at Brno University of Technology with current research interests in data modelling, neural networks, and representation learning for applications in network traffic monitoring and security. Prior to starting his Ph.D., he focused on automated malware analysis, network security research, and threat intelligence.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• CL's SRG seminar
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Computer Lab, FW11
• Computer Laboratory Systems Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.