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

Yong Liu 0053

dblp:29/4867-53 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
0000-0001-7615-5103ORCID · conflict

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

Computer networks · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 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
Privacy and data protection · 50% Cryptographic primitives and cryptanalysis · 50%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving image retrieval
encrypted image retrieval
0.812024
DCIRM: Dynamic and Controllable Image Retrieval Scheme in Multi-Owner Multi-User Settings · IEEE Trans. Serv. Comput. 2024
Cryptographic primitives and cryptanalysis
proxy re-encryption
0.812024
DCIRM: Dynamic and Controllable Image Retrieval Scheme in Multi-Owner Multi-User Settings · IEEE Trans. Serv. Comput. 2024
Information retrieval › image retrieval › content-based image retrieval
encrypted image retrieval
0.212024
DCIRM: Dynamic and Controllable Image Retrieval Scheme in Multi-Owner Multi-User Settings · IEEE Trans. Serv. Comput. 2024

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

polynomial-based access strategy · 1.5chameleon hash · 1.5
YearPublicationVenuePosition
2026 MOSM: Multi-objective optimized switch migration for controller load balancing in software-defined internet of vehicles
Yong Liu 0053, Quanze Liu
Future Gener. Comput. Syst.1
2025 GRU-based Seq2Seq for Controller Load Prediction in Software-Defined Networks✱
Yuanhang Ge, Quanze Liu, Yong Liu 0053
APNet3
2024 TAAC: Secure and Efficient Time-Attribute-Based Access Control Scheme in SDN-IoT
abstract
The convergence of software‐defined networking (SDN) and the Internet of Things (IoT) provides a scalable method for handling the considerable volumes of data produced by IoT devices. However, the lack of appropriate security measures can lead to unauthorized access to sensitive data, potential breaches, and privacy violations, as well as time‐consuming and inefficient data retrieval methods in SDN‐IoT systems that require decrypting the entire dataset. To address these challenges, this article proposes the time‐attribute‐based access control scheme in SDN‐IoT (TAAC). The TAAC scheme combines ciphertext‐policy attribute‐based encryption with a novel time‐attribute‐based access tree to ensure fine‐grained access control on time and attributes, enabling secure ciphertext interaction and information sharing across domains. Furthermore, the TAAC scheme also incorporates searchable encryption, which enhances the efficiency of data retrieval. By implementing searchable encryption techniques, the data receiver can generate trapdoors to search and retrieve specific encrypted data without the need to decrypt the entire dataset. In summary, the TAAC scheme improves storage efficiency and computation, enhances scalability, and provides robust security, offering an efficient and secure solution for ciphertext sharing in SDN‐IoT environments. Experimental results have demonstrated that the TAAC scheme shows excellent performance and outperforms other attribute‐based searchable encryption algorithms.
Zhonghua Shen, Kefei Chen, Fuqun Wang, Yong Liu 0053
IET Inf. Secur.7
2024 BSM-LP: Bidirectional Switch Migration With Controller Load Prediction for Software-Defined Internet of Things
abstract
The Software-Defined Internet of Things (SD-IoT) utilizes the centralized control and programmability of Software-Defined Networking (SDN) to enhance network performance optimization and efficient resource utilization in IoT. As the network scale expands, the multiple-controller architecture becomes crucial for ensuring reliability and scalability in SD-IoT. However, the dynamic changes in traffic patterns often lead to imbalanced loads among controllers. Existing solutions primarily focus on switch migration schemes, but traditional schemes primarily rely on real-time data to assess controller loads, which fails to predict future controller loads and leads to unnecessary switch migrations. Meanwhile, existing schemes frequently encounter the challenge of overloading the target controller, leading to reduced migration efficiency. Furthermore, conventional schemes tend to overlook the issue of isolated nodes that arise from switch migrations, thereby compromising network reliability and security. To address these challenges, we propose bidirectional switch migration based on load prediction (BSM-LP), which utilizes an ATT-GRU model to accurately predict controller loads based on historical load data, thereby preventing unnecessary switch migrations. Moreover, we introduce a bidirectional switch migration algorithm that enhances migration efficiency while avoiding overloading the target controller. Additionally, we present an algorithm for identifying and integrating isolated nodes to reduce their occurrence. Finally, we validate the effectiveness of BSM-LP, and the experimental results demonstrate that it reduces the load imbalance rate by an average of 22.3% and the response time by 30.5% compared to existing schemes.
Quanze Liu, Yong Liu 0053
IEEE Internet Things J.2
2024 DCIRM: Dynamic and Controllable Image Retrieval Scheme in Multi-Owner Multi-User Settings
abstract
The proliferation of cloud computing technology has led to a significant number of users opting to store image data on the cloud. To ensure the confidentiality of image data, it is recommended to apply encryption techniques prior to uploading them to cloud servers. However, the traditional encrypted image retrieval schemes prove inadequate for practical application scenarios due to limitations in supporting multi-owner and multi-user settings, inefficient access control, and a lack of dynamic verifiability. To address the challenges presented by practical application scenarios, in this paper, we propose a Dynamic and Controllable Image Retrieval scheme in the Multi-owner multi-user settings (DCIRM). First of all, we realize the usability in multi-owner and multi-user scenarios through re-encryption settings. Then, we realize the verifiability of dynamic data by applying the dynamic authentication constructed by the chameleon hash function. Finally, we realize lightweight access control through the polynomial-based access strategy. The DCIRM scheme has been demonstrated to be privacy-preserving, efficient, and feasible through rigorous security analysis and experimentation with authentic datasets.
Chenyang Mao, Zhonghua Shen, Kefei Chen, Yong Liu 0053, Fuqun Wang
IEEE Trans. Serv. Comput.4
2023 Attention-based LSTM for Controller Load Prediction in Software-Defined Networks✱
Yong Liu 0053, Quanze Liu
APNet1