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

Qingxiu Liu

dblp:260/5556 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0002-6994-4558ORCID · corroborated

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

Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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
Privacy and data protection · 50% Cryptographic protocols and secure computation · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
privacy-preserving computation
0.812024
PP-Stream: Toward High-Performance Privacy-Preserving Neural Network Inference via Distributed Stream Processing · ICDE 2024
Cryptographic protocols and secure computation › secure inference
secure neural network inference
0.812024
PP-Stream: Toward High-Performance Privacy-Preserving Neural Network Inference via Distributed Stream Processing · ICDE 2024
Distributed systems › stream processing
distributed stream processing
0.812024
PP-Stream: Toward High-Performance Privacy-Preserving Neural Network Inference via Distributed Stream Processing · ICDE 2024

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

secure multiparty computation · 1.5load balancing · 1.5additive secret sharing · 1.5
YearPublicationVenuePosition
2024 PP-Stream: Toward High-Performance Privacy-Preserving Neural Network Inference via Distributed Stream Processing
abstract
Privacy preservation is critical for neural network inference, which often involves collaborative execution of different parties to make predictions on sensitive data based on sensitive neural network models. However, the expensive cryptographic operations of privacy preservation also pose performance chal-lenges to neural network inference. We address this performance-security tension by designing PP-Stream, a distributed stream processing system for high-performance privacy-preserving neural network inference. PP-Stream adopts hybrid privacy-preserving mechanisms for linear and non-linear operations of neural network inference. It treats inference data as real-time data streams, and parallelizes the inference operations across multiple pipelined stages that are executed by multiple servers and threads. It also solves the load-balanced resource allocation across servers and threads as an optimization problem. We prototype PP-Stream and show via testbed experiments that it achieves low inference latencies on various neural network models.
Qingxiu Liu, Qun Huang 0001, Xiang Chen 0017, Sa Wang, Shujie Han 0001, Patrick P. C. Lee
ICDE1
2020 T2DNS: A Third-Party DNS Service with Privacy Preservation and Trustworthiness
abstract
We design a third-party DNS service named T2DNS. T2DNS serves client DNS queries with the following features: protecting clients from channel and server attackers, providing trustworthiness proof to clients, being compatible with the existing Internet infrastructure, and introducing bounded overhead. T2DNS’s privacy preservation is achieved by a hybrid protocol of encryption and obfuscation, and its service proxy is implemented on Intel SGX. We overcome the challenges of scaling the initialization process, bounding the obfuscation overhead, and tuning practical system parameters. We prototype T2DNS, and experiment results show that T2DNS is fully functional, has acceptable overhead in comparison with other solutions, and is scalable to the number of clients.
Qingxiu Liu, Wenfei Wu, Qun Huang 0001
ICCCN1