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

Xingqi Luo

dblp:76/10365 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-7763-9692ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 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
1 paper
Privacy and data protection · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving computation › privacy-preserving crowdsourcing
privacy-preserving task assignment
0.812024
POTA: Privacy-Preserving Online Multi-Task Assignment With Path Planning · IEEE Trans. Mob. Comput. 2024
Graph algorithms and graph theory › graph algorithms › network flow
minimum-cost flow
0.212024
POTA: Privacy-Preserving Online Multi-Task Assignment With Path Planning · IEEE Trans. Mob. Comput. 2024

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

cryptographic path planning · 1.5
YearPublicationVenuePosition
2024 POTA: Privacy-Preserving Online Multi-Task Assignment With Path Planning
abstract
Privacy-preserving online multi-task assignment is a crucial aspect of spatial crowdsensing on untrusted platforms, where multiple real-time tasks are allocated to appropriate workers in a privacy-preserving manner. While existing schemes ensure the privacy of tasks and users, they seldom focus on minimizing the total moving distances for crowdsensing workers when assigning multiple tasks in real time, which adversely impacts the efficiency of online multi-task assignments. To address this issue, we propose POTA, the first privacy-preserving online multi-task assignment scheme with path planning that minimizes the total moving distances for crowdsensing workers without additional noise. POTA cryptographically implements the extended minimum-cost flow model, which models the encrypted data of workers and tasks in a graph and later produces optimized routing. With such a secure path-planning component, POTA reduces the total moving distances by$25.19\%-52.78\%$in the tested dataset compared with the state-of-the-art schemes with obfuscated path planning. Security analysis proves that POTA guarantees the confidentiality of sensitive data, a stronger security property than introducing obfuscation to sensitive data. Experimental evaluations on real-world datasets demonstrate the feasibility of POTA in terms of running time and its ability to achieve minimized total moving distances.
Chuan Zhang 0003, Xingqi Luo, Jinwen Liang, Ximeng Liu, Liehuang Zhu, Song Guo 0001
IEEE Trans. Mob. Comput.2
2023 Enabling privacy-preserving multi-server collaborative search in smart healthcare
Chuan Zhang 0003, Xingqi Luo, Tong Wu 0011, Liehuang Zhu
Future Gener. Comput. Syst.2