Maolin Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Maolin Yang has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
Hang Lei
5 shared publications- Jian-Jia Chen
TU Dortmund University, Dortmund, Germany
5 shared publications Wen-Hung Huang
DENSO Corp, Corp ePF Div, Kariya, Aichi 4488661, Japan
4 shared publicationsYong Liao
University of Electronic Science and Technology of China, Chengdu 610054, P. R. China
3 shared publications- Zewei Chen
University of Electronic Science and Technology of China, Chengdu, Sichuan, China
3 shared publications - Hang Lei
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
2 shared publications
Latest Publications
- Open Access
- 31 October 2026
- Published by Elsevier in Results in Engineering
- Vol. 32
HybridTrust: PUF-rooted hierarchical blockchain with layered zero-knowledge proofs for scalable IoT device authentication
- 31 October 2026
- Published by Elsevier in Results in Engineering
- Vol. 32
Open AccessHybridTrust: PUF-rooted hierarchical blockchain with layered zero-knowledge proofs for scalable IoT device authentication
- Open Access
- 4 August 2026
- Published by Elsevier in SSRN Electronic Journal
HybridTrust: PUF-Rooted Hierarchical Blockchain with Layered Zero-Knowledge Proofs for Scalable IoT Device Authentication
Blockchain-based IoT authentication must reconcile security, scalability, and device-level resource efficiency—a trilemma that single-layer architectures cannot resolve simultaneously. We present HybridTrust, a hierarchical authentication system aligned with the device–fog–cloud topology, and evaluate it on a 50-node heterogeneous testbed with container-based scale-out. HybridTrust sustains 160–220 ms end-to-end authentication latency, 8,500 auth/s throughput, and ~90% device-side energy reduction over PKI- and ZK-based baselines, while remaining robust under ~1/3 Byzantine fog nodes and matched-rate DoS traffic. These results follow from a cross-layer cryptographic binding protocol that chains PUF-rooted device identities through fog-level Bulletproof batch commitments to cloud-level SNARK-attested aggregation: devices use PUFs and fuzzy extractors for hardware-rooted secrets with constant-time overhead, fog nodes aggregate commitments into batch Bulletproofs and sign attestation summaries, and the cloud generates a single Groth16 proof per window over fog signatures—avoiding the prohibitive cost of embedding Bulletproof verification inside a SNARK and yielding O(1) on-chain verification independent of device count. Analytical modeling projects sub-second latency at 10^6-device scale.
- 4 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessHybridTrust: PUF-Rooted Hierarchical Blockchain with Layered Zero-Knowledge Proofs for Scalable IoT Device Authentication
Blockchain-based IoT authentication must reconcile security, scalability, and device-level resource efficiency—a trilemma that single-layer architectures cannot resolve simultaneously. We present HybridTrust, a hierarchical authentication system aligned with the device–fog–cloud topology, and evaluate it on a 50-node heterogeneous testbed with container-based scale-out. HybridTrust sustains 160–220 ms end-to-end authentication latency, 8,500 auth/s throughput, and ~90% device-side energy reduction over PKI- and ZK-based baselines, while remaining robust under ~1/3 Byzantine fog nodes and matched-rate DoS traffic. These results follow from a cross-layer cryptographic binding protocol that chains PUF-rooted device identities through fog-level Bulletproof batch commitments to cloud-level SNARK-attested aggregation: devices use PUFs and fuzzy extractors for hardware-rooted secrets with constant-time overhead, fog nodes aggregate commitments into batch Bulletproofs and sign attestation summaries, and the cloud generates a single Groth16 proof per window over fog signatures—avoiding the prohibitive cost of embedding Bulletproof verification inside a SNARK and yielding O(1) on-chain verification independent of device count. Analytical modeling projects sub-second latency at 10^6-device scale.
- Open Access
- 29 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 120-127
SilentDNS: Acoustic Side-Channel-Assisted Inference for Device Fingerprinting and State Detection under Encrypted Network Traffic
The pervasive adoption of Transport Layer Security (TLS) 1.3, QUIC (UDP-based multiplexed secure transport), and Encrypted Client Hello (ECH) renders over 95% of network traffic opaque to deep packet inspection, fundamentally challenging device fingerprinting and state detection in enterprise and home networks. Existing encrypted traffic analysis methods relying solely on network metadata degrade by more than 30% under multi-device concurrency, traffic shaping defenses, and noisy labels, exposing a critical gap: the absence of an orthogonal information source that persists independently of encryption protocol evolution. This paper presents SilentDNS, a cross-modal inference framework that fuses ambient acoustic side-channel signals with encrypted network traffic metadata for device fingerprinting and operational state detection without decryption. Unlike prior acoustic side-channel work that treats sound as an attack vector, SilentDNS is the first to leverage device acoustic emissions as an auxiliary defensive channel, aligned with network observations through a weak-supervision InfoNCE contrastive mechanism requiring only coarse window-level labels. Evaluated across 12 device types in three environments, SilentDNS achieves 96.3% macro-F1 in device fingerprinting (+8.7 pp over the best network-only baseline) and 93.1% in state detection, with gains of up to 22.4 pp on I/O-intensive events. Under state-of-the-art traffic padding defenses, SilentDNS recovers 71% of the accuracy lost by network-only classifiers, demonstrating that cross-modal physical–digital fusion provides an observation channel fundamentally harder for adversaries to suppress than network-layer features alone. SilentDNS, a cross-modal framework that fuses ambient acoustic side-channel signals with encrypted network traffic metadata for device fingerprinting and state detection without decryption. SilentDNS exploits the observation that devices emit characteristic acoustic signatures (fan speed, hard disk drive (HDD) seeks, relay clicks) temporally correlated with network behavior—signals that persist regardless of encryption evolution. A contrastive alignment mechanism operates under weak, window-level supervision, and an integrated explanation engine generates human-readable evidence chains for SOC workflows. Across 12 device types in three environments, SilentDNS achieves 96.3% macro-F1 for fingerprinting (+8.7 pp over the best network-only baseline) and 93.1% for state detection (+22.4 pp on I/O-intensive events). Under traffic padding defenses, SilentDNS recovers 71% of accuracy lost by network-only classifiers.
- 29 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 120-127
Open AccessSilentDNS: Acoustic Side-Channel-Assisted Inference for Device Fingerprinting and State Detection under Encrypted Network Traffic
The pervasive adoption of Transport Layer Security (TLS) 1.3, QUIC (UDP-based multiplexed secure transport), and Encrypted Client Hello (ECH) renders over 95% of network traffic opaque to deep packet inspection, fundamentally challenging device fingerprinting and state detection in enterprise and home networks. Existing encrypted traffic analysis methods relying solely on network metadata degrade by more than 30% under multi-device concurrency, traffic shaping defenses, and noisy labels, exposing a critical gap: the absence of an orthogonal information source that persists independently of encryption protocol evolution. This paper presents SilentDNS, a cross-modal inference framework that fuses ambient acoustic side-channel signals with encrypted network traffic metadata for device fingerprinting and operational state detection without decryption. Unlike prior acoustic side-channel work that treats sound as an attack vector, SilentDNS is the first to leverage device acoustic emissions as an auxiliary defensive channel, aligned with network observations through a weak-supervision InfoNCE contrastive mechanism requiring only coarse window-level labels. Evaluated across 12 device types in three environments, SilentDNS achieves 96.3% macro-F1 in device fingerprinting (+8.7 pp over the best network-only baseline) and 93.1% in state detection, with gains of up to 22.4 pp on I/O-intensive events. Under state-of-the-art traffic padding defenses, SilentDNS recovers 71% of the accuracy lost by network-only classifiers, demonstrating that cross-modal physical–digital fusion provides an observation channel fundamentally harder for adversaries to suppress than network-layer features alone. SilentDNS, a cross-modal framework that fuses ambient acoustic side-channel signals with encrypted network traffic metadata for device fingerprinting and state detection without decryption. SilentDNS exploits the observation that devices emit characteristic acoustic signatures (fan speed, hard disk drive (HDD) seeks, relay clicks) temporally correlated with network behavior—signals that persist regardless of encryption evolution. A contrastive alignment mechanism operates under weak, window-level supervision, and an integrated explanation engine generates human-readable evidence chains for SOC workflows. Across 12 device types in three environments, SilentDNS achieves 96.3% macro-F1 for fingerprinting (+8.7 pp over the best network-only baseline) and 93.1% for state detection (+22.4 pp on I/O-intensive events). Under traffic padding defenses, SilentDNS recovers 71% of accuracy lost by network-only classifiers.
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (1) , 360-371
Improved Convolution-Based Analysis for Worst Case Probability Response Time of CAN
Controller area networks (CANs) are widely adopted in real-time automotive control and are increasingly standard in factory automation. Considering their critical application in safety-critical systems, The error rate of the system must be accurately predicted and guaranteed. Through simulation, it is possible to obtain a low-precision overview of the system’s behavior. However, for low-probability events, the required number of samples in simulation increases rapidly, making it difficult to conduct a sufficient number of simulations in practical applications, and the statistical results may deviate from the actual outcomes. Therefore, a formal analysis is needed to evaluate the error rate of the system. This article improves the worst case probability response time analysis by using convolution-based busy window and backlog techniques under the error retransmission protocol of CANs. Empirical analysis shows that the proposed method improves upon existing methods in terms of accuracy and efficiency.
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (1) , 360-371
Improved Convolution-Based Analysis for Worst Case Probability Response Time of CAN
Controller area networks (CANs) are widely adopted in real-time automotive control and are increasingly standard in factory automation. Considering their critical application in safety-critical systems, The error rate of the system must be accurately predicted and guaranteed. Through simulation, it is possible to obtain a low-precision overview of the system’s behavior. However, for low-probability events, the required number of samples in simulation increases rapidly, making it difficult to conduct a sufficient number of simulations in practical applications, and the statistical results may deviate from the actual outcomes. Therefore, a formal analysis is needed to evaluate the error rate of the system. This article improves the worst case probability response time analysis by using convolution-based busy window and backlog techniques under the error retransmission protocol of CANs. Empirical analysis shows that the proposed method improves upon existing methods in terms of accuracy and efficiency.
- 24 October 2024
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 62, 102892
Text2shape: Intelligent computational design of car outer contour shapes based on improved conditional Wasserstein generative adversarial network
- 24 October 2024
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 62, 102892
Text2shape: Intelligent computational design of car outer contour shapes based on improved conditional Wasserstein generative adversarial network
- 16 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (1) , 15-28
A Unified Blocking Analysis for Parallel Tasks With Spin Locks Under Global Fixed Priority Scheduling
Spin locks are widely used in embedded systems to coordinate mutually exclusive accesses to shared resources from different tasks. Although the design and analysis of locking protocols have been intensively studied for sequential real-time tasks, there have been few works on this topic for parallel real-time tasks. In this paper, we study the analysis of parallel real-time tasks modeled by directed acyclic graphs (DAGs) under global fixed priority scheduling using both preemptable and non-preemptable spin locks to protect accesses to shared resources in three commonly used request serving orders (unordered, FIFO-order and priority-order). In particular, we develop a general schedulability analysis framework where the blocking time caused by resource contention is formally defined, so that the blocking analysis can be performed independently and easy to combine with the traditional interference analysis techniques. Moreover, we present a unified blocking analysis technique where the blocking time is analyzed in a scalable manner based on a linear-programming (LP) approach, making our method flexible and extendable. We conduct comprehensive experiments to evaluate our method with other the-state-of-the-art approaches for scheduling real-time parallel tasks using semaphores and spin locks.
- 16 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (1) , 15-28
A Unified Blocking Analysis for Parallel Tasks With Spin Locks Under Global Fixed Priority Scheduling
Spin locks are widely used in embedded systems to coordinate mutually exclusive accesses to shared resources from different tasks. Although the design and analysis of locking protocols have been intensively studied for sequential real-time tasks, there have been few works on this topic for parallel real-time tasks. In this paper, we study the analysis of parallel real-time tasks modeled by directed acyclic graphs (DAGs) under global fixed priority scheduling using both preemptable and non-preemptable spin locks to protect accesses to shared resources in three commonly used request serving orders (unordered, FIFO-order and priority-order). In particular, we develop a general schedulability analysis framework where the blocking time caused by resource contention is formally defined, so that the blocking analysis can be performed independently and easy to combine with the traditional interference analysis techniques. Moreover, we present a unified blocking analysis technique where the blocking time is analyzed in a scalable manner based on a linear-programming (LP) approach, making our method flexible and extendable. We conduct comprehensive experiments to evaluate our method with other the-state-of-the-art approaches for scheduling real-time parallel tasks using semaphores and spin locks.
- 20 May 2022
- Published by Elsevier in Field Crops Research
- Vol. 284, 108576
Grain mineral concentration of Chinese winter wheat varieties released between 1970 and 2005 under diverse nutrient inputs
- 20 May 2022
- Published by Elsevier in Field Crops Research
- Vol. 284, 108576
Grain mineral concentration of Chinese winter wheat varieties released between 1970 and 2005 under diverse nutrient inputs
- 3 March 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 31 (08)
Global Fixed-Priority Scheduling for Parallel Real-Time Tasks with Constrained Parallelism
With the rapid development of parallel programming techniques and the widespread use of multiprocessors, scheduling and analysis techniques supporting parallel real-time tasks become a critical topic for multiprocessor real-time systems. Global scheduling that allows the vertices of a parallel task to execute on any processor is a promising scheduling approach with guaranteed theoretical bounds and wide use in practice. However, the complex internal structure of parallel tasks leads to extensive inner- and inter-task interference, which leads to significant pessimism in the worst-case timing analysis. In this paper, a global fixed-priority (G-FP) scheduling with constrained parallelism for parallel real-time tasks based on the sporadic directed acyclic graph (DAG) model is proposed. Each DAG task is assigned a parallel threshold, such that the number of processors occupied by the task is limited to the parallel threshold of the task at a time. We propose a heuristic algorithm to set the parallel threshold and present a response-time analysis (RTA) to exploit the feature of the constrained parallel scheduling. Experiments with randomly generated tasks show that the proposed approach improves the schedulability upon G-FP and federated scheduling in terms of acceptance ratio.
- 3 March 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 31 (08)
Global Fixed-Priority Scheduling for Parallel Real-Time Tasks with Constrained Parallelism
With the rapid development of parallel programming techniques and the widespread use of multiprocessors, scheduling and analysis techniques supporting parallel real-time tasks become a critical topic for multiprocessor real-time systems. Global scheduling that allows the vertices of a parallel task to execute on any processor is a promising scheduling approach with guaranteed theoretical bounds and wide use in practice. However, the complex internal structure of parallel tasks leads to extensive inner- and inter-task interference, which leads to significant pessimism in the worst-case timing analysis. In this paper, a global fixed-priority (G-FP) scheduling with constrained parallelism for parallel real-time tasks based on the sporadic directed acyclic graph (DAG) model is proposed. Each DAG task is assigned a parallel threshold, such that the number of processors occupied by the task is limited to the parallel threshold of the task at a time. We propose a heuristic algorithm to set the parallel threshold and present a response-time analysis (RTA) to exploit the feature of the constrained parallel scheduling. Experiments with randomly generated tasks show that the proposed approach improves the schedulability upon G-FP and federated scheduling in terms of acceptance ratio.
- Open Access
- 1 March 2022
- Published by KEAI Publishing in Journal of Electronic Science and Technology
- Vol. 20 (1)
SET-MRTS: An empirical experiment tool for real-time scheduling and synchronization
- 1 March 2022
- Published by KEAI Publishing in Journal of Electronic Science and Technology
- Vol. 20 (1)
Open AccessSET-MRTS: An empirical experiment tool for real-time scheduling and synchronization
- 1 August 2021
- Published by Elsevier in Journal of Systems Architecture
- Vol. 117
Blocking analysis of suspension-based protocols for parallel real-time tasks under global fixed-priority scheduling
- 1 August 2021
- Published by Elsevier in Journal of Systems Architecture
- Vol. 117
Blocking analysis of suspension-based protocols for parallel real-time tasks under global fixed-priority scheduling