Qr code
中文
姚羽

Professor
Supervisor of Doctorate Candidates
Supervisor of Master's Candidates


Gender:Male
Alma Mater:东北大学
Education Level:With Certificate of Graduation for Doctorate Study
School/Department:计算机科学与工程学院
College: 计算机科学与工程学院
Administrative Position:复杂网络系统安全保障技术教育部工程研究中心主任
Discipline:Computer Applications Technology
Computer Software and Theory
Computer Architecture
Contact Information:

Academic Honor

2013   Excellent talents of the Ministry of education in the new century

Click:Times

Open Time: ..

The Last Update Time: ..

Current position: Home >> Scientific Research >> Paper Publications
Recovering Process Variables from Industrial Network Traffic via Search-Based Optimization.

Hits:

Journal:CCS 2026, (CCF A类会议)

Summary:Process variables (PVs) provide the process evidence needed for process-aware security monitoring in industrial cyber-physical systems (CPSs). However, existing supervisory infrastructures expose only the subset of PV values recorded by historians, leaving many additional runtime PV values unobserved. To address this incomplete process visibility, we study the problem of recovering PV fields and their semantics directly from raw industrial network traffic through protocol reverse engineering (PRE). In this setting, existing PRE methods face two practical challenges: PV-carrying communication is mixed with heterogeneous runtime traffic, and PV-carrying payloads are often long and deployment-specific. Mixed runtime traffic obscures the PV-carrying communication paths, while long payloads create a vast segmentation space in which early segmentation errors can propagate and corrupt the recovery of later fields under sequential inference. In this paper, we formulate the recovery of PV fields from raw network traffic as a search-based optimization problem. Our key insight is that non-sequentially identifying correct segmentations in such a vast segmentation space can be cast as an optimization problem and addressed by searching for near-optimal solutions. We propose PVParser to approach this goal. PVParser first reduces the search space by identifying the PV-carrying payloads from network traffic via a periodic pattern detection mechanism. It then employs a modified Monte Carlo Tree Search to explore near-optimal segmentations, reducing error propagation from incorrect early boundary decisions. Experiments on three representative industrial CPS datasets demonstrate that PVParser achieves high accuracy and F1-score in PV-carrying payload localization and PV field inference, outperforming six state-of-the-art PRE approaches by a significant margin.

Note:https://arxiv.org/abs/2608.16403

Discipline:Engineering

First-Level Discipline:Computer Science and Technology

Translation or Not:No