Baosheng Wang

National University of Defense Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Qianqian Xing

National University of Defense Technology

Xiaofeng Wang

National University of Defense Technology

Yong Tang

National University of Defense Technology

Wei Xie

National University of Defense Technology

Baokang Zhao

National University of Defense Technology

Xiaozhe Zhang

Beihang University

Xianming Gao

PLA Academy of Military Science

Xu Zhou

National University of Defense Technology

Yue-Bin Luo

National University of Defense Technology

Tao Li

National University of Defense Technology

Cooperative Institutions

National University of Defense Technology

137

Chinese Academy of Sciences

University of British Columbia

Hunan University

University of Chinese Academy of Sciences

Huazhong University of Science and Technology

University of Science and Technology of China

Sichuan University

Shanghai Jiao Tong University

Shandong University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Software Data Plane and Flow Switching Plane Separation in Next-Generation Router Architecture

2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) (2015)

Xianming Gao Baosheng Wang Xiaozhe Zhang Xu An Wang

Routers have traditionally been architected as two elements: forwarding plane and control plane through ForCES or other protocols. Each forwarding plane aggregates a fixed amount of computing, memory, and network interface resources to forward packets. Unfortunately, the tight coupling of packet-processing tasks with network interfaces has severely restricted service innovation and hardware upgrade. In this context, we explore the insightful prospect of functional separation in forwarding plane to propose a next-generation router architecture, which, if realized, can provide promises both for various packet-processing tasks and for flexible deployment while solving concerns related to the above problems. Thus, we put forward an alternative construction in which functional resources within a forwarding plane are disaggregated. A forwarding plane is instead separated into two planes: software data plane (SDP) and flow switching plane (FSP). SDP is responsible for packet-processing tasks without its expansibility restricted with the amount and kinds of network interfaces. FSP is in charge of packet receiving/transmitting tasks and can incrementally add switching elements, such as general switches, or even specialized switches, to provide network interfaces for SDP. At last, we make an experiment on our platform in terms of bandwidth utilization rate, configuration delay, and the processing time of a simple router. Our experimental results show that the separation of SDP and FSP brings greater modularity to router architecture, allowing operators to optimize their deployments.

Forwarding plane

Packet processing

Packet forwarding

One-armed router

OpenFlow

Core router

Network processor

10.1109/3pgcic.2015.13

Cite

Citations (1)

Balancing authenticity and creativity: a VR system design for assisting ceramic creation

Academia Press eBooks (2023)

Haoxiang Fang Fang Baosheng Wang Qing Liang

Culture-based product designers are facing the challenge of balancing authenticity and creativity: designers need to maintain tradition in materials, craftsmanship and cultural factors, while product design values innovation in form, function and user experience, which requires both indigenous knowledge and creative design methods.This paper describes our attempt to develop a VR system to help culture-based product designers learn indigenous knowledge and translate it into ceramic creation.The system includes a ceramic repository module, a design case library module, and a rapid prototyping module.The effectiveness of the VR system was assessed through a design workshop where eight participants were randomly divided into two groups, one working with the VR system and the other working with paper-based approach.Experts scored their design work by assessing authenticity through appearance, craftsmanship and culture, and creativity through aesthetics, technology and uses.Results showed that the VR group had a better general performance, specifically in terms of culture, and were more open to creative experimentation in terms of technology and uses.

10.26530/9789401496476-058

Cite

Citations (0)

Automatic Malware Detection Using Deep Learning Based on Static Analysis

Communications in computer and information science (2017)

Liu Liu Baosheng Wang

10.1007/978-981-10-6385-5_42

Cite

Citations (11)

Semantic-Based Representation Binary Clone Detection for Cross-Architectures in the Internet of Things

Applied Sciences (2019)

Zhenhao Luo Baosheng Wang Yong Tang Wei Xie

