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

Qingcai Luo

dblp:331/1867 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
9since 2021 · last 2026
0009-0005-0564-9065ORCID · corroborated

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

Security and privacy · 6 · 1 first-author · 6 since 2021Systems, architecture and hardware · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Cryptographic protocols and secure computation · 66% Cryptographic primitives and cryptanalysis · 24% Security and privacy of machine learning · 10%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › discrete logarithm signature
ECDSA
0.912025
Efficient Three-Party ECDSA Signature Based on Replicated Secret Sharing With Identifiable Abort · IEEE Trans. Inf. Forensics Secur. 2025
Cryptographic protocols and secure computation › secure multiparty computation › active security
identifiable abort
0.912025
Efficient Three-Party ECDSA Signature Based on Replicated Secret Sharing With Identifiable Abort · IEEE Trans. Inf. Forensics Secur. 2025
Cryptographic protocols and secure computation › secret sharing › linear secret sharing
replicated secret sharing
0.912025
Efficient Three-Party ECDSA Signature Based on Replicated Secret Sharing With Identifiable Abort · IEEE Trans. Inf. Forensics Secur. 2025
Cryptographic protocols and secure computation
secret sharing
0.912025
Efficient Three-Party ECDSA Signature Based on Replicated Secret Sharing With Identifiable Abort · IEEE Trans. Inf. Forensics Secur. 2025
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
threshold signature
0.912025
Efficient Three-Party ECDSA Signature Based on Replicated Secret Sharing With Identifiable Abort · IEEE Trans. Inf. Forensics Secur. 2025
Cryptographic protocols and secure computation
multi-party protocols
0.812024
SecureGPT: A Framework for Multi-Party Privacy-Preserving Transformer Inference in GPT · IEEE Trans. Inf. Forensics Secur. 2024
Security and privacy of machine learning
privacy-preserving inference
0.812024
SecureGPT: A Framework for Multi-Party Privacy-Preserving Transformer Inference in GPT · IEEE Trans. Inf. Forensics Secur. 2024
Cryptographic protocols and secure computation › secure multiparty computation › secure two-party computation
private transformer inference
0.812024
SecureGPT: A Framework for Multi-Party Privacy-Preserving Transformer Inference in GPT · IEEE Trans. Inf. Forensics Secur. 2024
Cryptographic protocols and secure computation
secure multiparty computation
0.812024
SecureGPT: A Framework for Multi-Party Privacy-Preserving Transformer Inference in GPT · IEEE Trans. Inf. Forensics Secur. 2024
Natural language and speech › Language models and text generation › neural language model › autoregressive language model
generative pre-trained transformer
0.212024
SecureGPT: A Framework for Multi-Party Privacy-Preserving Transformer Inference in GPT · IEEE Trans. Inf. Forensics Secur. 2024

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

