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

Yingqing Chen

dblp:212/9130 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0009-8439-8135ORCID · reported

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

Security and privacy · 1 · 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
Digital forensics and information hiding · 61% Cryptographic primitives and cryptanalysis · 30% Privacy and data protection · 9%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › steganography › reversible data hiding
encrypted domain data hiding
0.912025
BGN Encryption Based Lossless Data Hiding by Random Number Replacement and Partitioning · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.912025
BGN Encryption Based Lossless Data Hiding by Random Number Replacement and Partitioning · IEEE Trans. Dependable Secur. Comput. 2025
Digital forensics and information hiding
steganography
0.912025
BGN Encryption Based Lossless Data Hiding by Random Number Replacement and Partitioning · IEEE Trans. Dependable Secur. Comput. 2025
Privacy and data protection
privacy-preserving computation
0.312025
BGN Encryption Based Lossless Data Hiding by Random Number Replacement and Partitioning · IEEE Trans. Dependable Secur. Comput. 2025

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

random number replacement · 0.9partitioning · 0.9cipher value selection · 0.9
YearPublicationVenuePosition
2025 BGN Encryption Based Lossless Data Hiding by Random Number Replacement and Partitioning
abstract
For security enhancement and privacy preservation, homomorphic encryption is deployed to facilitate computations among cipher texts. To transmit extra data over a cipher text without affecting its usage, lossless data hiding in encrypted domain (LDH-CT) has been developed by exploiting randomness introduced in homomorphic encryption such as Paillier, BGN and NTRU schemes. As data extraction without decrypting the cipher text has been accomplished with BGN, how to retrieve the hidden data after decryption remains unexplored. In this article, an LDH-CT scheme named random number replacement and partitioning (RNRP) is proposed to achieve the versatility of data embedding by designing two algorithms, namely the random number replacement algorithm to embed data to be extracted after decryption and the cipher value selection algorithm to embed data to be extracted without decryption. For the first time, confidential information to be extracted after decryption can be hidden into a cipher text by a third party without knowing its plain text. For convenience in performance evaluation, the proposed algorithms and the RNRP scheme are applied to a set of test images. Experimental results and comparisons with the state-of-the-art schemes demonstrate the better applicability of the proposed scheme, such as in saving bandwidth.
Haotian Wu 0009, Yingqing Chen, Yiu-Ming Cheung, Jiankun Hu, Zhihong Tian 0001
IEEE Trans. Dependable Secur. Comput.2
2025 Optimal Sequencing and Motion Control in a Roundabout With Safety and Comfort Guarantees
abstract
This paper develops a controller for Connected and Automated Vehicles (CAVs) traversing a single-lane roundabout so that it simultaneously determines (a) the optimal sequence and (b) the associated optimal motion control, jointly minimizing travel time, energy consumption and centrifugal discomfort while providing speed-dependent safety guarantees, as well as satisfying velocity and acceleration constraints. This is achieved by integrating (a) Model Predictive Control (MPC) to enable receding horizon optimization with (b) Control Lyapunov-Barrier Functions (CLBFs) to guarantee convergence to a safe set in finite time, thus providing an extended stability region compared to the use of standard Control Barrier Functions (CBFs). The proposed MPC-CLBF framework overcomes two important limitations of prior work on CAVs over multiple interconnected control zones in a traffic network: infeasibility and myopic control issues, while still providing safety guarantees. Simulations under varying traffic demands and roundabout configurations demonstrate the controller’s effectiveness and stability.
Yingqing Chen, Christos G. Cassandras
IEEE Trans. Intell. Transp. Syst.1