HLHongyi Liu

Hongyi Liu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hongyi Liu has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    NeuroMask: Hardening White-Box Lookup Primitives via Secret-Dependent Neural Network for Time-Critical Autonomous Edge Applications

    by Ning Shi, Lei Xu, Hongyi Liu, Weizhi Meng, Yu-An Tan, Mengxia Ren

    Time-critical autonomous and adaptive systems increasingly deploy and execute security-sensitive decision gates directly on edge devices, where symmetric encryption algorithms are applied to protect critical data or achieve secure communication. However, implementations of symmetric cryptographic algorithms typically rely on lookup-centric white-box cryptography (WBC) components.In hostile Man-At-The-End (MATE) deployment environments, the discrete table structures of such components can expose regular intermediate representations to automated reverse engineering and leakage-model attacks such as Differential Computation Analysis (DCA). This motivates the investigation of alternative implementations that reduce alignment with table-oriented analysis while preserving exact functional behavior. We present NeuroMask, a time-critical hardening neural implementation of secret-dependent byte lookups that replaces table access with a compact continuous surrogate and restores exact discrete semantics via a deterministic integer snapping rule. This shifts protected computation from boolean/array logic to mixed floating-point and transcendental operations while keeping a predictable runtime profile. We instantiate NeuroMask with SIREN-based surrogates trained using full-batch L-BFGS, achieving bit-perfect reconstruction of standardized AES and SM4 S-Boxes. Our evaluation combines correlation-based DCA under a controlled leakage model with latency and throughput measurements, positioning NeuroMask as a practical pattern for certified, security-hardening components in autonomous edge applications.

  • NER-AD: Noise-Robust Reconstruction Enhanced by Representation-Learning for Metric Anomaly Detection in Online Service Systems

    by Hongyi Liu, Xiaosong Huang, Mengxi Jia, Tong Jia, Zhonghai Wu, Ying Li, Yajie Wang, Yu-An Tan, Leihuang Zhu, Wanlei Zhou

    Online service systems operate under high concurrency, dynamic workloads, and distributed execution environments, which increase their susceptibility to faults and performance degradation. To ensure stable operation, these systems commonly monitor performance metrics, where timely anomaly detection enables early intervention and fault prevention. Existing metrics-based anomaly detection methods are typically unsupervised, reconstructing unlabeled data to model normal patterns and detecting anomalies as deviations from these patterns. However, they often overlook the presence of unlabeled anomalous data (noise) within the training set, which hinders the model's ability to accurately learn normal behavior and degrades detection accuracy. To address this limitation, we propose a noise-robust, representation-enhanced reconstruction-based anomaly detection method for metrics. The method trains a reconstruction model to capture normal time-series patterns and identifies noisy samples based on their deviation from the latent representation center, assigning them lower training weights. Both the reconstruction outputs and the representation centers jointly define the normal pattern of each sample, reducing the influence of anomalous noise during modeling. Extensive experiments show that our method achieves an F1 score of 97.00% on four widely used datasets, surpassing existing state-of-the-art approaches. Ablation studies further confirm the effectiveness of each module.


  • ERSRKGA: Encrypted Resource Sharing for Resisting Keyword Guessing Attacks in IoV

    by Mengqi Liu, Qikun Zhang, Hongfei Zhu, Yong Gan, Yu-An Tan, Liquan Chen, Hongyi Liu

    Benefiting from the Internet of Vehicles (IoV), modern vehicles are no longer just transportation, but enablers of safe, intelligent, and efficient driving and mobility services. Vehicles increasingly demand environmental information and entertainment resources during operation. These resources are hosted in the cloud, and vehicle terminals query and access them via keywords. However, the ciphertext of resource keywords and trapdoor are transmitted in complex network environments, where simple encryption methods are highly vulnerable to keyword guessing attacks (KGA). Furthermore, single query methods and suboptimal resource sharing mechanisms are no longer viable. Thus, we propose an encrypted resource sharing scheme resisting keyword guessing attacks (ERSRKGA) for the IoV. The ERSRKGA ensures information security through advanced encryption and decryption technologies, combined with re-randomization during transmission. Based on attribute-based encryption, vehicles obtain legitimate attribute weights and participate in resource sharing via a confidential attribute authentication mechanism. The scheme's flexible and refined query functionality meets vehicles' diverse search requirements, including AND, NOT, and wildcard operators, and realizes fine-grained access control. Subsequently, the correctness of ERSRKGA and its resistance to KGA are verified. We compare ERSRKGA with other state-of-the-art schemes in terms of functionality, computational complexity, time overhead, and energy consumption. Experimental results demonstrate that ERSRKGA outperforms the compared schemes.

  • Open Access

    UDA-RCL: Unsupervised Domain Adaptation for Microservice Root Cause Localization Utilizing Multimodal Data

    by Xiaosong Huang, Hongyi Liu, Yifan Wu, Lingzhe Zhang, Tong Jia, Ying Li, Zhonghai Wu

    Root cause Localization methods play a crucial role in ensuring the stability of large-scale microservice systems. However, existing methods either rely on unsupervised approaches with limited localization accuracy or on supervised learning that requires large volumes of historical anomaly data. Such data is often unavailable in newly deployed systems. To address this limitation, we attempt to use the labeled data from mature systems to help new systems build root cause localization models. Specifically, we propose UDA-RCL, an unsupervised domain adaptation root cause localization method using multimodal data (log, metric and trace data). UDA-RCL first incorporates an aggregation based event extraction module to standardize the format of multimodal data from different systems. Then, it utilizes a multimodal event encoder and multimodal domain adversarial adaptation module to narrow the feature distribution gap between different systems. Furthermore, taking into account the situation of sparse anomaly samples, existing methods' classifiers are either hard to transfer to other systems or struggle to capture the process of anomaly propagation, we propose a PageRank classifier module. This module employs a neural network embedded with anomaly propagation rules to output the final root cause ranking results, alleviating the issue of sparse anomaly samples. Extensive experiments have proven that our method achieves the best results in both supervised and transfer learning scenarios.


  • E-Log: Fine-Grained Elastic Log-Based Anomaly Detection and Diagnosis for Databases

    by Lingzhe Zhang, Tong Jia, Xinyu Tan, Xiangdong Huang, Mengxi Jia, Hongyi Liu, Zhonghai Wu, Ying Li

    Database Management Systems (DBMS) form the backbone of modern large-scale software systems, where reliable anomaly detection and diagnosis are essential for ensuring system availability. However, existing log-based methods often impose significant performance overhead by collecting large volumes of logs, which is impractical for DBMS requiring high read/write throughput. This paper addresses a critical yet underexplored challenge: how to balance logging granularity with runtime efficiency for effective anomaly management in databases. We present E-Log, a novel fine-grained elastic log-based framework for anomaly detection and diagnosis. E-Log intelligently adjusts the amount and detail of logging based on system state—maintaining lightweight logging during normal operation for efficient anomaly detection, and triggering rich, informative logging only upon anomaly suspicion for accurate diagnosis. This adaptive strategy significantly reduces runtime overhead while preserving diagnostic precision. We implement E-Log on Apache IoTDB and evaluate it using benchmarks including TSBS, TPCx-IoT, and IoT-Bench. Experimental results show that E-Log improves anomaly detection accuracy by 3.15% and diagnosis performance by 9.32% compared to state-of-the-art methods. Moreover, it reduces log storage size by 43.53% and increases average write throughput by 26.22%. These results highlight E-Log's potential to enable efficient, accurate, and scalable anomaly management in high-performance database systems.


  • Towards Close-to-Zero Runtime Collection Overhead: Raft-Based Anomaly Diagnosis on System Faults for Distributed Storage System

    by Lingzhe Zhang, Tong Jia, Mengxi Jia, Hongyi Liu, Yong Yang, Zhonghai Wu, Ying Li

    Distributed storage systems are fundamental infrastructures of today's large-scale software systems such as cloud systems. Diagnosing anomalies in distributed storage systems is essential for maintaining software availability. Existing anomaly diagnosis approaches mainly rely on the run-time data including monitoring data and application logs. However, collecting and analyzing the run-time data requires huge computing, storage, and management costs. Typically, more fine-grained run-time data can reveal more symptoms of anomalies, but on the contrary, requires more computing, storage, and management costs. As a result, solving the anomaly diagnosis problem is a balancing between the quality of run-time data and system overhead or cost. In this paper, we take into account both data quality and system overhead or cost by introducing a new type of run-time data-Raft logs. Raft logs are naturally produced by distributed storage systems and collecting raft logs will not bring any extra system overhead. To verify the ability of Raft logs in reflecting anomalies, we conduct a comprehensive study on the interconnection between the anomalies and Raft logs. Based on the study, we propose an effective Raft-Based Anomaly Diagnosis approach named RBAD. For evaluation, we expose the first open-sourced comprehensive dataset with multiple runtime data containing both Raft logs, application logs and monitoring data. Experiments based on this dataset demonstrate RBAD's superiority, outperforming monitoring-based methods by 15.38% and log-based methods by 53.10%.


  • UAC-AD: Unsupervised Adversarial Contrastive Learning for Anomaly Detection on Multi-Modal Data in Microservice Systems

    by Hongyi Liu, Xiaosong Huang, Mengxi Jia, Tong Jia, Jing Han, Zhonghai Wu, Ying Li

    To ensure the stability and reliability of microservice systems, timely and accurate anomaly detection is of utmost importance. Recently, considering the lack of labels in real-world scenarios and the collaborative and complementary relationships of multi-modal data in reflecting system anomalies, unsupervised multi-modal anomaly methods have been proposed. However, existing methods face challenges in effectively distinguishing normal hard samples (they are normal but hard to classify correctly) from anomalies. This is mainly caused by two aspects. Firstly, the hard sample patterns are complex. Secondly, the convergence speed is inconsistent between hard and simple samples. To overcome these issues, we propose an unsupervised adversarial contrastive multi-modal anomaly detection method (UACAD). We utilize contrastive learning to help learn the complex patterns of hard samples and enlarge the distance between hard and anomaly samples. Meanwhile, the adversarial framework automatically identifies hard samples and fine-grained adjusts the training weights to each modality part of these hard samples. In this case, The hard sample problems of two aspects can be alleviated. We extensively evaluate UAC-AD on two open-source simulated datasets and a real industrial dataset from a large communication company. Extensive experimental results demonstrate the effectiveness of our approach in anomaly detection. We also release the code and dataset for replication and future research