Code reuse is widespread in software development as well as internet of things (IoT) devices. However, code reuse introduces many problems, e.g., software plagiarism and known vulnerabilities. Solving these problems requires extensive manual reverse analysis. Fortunately, binary clone detection can help analysts mitigate manual work by matching reusable code and known parts. However, many binary clone detection methods are not robust to various compiler optimization options and different architectures. While some clone detection methods can be applied across different architectures, they rely on manual features based on human prior knowledge to generate feature vectors for assembly functions and fail to consider the internal associations between features from a semantic perspective. To address this problem, we propose and implement a prototype GeneDiff, a semantic-based representation binary clone detection approach for cross-architectures. GeneDiff utilizes a representation model based on natural language processing (NLP) to generate high-dimensional numeric vectors for each function based on the Valgrind intermediate representation (VEX) representation. This is the first work that translates assembly instructions into an intermediate representation and uses a semantic representation model to implement clone detection for cross-architectures. GeneDiff is robust to various compiler optimization options and different architectures. Compared to approaches using symbolic execution, GeneDiff is significantly more efficient and accurate. The area under the curve (AUC) of the receiver operating characteristic (ROC) of GeneDiff reaches 92.35%, which is considerably higher than the approaches that use symbolic execution. Extensive experiments indicate that GeneDiff can detect similarity with high accuracy even when the code has been compiled with different optimization options and targeted to different architectures. We also use real-world IoT firmware across different architectures as targets, therein proving the practicality of GeneDiff in being able to detect known vulnerabilities.

Representation

Binary code

Code reuse

clone (Java method)

Code (set theory)

Assembly language

10.3390/app9163283

Cite

Citations (19)

An Improved K-means Algorithm for Test Case Optimization

2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS) (2019)

Tiantian Tan Baosheng Wang Yong Tang Xu Zhou

In order to optimize the effectiveness and efficiency of software test cases, this paper proposed an improved K-means algorithm for test case optimization, introduced Degree of Membership Function to improve K-Means algorithm to design a fuzzy clustering method, and combined the test requirements set, extracted test cases from each cluster, found similar test cases as more as possible. Experimental results showed that this algorithm can minimize the redundant test case set, keep the widest coverage at the same time, and has higher effectiveness and efficiency.

Degree (music)

10.1109/ccoms.2019.8821687

Cite

Citations (1)

Re-criticism about “He Qifang Phenomenon” ——a Summary Speech at He Qifang's 90~(th) Anniversary Commemoration & the 2nd International Symposium on He Qifang

Journal of Chongqing Three-gorges University (2003)

Baosheng Wang

He Qifang抯 90th Anniversary Commemoration the 2nd International Symposium on He Qifang was held in Nov. 2002 in Chongqing Three Gorges University. The speeches and the papers presented show that the study about He Qifang, a renowned contemporary poet in China, has made much progress with a much broader view, and more concrete and deeper analysis of his poems. At the symposium, 揌e Qifang Phenomenon?was put forward. And, this idea results from many reasons and is closely related to the factor of the times in terms of an overall observation of He Qifang抯 performance in his artistic development road after 1949.

Phenomenon

Three gorges

Source

Cite

Citations (0)

Improving BGP Convergence through Advertisement Time Stamp

Journal of National University of Defense Technology (2006)

Baosheng Wang

This paper presents a new mechanism called BGP(border gateway protocol) with ATS(advertisement time stamp),which can greatly reduce routing convergence delay for BGP greatly.In the approach presented,when a BGP speaker sends a peer an advertisement packet,it marks the corresponding routing prefix/prefixes with the system time.When the next advertisement packet is ready,the BGP speaker decides whether the packet should be sent immediately or not via the corresponding time stamp checking.It shows that ATS takes advantage of the per-peer MRAI(min-route-advertisement-interval) Timer and per-peer per-destination MRAI Timer while overcoming their disadvantages.Theoretical analysis demonstrates that ATS can achieve a dramatic improvement in routing convergence for Tup,Tshort and Tlong events in comparison with BGP and other existing solutions.

Border Gateway Protocol

Timer

Prefix

Default-free zone

Source

Cite

Citations (0)

Test/Repair Area Overhead Reduction for Small Embedded SRAMs

Proceedings - Asian Test Symposium/Proceedings (2006)

Baosheng Wang Qiang Xu

