Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Yongzheng Zhang is active.

Publication


Featured researches published by Yongzheng Zhang.


international conference on network protocols | 2012

A semantics aware approach to automated reverse engineering unknown protocols

Yipeng Wang; Xiaochun Yun; M. Zubair Shafiq; Liyan Wang; Alex X. Liu; Zhibin Zhang; Danfeng Yao; Yongzheng Zhang; Li Guo

Extracting the protocol message format specifications of unknown applications from network traces is important for a variety of applications such as application protocol parsing, vulnerability discovery, and system integration. In this paper, we propose ProDecoder, a network trace based protocol message format inference system that exploits the semantics of protocol messages without the executable code of application protocols. ProDecoder is based on the key insight that the n-grams of protocol traces exhibit highly skewed frequency distribution that can be leveraged for accurate protocol message format inference. In ProDecoder, we first discover the latent relationship among n-grams by first grouping protocol messages with the same semantics and then inferring message formats by keyword based clustering and cluster sequence alignment. We implemented and evaluated ProDecoder to infer message format specifications of SMB (a binary protocol) and SMTP (a textual protocol). Our experimental results show that ProDecoder accurately parses and infers SMB protocol with 100% precision and recall. For SMTP, ProDecoder achieves approximately 95% precision and recall.


international conference on machine learning and cybernetics | 2004

A risk assessment approach for network information system

Yongzheng Zhang; Binxing Fang; Xiaochun Yun

Currently, risk assessment has been an effective technology of protecting network information system. In order to achieve more accurate result, a new assessment approach is presented in this paper. Our approach introduces the idea of network node correlation (NNC), and based on NNC, we give the conception and characteristic of risk propagation. Also, we design a quantitative taxonomy of network node, and describe the assessment process. Compared with other works, our approach more truly reflects the existence of the correlative risk.


web age information management | 2008

A Survey of Alert Fusion Techniques for Security Incident

Tianning Zang; Xiaochun Yun; Yongzheng Zhang

Security incident have been imposing tremendous threats on todaypsilas network information system. To protect this information system from the increasing threat of intrusion, various kinds of detection systems and sensors for security incident have been developed. The main disadvantages of current systems and sensors are a high false detection rate and the lack of post-incident decision support capability. To minimize these drawbacks, various alert fusion technologies have been proposed in the recent years. This paper presents a general summary of these technologies. Basic models and key technologies of alert fusion are analyzed and discussed. Moreover, important aggregation and correlation algorithms are discussed. Finally, we make concluding remarks by predicting the development tendencies of alert correlation technologies.


IEEE ACM Transactions on Networking | 2016

A semantics-aware approach to the automated network protocol identification

Xiaochun Yun; Yipeng Wang; Yongzheng Zhang; Yu Zhou

Traffic classification, a mapping of traffic to network applications, is important for a variety of networking and security issues, such as network measurement, network monitoring, as well as the detection of malware activities. In this paper, we propose Securitas, a network trace-based protocol identification system, which exploits the semantic information in protocol message formats. Securitas requires no prior knowledge of protocol specifications. Deeming a protocol as a language between two processes, our approach is based upon the new insight that the n-grams of protocol traces, just like those of natural languages, exhibit highly skewed frequency-rank distribution that can be leveraged in the context of protocol identification. In Securitas, we first extract the statistical protocol message formats by clustering n-grams with the same semantics, and then use the corresponding statistical formats to classify raw network traces. Our tool involves the following key features: 1) applicable to both connection oriented protocols and connection less protocols; 2) suitable for both text and binary protocols; 3) no need to assemble IP packets into TCP or UDP flows; and 4) effective for both long-live flows and short-live flows. We implement Securitas and conduct extensive evaluations on real-world network traces containing both textual and binary protocols. Our experimental results on BitTorrent, CIFS/SMB, DNS, FTP, PPLIVE, SIP, and SMTP traces show that Securitas has the ability to accurately identify the network traces of the target application protocol with an average recall of about 97.4% and an average precision of about 98.4%. Our experimental results prove Securitas is a robust system, and meanwhile displaying a competitive performance in practice.


trust security and privacy in computing and communications | 2011

CNSSA: A Comprehensive Network Security Situation Awareness System

Rongrong Xi; Shuyuan Jin; Xiaochun Yun; Yongzheng Zhang

With tremendous attacks in the Internet, there is a high demand for network analysts to know about the situations of network security effectively. Traditional network security tools lack the capability of analyzing and assessing network security situations comprehensively. In this paper, we introduce a novel network situation awareness tool - CNSSA (Comprehensive Network Security Situation Awareness) - to perceive network security situations comprehensively. Based on the fusion of network information, CNSSA makes a quantitative assessment on the situations of network security. It visualizes the situations of network security in its multiple and various views, so that network analysts can know about the situations of network security easily and comprehensively. The case studies demonstrate how CNSSA can be deployed into a real network and how CNSSA can effectively comprehend the situation changes of network security in real time.


networking architecture and storages | 2012

A General Framework of Trojan Communication Detection Based on Network Traces

Shicong Li; Xiaochun Yun; Yongzheng Zhang; Jun Xiao; Yipeng Wang

