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

Qiaoliang Ouyang

dblp:368/1348 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

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

Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
Cryptographic primitives and cryptanalysis · 75% Security and privacy of machine learning · 25%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › block cipher
substitution-permutation network
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis
symmetric cryptography
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026
Security and privacy of machine learning › adversarial attack
white-box attack
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis › cryptographic implementation
white-box cryptography
1.012026
Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks · IEEE Trans. Dependable Secur. Comput. 2026

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

security analysis · 1.0experimental evaluation · 1.0
YearPublicationVenuePosition
2026 Securing Symmetric Encryption Based on Substitution-Permutation Network Against White-Box Attacks
abstract
Extensive research has been done on the security of symmetric encryption algorithms in the black-box attack contexts, where the execution platforms are supposed to be secure. Recent studies intend to secure encryption algorithms in a more challenging but widely adopted scenario, the white-attack context (WBAC), where the adversaries have full visibility of the implementations of cryptosystems and full control over execution platforms. Various of approaches for protecting symmetric encryption algorithms in the WBAC have been proposed. Unfortunately, most existing approaches have been broken. This paper proposes a novel approach for securing symmetric encryption algorithms based on substitution-permutation network (SPN). Our key idea is to incorporate additional secret components into lookup tables to expand and dramatically change the inner states of encryption. Unlike existing approaches, these components do not need to be annihilated in adjacent rounds, and the ciphertext remains essentially unchanged. To recover the plaintext, only simple operations and the standard decryption algorithm are required. Our approach can be applied to protect SPN-based symmetric encryption algorithms such as AES. Security analysis indicates that the approach is expected to be resistant to both existing and unknown attacks. Furthermore, experimental evaluation shows that our approach performs well on various platforms.
Yang Shi 0002, Tianchen Gao, Qiaoliang Ouyang, Junqing Liang, Mianhong Li, Jiayao Gao, Xiapu Luo
IEEE Trans. Dependable Secur. Comput.3
2025 SHBC-VDRM: Space-Hard Block Cipher for Video Digital Rights Management
abstract
Video has become the primary channel for people to access information and engage in leisure and entertainment activities. Video service platforms have emerged to meet these demands and create significant profits. These platforms aggregate diverse videos and offer subscription services, aiming to provide convenient and personalized viewing experiences. To safeguard the copyright of video content against unauthorized access, these platforms employ digital rights management (DRM) technologies. However, the use of DRM faces significant security challenges due to the presence of malware or malicious users, which can compromise the decryption program running on user devices and lead to illegal video content distribution. This paper proposes a high-performance encryption scheme for video DRM protection. We establish the security of our proposed scheme through rigorous mathematical proof and analyze its effectiveness in the context of the video DRM scenario. Furthermore, the experimental results demonstrate that our scheme outperforms other schemes. Overall, our proposed scheme offers a promising solution to the security challenges faced by DRM technologies in protecting video content. Its efficiency, security, and resilience to various attacks make it a viable option for video service platforms seeking to enhance the security of their digital content.
Yang Shi 0002, Qiaoliang Ouyang, Jinkun Wang, Guodong Ye, Bowen Du 0002, Jiayao Gao
IEEE Trans. Netw. Serv. Manag.2
2023 A GPU-Accelerated Framework for Standard White-Box Cryptographic Algorithms in Unattended IoT Devices
abstract
White-box cryptography is widely used in Internet of Things (IoT) devices to ensure data confidentiality. However, the traditional implementations of white-box cryptographic algorithms (WBCAs) are inefficient and impractical for IoT devices that require fast encryption and decryption of large amounts of data. To address this challenge, we propose a framework that can accelerate WBCAs employed by IoT devices with Graphics Processing Units (GPUs). Our framework leverages the inherent multithreading capabilities of GPUs to simultaneously perform a large number of table lookups required in WBCAs. Additionally, we employ pipelined execution strategies to enhance performance further. To demonstrate the effectiveness of our framework, we apply it to two well-known WBCAs and evaluate its performance on two IoT devices. The experimental results show that our framework can improve performance by up to 70 times compared with the execution on a single-threaded CPU.
Qiaoliang Ouyang, Yang Shi 0002
SMC1