truncation protocol · 1.5softmax protocol · 1.5multiplicative-to-additive share conversion · 1.5GELU protocol · 1.5replicated secret sharing · 0.9identifiable abort · 0.9
YearPublicationVenuePosition
2026 Secure three-party clustering with identifying malicious behavior
abstract
Clustering algorithms are pivotal tools in data science and machine learning, offering a diverse array of applications ranging from customer segmentation to anomaly detection. With the development of cloud computing and outsourced computing, the adoption of clustering techniques has significantly accelerated. Despite the remarkable benefits of cloud computing, outsourcing sensitive data to remote cloud servers introduces considerable privacy and security concerns. Specifically, there is a risk that cloud service providers may engage in malicious behavior, such as data tampering. In response to these concerns, we propose four basic protocols based on vector space secret sharing, including secure Euclidean distance protocol, comparison protocol, minimum protocol, and division protocol. By applying these protocols, we construct a secure clustering scheme that can identify malicious behaviors. We thoroughly demonstrate the security of each underlying protocol as well as the overall clustering scheme. To validate the practicality and effectiveness of our approach, we conduct experiments on standard datasets. The results show that our clustering scheme performs efficiently while maintaining strong security guarantees.
Qingcai Luo, Hui Li 0005, Hong Qin 0009
High Confid. Comput.1
2026 Ophiuchus: Privacy-preserving training service with user-controlled pseudo-noise information generation
Longlong Sun, Hui Li 0006, Qingcai Luo, Yanguo Peng, Jiangtao Cui
Inf. Process. Manag.3
2025 Robust privacy-preserving KNN for smart healthcare with participant dropout resilience
Xin Chen 0051, Debiao He, Qingcai Luo
J. Inf. Secur. Appl.5
2025 A Dynamic and Secure Join Query Protocol for Multi-User Environment in Cloud Computing
abstract
The development of cloud computing needs to continuously improve and perfect the privacy-preserving techniques for the user’s confidential data. Multi-user join query, as an important method of data sharing, allows multiple legitimate data users to perform join query over the data owner’s encrypted database. However, some existing join query protocols may face some challenges in the practical application, such as practicality, security, and efficiency. In this article, we put forward a dynamic and secure join query protocol in the multi-user environment. Compared with some existing protocols, the proposed protocol has the following advantages. On the one hand, we utilize the dynamic oblivious cross tags structure to realize an efficient join query with forward and backward security. On the other hand, we combine the randomizable distributed key-homomorphic pseudo-random functions with join query to support multiple data users, which can provide resilience against the single user’s key leakage and resist collusion attacks between the cloud server and a subset of data users. We formally define and prove the security of proposed protocol. In addition, we give a detailed analysis of computation and communication overheads to demonstrate the efficiency of proposed protocol. Finally, we carry out some experimental evaluations to further demonstrate the superiority of functionality and efficiency.
Debiao He, Qingcai Luo
IEEE Trans. Cloud Comput.5
2025 Efficient Three-Party ECDSA Signature Based on Replicated Secret Sharing With Identifiable Abort
Wenjing Cheng, Chenkai Zeng, Min Luo 0002, Qingcai Luo
IEEE Trans. Inf. Forensics Secur.7
2024 Isogeny-Based Password-Authenticated Key Exchange Based on Shuffle Algorithm
Congrong Peng, Cong Peng 0005, Qingcai Luo, Min Luo 0002
ISPEC4
2024 Outsourced and Robust Multi-party Computation with Identifying Malicious Behavior and Application to Machine Learning
Hong Qin 0009, Debiao He, Qingcai Luo
ISPEC5
2024 SecureGPT: A Framework for Multi-Party Privacy-Preserving Transformer Inference in GPT
abstract
Generative Pretrained Transformer (GPT) is an advanced natural language processing (NLP) model and is excellent at understanding and generating human language. As GPT is increasingly utilized, more and more cloud inference services for pre-trained generative models are being offered. However, when users upload their data to cloud servers to experience cloud inference services, ensuring the privacy and security of their data becomes a challenge. Thus, in this work, we present SecureGPT, a framework for multi-party privacy-preserving transformer inference in GPT and design a series of building blocks which include M2A (conversion of multiplicative share to additive share), truncation, division, softmax and GELU protocols for our framework. Specifically, we follow the work of SecureNLP and further explore the M2A protocol for non-linear functions such as GELU and softmax. We also design multi-party private protocols for GPT’s transformer sub-layers. Finally we prove the security of our framework in the semi-honest adversary model with all-but-one corruptions. we evaluate the runtime of our framework under different parties settings and our implementation leads to up to$100\times $improvement compared to state-of-the-art works.
Chenkai Zeng, Debiao He, Qingcai Luo
IEEE Trans. Inf. Forensics Secur.5
2023 Solving Client Dropout in Federated Learning via Client Similarity Discovery and Gradient Supplementation Mechanism
Maoxuan Yan, Qingcai Luo, Bo Zhang 0020, Shanbao Sun
ICA3PP (5)2