Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Litao Zhang

dblp:50/11448 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
8since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 2 · 2 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Hardware security and side channels · 93% Systems and software security · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware security and side channels › hardware security primitives › physical unclonable function › modeling attack
machine-learning-based modeling attack
0.812024
Fully Symmetrical Obfuscated Interconnection and Weak-PUF-Assisted Challenge Obfuscation Strong PUFs Against Machine-Learning Modeling Attacks · IEEE Trans. Inf. Forensics Secur. 2024
Hardware security and side channels › hardware security primitives › physical unclonable function
modeling attack
0.812024
Fully Symmetrical Obfuscated Interconnection and Weak-PUF-Assisted Challenge Obfuscation Strong PUFs Against Machine-Learning Modeling Attacks · IEEE Trans. Inf. Forensics Secur. 2024
Hardware security and side channels › hardware security primitives
physical unclonable function
0.812024
Fully Symmetrical Obfuscated Interconnection and Weak-PUF-Assisted Challenge Obfuscation Strong PUFs Against Machine-Learning Modeling Attacks · IEEE Trans. Inf. Forensics Secur. 2024
Hardware security and side channels › hardware security primitives › physical unclonable function
strong PUF
0.812024
Fully Symmetrical Obfuscated Interconnection and Weak-PUF-Assisted Challenge Obfuscation Strong PUFs Against Machine-Learning Modeling Attacks · IEEE Trans. Inf. Forensics Secur. 2024
Systems and software security
reverse engineering
0.212024
Fully Symmetrical Obfuscated Interconnection and Weak-PUF-Assisted Challenge Obfuscation Strong PUFs Against Machine-Learning Modeling Attacks · IEEE Trans. Inf. Forensics Secur. 2024

Methods — techniques the papers use, named apart from their topics

weak PUF · 0.8obfuscated interconnection · 0.8challenge obfuscation · 0.8
YearPublicationVenuePosition
2026 Optimizing Standard Convolution for Diverse Precision on DCU
Haobo Hua, Chuangzheng Hou, Zhuxin Wen, Xiangkai Zhang, Jiandong Shang, Litao Zhang
CCF Trans. High Perform. Comput.7
2025 MoMIL: Mixture of Multi-instance Learners for Modeling Multiple Compound Activities in High Content Imaging
Pushpak Pati, Hsiu-Chi Cheng, Steffen Jaensch, Walid M. Abdelmoula, Krishna Chaitanya, Michiel Van Dyck, Tomé Albuquerque, Samantha Allen, Litao Zhang, Tommaso Mansi, Rui Liao, Zhoubing Xu
MICCAI (13)9
2025 Optimizing 2D convolution for DCUs
Wenlong Fan, Haobo Hua, Jiandong Shang, Zhuxin Wen, Hengliang Guo, Litao Zhang
CCF Trans. High Perform. Comput.6
2024 Fully Symmetrical Obfuscated Interconnection and Weak-PUF-Assisted Challenge Obfuscation Strong PUFs Against Machine-Learning Modeling Attacks
abstract
In this paper, we propose a fully symmetrical obfuscated-interconnection PUF (SOI PUF), which containsndelay stages with each stage having 4kobfuscated interconnections for resisting machine learning (ML)-based modeling attacks. All the delay stages contribute tokPUF primitives while achieving a 20× increase in the number of possible interconnections with the same hardware resources over similar prior arts. The SOI PUF mathematical model also theoretically demonstrates the large number of nonlinear matrix multiplications for resisting ML-based modeling attacks. We further exploit parallel weak PUF cells and propose the challenge-obfuscated SOI PUF (cSOI PUF), which can effectively prevent adversaries from bypassing unknown interconnections through reverse engineering (RE) attacks. The proposed SOI PUF and cSOI PUFs are evaluated by both software simulation and FPGA measurements. Without requiring a largekas in the existing PUF architectures, the simulation results demonstrate that the proposed SOI and cSOI PUFs can achieve a ~50% prediction accuracy fork≥ 3, even when facing ML attacks using 5-hidden-layer Artificial Neural Network (ANN) with 40M training CRPs. Furthermore, the proposed (64,2/4/6/8)-SOI PUF and (64,2/4/6/8)-cSOI PUF implemented using Xilinx Artix-7 FPGA can both achieve a measured reliability and uniformity of >94% and ~50%, respectively. Depending on the value ofk, the uniqueness ranges from 29.1% to 42.7% for SOI PUFs, and further improves to ~50% for cSOI PUFs. The resilience against Reliability-based modeling attacks, Probably Approximately Correct (PAC) attacks and Reverse-Engineering-based modeling attacks will also be discussed.
Chongyao Xu, Litao Zhang, Pui-In Mak, Rui Paulo Martins, Man Kay Law
IEEE Trans. Inf. Forensics Secur.2
2023 Embedding Entity and Relation for Knowledge Graph by Probability Directed Graph
Chunming Yang, Xinghao Song, Litao Zhang
ICONIP (7)4
2023 Cross-Modal Method Based on Self-Attention Neural Networks for Drug-Target Prediction
Litao Zhang, Chunming Yang, Hui Zhang 0055
ICONIP (4)1
2023 Modeling-Attack-Resistant Strong PUF Exploiting Stagewise Obfuscated Interconnections With Improved Reliability
abstract
This article presents an obfuscated-interconnection physical unclonable function (OIPUF) to resist modeling attacks. By introducing nonlinear operations through exploiting the random interconnections of delay stages, the proposed OIPUF can theoretically improve the physical unclonable function (PUF) security while consuming the same hardware resources as the conventional XOR arbiter PUF (XOR APUF). We further propose the metastability-detection (MD) arbiter to effectively improve the PUF reliability. Implemented on Xilinx Artix-7 field-programmable gate array, both the proposed (64,4)- and (64,8)-OIPUF demonstrate a good reliability and uniformity, with the proposed (64,8)-OIPUF showing a better uniqueness and strict avalanche criterion (SAC) performance. Measurement results also show that the proposed MD arbiter can reduce the bit error rate (BER) of the (64,4)- and (64,8)-OIPUF by$\geq 68\times $and$\geq 48\times $at up to 100 °C, respectively. Evaluated using the logistic regression (LR), artificial neural network (ANN), and covariance matrix adaptation-evolution strategy (CMA-ES) machine learning (ML) algorithms, the proposed (64,4)- and (64,8)-OIPUF can achieve a worst case prediction accuracy of 61.47% and 50.59% with up to 10M challenge–response pairs as training set, respectively, demonstrating a significant improvement over similar prior arts.
Chongyao Xu, Litao Zhang, Man Kay Law, Xiaojin Zhao, Pui-In Mak, Rui Paulo Martins
IEEE Internet Things J.2
2022 An effective two-stage algorithm based on convolutional neural network for the bi-objective flexible job shop scheduling problem with machine breakdown
Guohui Zhang 0002, Xixi Lu 0002, Litao Zhang, Shiwen Wei
Expert Syst. Appl.4