EDBT 2026 Demo / reviewers in the wild / expert
Hong Qin 0009
dblp:79/627-9
· DBLP profile ↗
8ranked-venue papers
4as first author
7since 2021 · last 2026
0000-0002-7220-5246ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Security and privacy · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 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 |
Privacy and data protection · 77% Cryptographic protocols and secure computation · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
privacy-preserving machine learning |
0.8 | 1 | 2024 | Cryptographic Primitives in Privacy-Preserving Machine Learning: A Survey · IEEE Trans. Knowl. Data Eng. 2024 |
Cryptographic protocols and secure computation
secure computation primitives |
0.2 | 1 | 2024 | Cryptographic Primitives in Privacy-Preserving Machine Learning: A Survey · IEEE Trans. Knowl. Data Eng. 2024 |
Methods — techniques the papers use, named apart from their topics
systematization of knowledge · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Secure three-party clustering with identifying malicious behaviorabstractClustering 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. | 4 |
| 2026 | RDFDS: A Federated Learning Defense Framework in IoV With Fast Distillation Synthesis and Clustering-Based AggregationabstractFederated Learning (FL) has emerged as a promising paradigm to address data silos and privacy concerns in artificial intelligence applications. It shows great potential in the Internet of Vehicles (IoV), where sensitive vehicle data must remain local. However, FL is highly vulnerable to model poisoning attacks, especially under non-IID distributions and high malicious participation. Existing defenses, most relying on gradient similarity across clients, often fail under such heterogeneous settings. To address this, we propose RDFDS, a robust defense framework for FL in IoV. RDFDS consists of two tightly coupled modules: (1) a fast distillation-based synthesis module that accelerates knowledge distillation via a lightweight preprocessing step, suitable for real-time vehicular environments; (2) a Gas-KMeans clustering aggregation module that adaptively assigns aggregation weights by identifying the benign majority through Gap Statistics, preserving reliable contributions without requiring global or cross-client reference data. Extensive experiments on MNIST, CIFAR-10, and GTSRB demonstrate that RDFDS consistently outperforms existing defenses in accuracy and robustness, particularly under extreme non-IID conditions and high malicious participation, highlighting its practicality for real-world IoV scenarios. Lei Zhang 0087, Hong Qin 0009, Hao Wang 0007, Zhuoming Lin |
IEEE Internet Things J. | 3 |
| 2026 | Secure and Dropout-Resilient Three-Party Clustering Based on Cloud-Edge-Client CollaborationabstractClustering algorithms, as the core technology in data analysis, can extract potential patterns and regularities from complex data. However, deploying k -means clustering on resource-limited devices remains a challenge. Despite the promise of cloud computing, outsourcing data to a remote cloud leads to high latency and privacy risks. Moreover, the stability and speed of cloud can be affected by the state of network and configuration, which leads to computation error. Therefore, we design a secure and dropout-resilient k -means clustering scheme based on cloud-edge-client collaboration architecture. In our scheme, cloud server simply generates multiplication triples in pre-processing phase and can be offline. In online phase, IoT devices secretly share the raw sensing data with three edge servers. Then edge servers accomplish the clustering task interactively. We propose four basic protocols based on vector space secret sharing, including Euclidean distance, comparison, minimum and division protocols. By applying these protocols, we construct a clustering scheme that can tolerate the exit of one edge server and corruption of two edge servers. Since edge servers are generally located in trusted environment, we allow them to reconstruct clustering result and provide low-latency and high-reliability service. We prove that the basic protocols and clustering scheme are secure against semi-honest adversary. We conduct the experiments on two realistic datasets, showing that our scheme has good efficiency and is suitable for practical application. Hong Qin 0009, Debiao He, Min Luo 0002 |
ACM Trans. Internet Techn. | 1 |
| 2024 | Outsourced and Robust Multi-party Computation with Identifying Malicious Behavior and Application to Machine Learning
Hong Qin 0009, Debiao He, Qingcai Luo |
ISPEC | 1 |
| 2024 | Cryptographic Primitives in Privacy-Preserving Machine Learning: A SurveyabstractAdvances in machine learning have enabled a broad range of complex applications, such as image recognition, recommendation system and machine translation. Data plays an important role in our increasingly complex and diverse environments, and this also reinforces the importance of data privacy in machine learning-enabled applications. Although there are a number of literature survey articles on machine learning, only a few studies have investigated the cryptographic primitives used in privacy-preserving machine learning (PPML). In other words, there is no, or limited, systematization of knowledge (SoK) that provides a comprehensive introduction to cryptography that have been deployed in PPML. In this paper, we firstly introduce some basic concepts such as machine learning tasks and processes. Then, we review and systematize the cryptographic primitives used in PPML. We analyze these existing privacy-preserving schemes in their learning process, especially training and inference. Finally, we conclude our survey and provide an outlook on future trends and research directions in the field. Hong Qin 0009, Debiao He, Muhammad Khurram Khan, Min Luo 0002, Kim-Kwang Raymond Choo |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2023 | Secure CNN Training and Inference based on Multi-key Fully Homomorphic EncryptionabstractConvolutional neural network (CNN) has attracted increasing attention and been widely used in imaging processing, bioinformatics and so on. As the cloud computing and multiparty computing are booming, the training and inference data of convolutional neural network often comes from diverse users. These users tend to jointly perform the computation but reluctantly share original data with others. Multi-key fully homomorphic encryption (MKFHE) supports homomorphic computation on ciphertexts encrypted with different keys, which is especially suitable for this scenario. In this paper, we firstly propose secure convolution, matrix multiplication, comparison and maximum protocols based on MKFHE. Then we design the secure CNN training and inference framework, outsourcing almost all computations to cloud server. To improve the efficiency, we use key switching technique for ciphertext transformation. We prove that the proposed frameworks are secure and feasible. The theoretical and experimental analysis show that our framework achieves the trade-off between security, efficiency and scalability. Hong Qin 0009, Debiao He, Min Luo 0002 |
ICPADS | 1 |
| 2022 | A blockchain-based traceable group loan systemabstractSummary Difficulties in financing and low utilization of funds are main financial problems that plague the development of small and medium‐sized enterprises. The key to solving this problem lies in opening up the social data circulation between enterprises. It is a good solution for enterprises with frequent data interactions to form groups. Using group loans, the borrowing enterprises could solve the funding difficulties and the loan enterprises could improve the utilization rate of funds. In this article, we construct a group loan system based on blockchain technology, which can promote the free flow of funds among enterprises in the group. We combine the blockchain with the trusted execution environment to realize the automatic determination of loan conditions and realize the automatic execution of smart contracts. We also use the linkable group signature technology to ensure the traceability of loan users while protecting the anonymity. In addition, we use homomorphic encryption technology to make the statement confidential and computable. Zhihua Zheng, Zhi Li 0056, Ziyu Niu, Hong Qin 0009, Hao Wang 0007 |
Concurr. Comput. Pract. Exp. | 5 |
| 2020 | Blockchain-based fair payment smart contract for public cloud storage auditing
Hao Wang 0007, Hong Qin 0009, Minghao Zhao 0001, Xiaochao Wei, Hua Shen 0002, Willy Susilo |
Inf. Sci. | 2 |