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

Hunter Qu

dblp:252/3884 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none

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

Security and privacy · 3 · 2 since 2021Databases, data management, data science and information retrieval · 1

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
4 papers
Cryptographic protocols and secure computation · 32% Cryptographic primitives and cryptanalysis · 30% Privacy and data protection · 26%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
homomorphic encryption
1.222023
More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems · IEEE Trans. Dependable Secur. Comput. 2023
PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic Encryption · SP 2021
Recommender systems
cross-domain recommendation
0.712023
More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems · IEEE Trans. Dependable Secur. Comput. 2023
Recommender systems › trustworthy recommendation
privacy-preserving recommendation
0.712023
More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems · IEEE Trans. Dependable Secur. Comput. 2023
Cryptographic protocols and secure computation › secure arithmetic › secure matrix computation
secure matrix multiplication
0.712023
More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems · IEEE Trans. Dependable Secur. Comput. 2023
Privacy and data protection › privacy-preserving machine learning › private training
homomorphic encryption-based training
0.412020
HomoPAI: A Secure Collaborative Machine Learning Platform based on Homomorphic Encryption · ICDE 2020
Privacy and data protection
privacy-preserving machine learning
0.412020
HomoPAI: A Secure Collaborative Machine Learning Platform based on Homomorphic Encryption · ICDE 2020
Systems and software security
operating system security
0.412019
Different is Good: Detecting the Use of Uninitialized Variables through Differential Replay · CCS 2019
Program analysis
dynamic analysis
0.412019
Different is Good: Detecting the Use of Uninitialized Variables through Differential Replay · CCS 2019
Parallel and multicore computing
MPI
0.212023
More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems · IEEE Trans. Dependable Secur. Comput. 2023
Privacy and data protection
privacy-preserving computation
0.112021
PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic Encryption · SP 2021
Cryptographic protocols and secure computation › secure inference
private decision tree evaluation
0.112021
PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic Encryption · SP 2021
Systems and software security › code randomization
kernel address space layout randomization
0.112019
Different is Good: Detecting the Use of Uninitialized Variables through Differential Replay · CCS 2019

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

homomorphic encryption · 2.4MPI · 2.0dynamic analysis · 0.8differential replay · 0.8look-up table evaluation · 0.5ciphertext packing · 0.5MPI parallelization · 0.4
YearPublicationVenuePosition
2023 More Efficient Secure Matrix Multiplication for Unbalanced Recommender Systems
abstract
With recent advances in homomorphic encryption (HE), it becomes feasible to run non-interactive machine learning (ML) algorithms on encrypted data without decryption. In this work, we propose novel encoding methods to pack matrix in a compact way and more efficient methods to perform matrix multiplication on homomorphically encrypted data, leading to a speed boost of$1.5\times - 20\times$for slim rectangular matrix multiplication compared with state-of-the-art. Moreover, we integrate our optimized secure matrix arithmetic with the MPI distributed computing framework, achieving scalable parallel secure matrix computation. Equipped with the optimized matrix multiplication, we proposeuSCORE, a privacy-preserving cross-domain recommendation system for the unbalanced scenario, where a big data owner provides recommendation as a service to a client who has less data and computation power. Our design delegates most of the computation to the service provider, and has a low communication cost, which previous works failed to achieve. For a client who has 16 million user-item pairs to update, it only needs about 3 minutes (in the LAN setting) to prepare the encrypted data. The server can finish the update process on the encrypted data in less than half an hour, effectively reducing the client's test error from 0.72 to 0.62.
Cheng Hong 0001, Chenkai Weng, Hunter Qu
IEEE Trans. Dependable Secur. Comput.5
2021 PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic Encryption
abstract
Homomorphic encryption (HE) is considered as one of the most important primitives for privacy-preserving applications. However, an efficient approach to evaluate both polynomial and non-polynomial functions on encrypted data is still absent, which hinders the deployment of HE to real-life applications. To address this issue, we propose a practical framework PEGASUS. PEGASUS can efficiently switch back and forth between a packed CKKS ciphertext and FHEW ciphertexts without decryption, allowing us to evaluate arithmetic functions efficiently on the CKKS side, and to evaluate look-up tables on FHEW ciphertexts. Our FHEW → CKKS conversion algorithm is more practical than the existing methods. We improve the computational complexity from linear to sublinear. Moreover, the size of our conversion key is significantly smaller, e.g., reduced from 80 gigabytes to 12 megabytes. We present extensive benchmarks of PEGASUS, including sigmoid/ReLU/min/max/division, sorting and max-pooling. To further demonstrate the capability of PEGASUS, we developed two more applications. The first one is a private decision tree evaluation whose communication cost is about two orders of magnitude smaller than the previous HE-based approaches. The second one is a secure K-means clustering that is able to run on thousands of encrypted samples in minutes that outperforms the best existing system by 14 × – 20×. To the best of our knowledge, this is the first work that supports practical K-means clustering using HE in a single server setting.
Cheng Hong 0001, Yiping Ma 0001, Hunter Qu
SP5
2020 HomoPAI: A Secure Collaborative Machine Learning Platform based on Homomorphic Encryption
abstract
Homomorphic Encryption (HE) allows encrypted data to be processed without decryption, which could maximize the protection of user privacy without affecting the data utility. Thanks to strides made by cryptographers in the past few years, the efficiency of HE has been drastically improved, and machine learning on homomorphically encrypted data has become possible. Several works have explored machine learning based on HE, but most of them are restricted to the outsourced scenario, where all the data comes from a single data owner. We propose HomoPAI, an HE-based secure collaborative machine learning system, enabling a more promising scenario, where data from multiple data owners could be securely processed. Moreover, we integrate our system with the popular MPI framework to achieve parallel HE computations. Experiments show that our system can train a logistic regression model on millions of homomorphically encrypted data in less than two minutes.
Cheng Hong 0001, Hunter Qu, Weizhe Zhang
ICDE5
2019 Different is Good: Detecting the Use of Uninitialized Variables through Differential Replay
abstract
The use of uninitialized variables is a common issue. It could cause kernel information leak, which defeats the widely deployed security defense, i.e., kernel address space layout randomization (KASLR). Though a recent system called Bochspwn Reloaded reported multiple memory leaks in Windows kernels, how to effectively detect this issue is still largely behind.
Mengchen Cao, Xiantong Hou, Hunter Qu, Yajin Zhou, Xiaolong Bai
CCS4