Because of the widespread Trojan, Internet users become more and more vulnerable to the threat of information leakage. Traditional techniques of Trojan detection were classified into two main categories: host-based and network-based. Unfortunately, existing techniques are insufficient and limited, because of the following reasons: (1)only uncover the known Trojan while inefficiently detecting novel samples, (2) should be adjusted in a timely fashion even a trivial change is applied, and (3)become computationally more expensive. In our work, we focus on a network behavior based method to address the limitations of previous network-based approaches. We analyze the profile of network behavior at two levels: (i)flow-level, (ii)IP-level. Our approach present two main advantages: (1)capture more detailed information to describe the network behavior profile, (2)consume lower computational overhead. We proposed a system, Manto, which detects Trojan communication with high accuracy using clustering technique. We implement Manto on real-world traces. The evaluation results exhibit that Manto is suitable for detecting Trojan communication amongst the vast amount of network traffic, with over 91% accuracy and less than 3.2% false positive ratio. We confidently regard our approach as a complementary way to the existing network-based techniques for we could address their main shortcomings.


Science in China Series F: Information Sciences | 2010

Identifying heavy hitters in high-speed network monitoring

Yu Zhang; Binxing Fang; Yongzheng Zhang

Identifying heavy hitters in a network traffic stream is important for a variety of network applications ranging from traffic engineering to anomaly detection such as detection of denial-of-service attacks. Existing methods generally examine newly arriving items in the stream, perform a small number of operations using a small amount of memory, and still provide guarantees on the identifying accuracy. In high-speed network monitoring, the update speed per item is extremely critical. However, so far as we know, there are no identifying algorithms which can provide constant update time (O(1)) in a weighted data stream. In this paper, we present an algorithm named Weighted Lossy Counting (WLC) which is able to identify heavy hitters in a high-speed weighted data stream with constant update time. WLC employs a novel efficient partially ordered data structure which is able to provide a fast per-item update speed while keeping the memory cost relatively low. We compare WLC with state-of-the-art algorithms for finding heavy hitters in real traffic traces. The experimental results show that WLC performs well in accuracy (recall, precision and average relative error) as other algorithms; moreover it has a much higher update speed at the cost of relatively larger memory space used. A theoretical worst-case memory bound of WLC is also derived in this paper; however, experiments with long real traffic traces show that WLC requires much less space than the theoretical bound in practice.


information security practice and experience | 2005

Computer vulnerability evaluation using fault tree analysis

Tao Zhang; Mingzeng Hu; Xiaochun Yun; Yongzheng Zhang

For analyzing computer system security, the system visitor could be classified into five kinds by his privilege to access system resource, and presented the model base on privilege escalation. The attacker can enhance his privilege by exploiting vulnerability, according to distribution of vulnerabilities privilege set, we could construct fault tree to reflect distinctly potential attack path, and so this method could quantificational express security state at different security policy via analyzing fault tree.


international conference on network protocols | 2015

Rethinking Robust and Accurate Application Protocol Identification: A Nonparametric Approach

Yipeng Wang; Xiaochun Yun; Yongzheng Zhang

Protocol traffic analysis is important for a variety of networking and security infrastructures, such as intrusion detection and prevention systems, network management systems, and protocol specification parsers. In this paper, we propose ProHacker, a nonparametric approach that extracts robust and accurate protocol keywords from network traces and effectively identifies the protocol trace from mixed Internet traffic. ProHacker is based on the key insight that the n-grams of protocol traces have highly predictable statistical nature that can be effectively captured by statistical language models and leveraged for robust and accurate protocol identification. In ProHacker, we first extract protocol keywords using a nonparametric Bayesian statistical model, and then use the corresponding protocol keywords to classify protocol traces by a semi-supervised learning algorithm. We implement and evaluate ProHacker on real-world traces, including SMTP, FTP, PPLive, SopCast, and PPStream, and our experimental results show that ProHacker can accurately identify the protocol trace with an average precision of about 99.42% and an average recall of about 98.64%. We also compare the results of ProHacker to two state-of-the-art approaches ProWord and Securitas using backbone traffic. We show that ProHacker provides significant improvements on precision and recall for online protocol identification.


computer and information technology | 2012

Research of Network Vulnerability Analysis Based on Attack Capability Transfer

Yong Wang; Xiaochun Yun; Yongzheng Zhang; Shuyuan Jin; Yanchen Qiao

Network vulnerability analysis is one of the important techniques to protect network security. Modeling and classification of network vulnerability are introduced firstly, then the concept of attack capability transfer and the algorithm to produce it are presented, which can aggregate vulnerabilities with the same exploitation attributes and satisfying some constrains to simplify the further analysis. Based on the attack capability transfer, a new method constructing attack graph is presented, and the complexity is O(N2) where N is the number of hosts in a network. Through the analysis of attack graph, network vulnerability quantitative analysis is taken and security hardening method based on approximate greedy algorithm is presented, the complexity of which is O(V), where V is the number of vulnerabilities in a network. Experiment shows the effectiveness of the method.

Collaboration


Dive into the Yongzheng Zhang's collaboration.

Top Co-Authors

Avatar

Xiaochun Yun

Chinese Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Yipeng Wang

Chinese Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Binxing Fang

Harbin Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Zhiyu Hao

Chinese Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Tianning Zang

Harbin Engineering University

View shared research outputs
Top Co-Authors

Avatar

Yu Zhou

Chinese Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Weiyao Lin

Shanghai Jiao Tong University

View shared research outputs
Top Co-Authors

Avatar

Li Guo

Chinese Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Shicong Li

Chinese Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Rongrong Xi

Chinese Academy of Sciences

View shared research outputs
Researchain Logo
Decentralizing Knowledge