For current highly-integrated and memory-dominant system-on-a-chips (SoCs), especially for graphics and networking SoCs, the test/repair area overhead of embedded SRAMs (e-SRAMs) is a big concern. This paper presents various approaches to tackle this problem from a practical point of view. Without sacrificing at-speed testability, diagnosis capability and repairability, the proposed approaches consider partly sharing wrapper for identical memories, sharing memory BIST controllers for e-SRAMs embedded in different functional blocks, test responses compression for wide memories, and various repair strategies for e-SRAMs with different configurations. By combining the above approaches, the test/repair area overhead for e-SRAMs can be significantly reduced. For example, for one benchmark SoC used in our experiments, it can be reduced as much as 10% of the entire memory array

Benchmark (surveying)

10.1109/ats.2006.260990

Cite

Citations (10)

Secure Anonymous Communication on Corrupted Machines With Reverse Firewalls

IEEE Transactions on Dependable and Secure Computing (2021)

Yi Wang Rongmao Chen Xinyi Huang Baosheng Wang

The Snowden revelations in 2013 showed that user machines running cryptographic protocols might be stealthily corrupted by attackers (e.g., manufacturers and supply-chain intermediaries) who could tamper cryptographic implementations to insert backdoors to undermine cryptographic tools. To formalize such attacks, in CRYPTO 2014, Bellare et al. proposed the notion of Algorithm-Substitution Attack (ASA) which has been extensively studied since then. In this work, we turn to investigate the security of anonymous communication (AC) protocol—a well-known tool to protect user privacy on the Internet—in the case when user machines are corrupted. Specifically, we give a formal treatment of ASAs on the universal mixnet-based AC (

$\mathsf{U\text{-}Mix\text{-}AC}$

) protocols. We show that ASAs on

$\mathsf{U\text{-}Mix\text{-}AC}$

protocols could be more dangerous than previously thought by presenting attacks that are extremely powerful. As countermeasure, we adopt cryptographic reverse firewall (CRF), originally proposed by Mironov and Stephens-Davidowitz in EUROCRYPT 2015, to restore the security of

$\mathsf{U\text{-}Mix\text{-}AC}$

protocols in the presence of ASAs. We also implement proposed AC protocol, ASAs and CRFs for experimental evaluations, and the results show that the execution time of subverted algorithms is almost the same as that of faithful ones and our designed CRFs are effective to guard the security of

$\mathsf{U\text{-}Mix\text{-}AC}$

protocol.

Guard (computer science)

10.1109/tdsc.2021.3107463

Cite

Citations (2)

SHFuzz: Selective Hybrid Fuzzing with Branch Scheduling Based on Binary Instrumentation

Applied Sciences (2020)

Xianya Mi Baosheng Wang Yong Tang Pengfei Wang Bo Yu

Hybrid fuzzing is a popular software testing technique that combines random fuzzing with concolic execution. It is widely used in the security domain known for its ability to find deeply hidden vulnerabilities and reach high code coverage. Hybrid fuzzing is based on negating branches in the execution path of a specific input to generate new test cases. However, due to numerous inputs and related branches, it does not show the best of its effectiveness without input and branch selection methods. In this paper, we systematically analyze the branch scheduling problem in the internal attributes of hybrid fuzzing, focusing on the synchronization mechanism. To solve the problems, we propose the Selective Hybrid Fuzzing (SHF) approach with branch scheduling based on binary instrumentation. There are two major parts to the SHF approach: (1) we propose a critical branch selection algorithm to select critical branches by three metrics: hit accuracy, solvability, and complexity; (2) we propose a priority score calculation algorithm to select inputs by the number of critical branches. With the SHF approach, we choose only the branches that can be negated to generate new coverage, instead of repeatedly executing the same branches and generating duplicates of inputs. We implement a hybrid fuzzer called SHFuzz with our SHF approach and compare it with the state-of-the-art hybrid fuzzer QSYM. In the evaluation, SHFuzz outperforms QSYM in 20 real-world applications from the Google Fuzzer Test Suite and other program suites in a 12 h test. On average, SHFuzz achieves 8.40% more code coverage and 100 more unique crashes in each application. Our work also finds existing vulnerabilities 7.85× faster than QSYM. We also find new bugs by SHFuzz, which QSYM fails to find. Our evaluation shows that the selective hybrid fuzzing approach can reduce the number of branches executed in concolic execution, enhancing hybrid fuzzing on code coverage and bug finding capabilities.

Fuzz testing

Code coverage

Random testing

10.3390/app10165449

Cite

Citations (6)