Privacy preserving vertical federated learning for tree-based models
Federated learning (FL) is an emerging paradigm that enables multiple organizations to
jointly train a model without revealing their private data to each other. This paper studies {\it …
jointly train a model without revealing their private data to each other. This paper studies {\it …
PGRide: Privacy-preserving group ridesharing matching in online ride hailing services
An online ride hailing (ORH) service creates a typical supply-and-demand two-sided market,
which enables riders and drivers to establish optimized rides conveniently via mobile …
which enables riders and drivers to establish optimized rides conveniently via mobile …
Atlas: Gan-based differentially private multi-party data sharing
In this article, we study the problem of differentially private multi-party data sharing, where
the involved parties assisted by a semi-honest curator collectively generate a shared dataset …
the involved parties assisted by a semi-honest curator collectively generate a shared dataset …
PPAQ: Privacy-preserving aggregate queries for optimal location selection in road networks
Aggregate nearest neighbor (ANN) query, which can find an optimal location with the
smallest aggregate distance to a group of query users' locations, has received considerable …
smallest aggregate distance to a group of query users' locations, has received considerable …
DP-FedEwc: Differentially private federated elastic weight consolidation for model personalization
Federated learning (FL) has become a prevalent paradigm for training a model
collaboratively on multiple clients with the coordination of a central server. As traditional FL …
collaboratively on multiple clients with the coordination of a central server. As traditional FL …
EPGQ: Efficient and private feature-based group nearest neighbor query over road networks
The rapidly growing location-based services enable service providers to accumulate
plentiful descriptions on points of interest (POIs), which can be used to support expressive …
plentiful descriptions on points of interest (POIs), which can be used to support expressive …
Multi-Source Shortest Path Query With Assembly Points on Large Graphs
Computing Multi-source Shortest Path query with Assembly points () is a fundamental graph
problem. The problem locates a set of assembly points to minimize the overall distance for …
problem. The problem locates a set of assembly points to minimize the overall distance for …
Achieving private and fair truth discovery in crowdsourcing systems
Nowadays, crowdsourcing has witnessed increasing popularity as it can be adopted to solve
many challenging question‐answering tasks. One of the most significant problems in …
many challenging question‐answering tasks. One of the most significant problems in …
Secure and Practical Group Nearest Neighbor Query for Location‐Based Services in Cloud Computing
J Guo, J Sun - Security and Communication Networks, 2021 - Wiley Online Library
Group nearest neighbor (GNN) query enables a group of location‐based service (LBS)
users to retrieve a point from point of interests (POIs) with the minimum aggregate distance …
users to retrieve a point from point of interests (POIs) with the minimum aggregate distance …
IRDP Ride System: A Privacy Preservation System for Online Ride-Hailing
L Zhang, S Lin, C Wang, J Li, Y Liu… - IEEE Internet of Things …, 2022 - ieeexplore.ieee.org
Online ride-hailing and navigation (ORHN) is a significant application in location-based
services (LBSs). With this application, users can get convenient services in daily travel …
services (LBSs). With this application, users can get convenient services in daily travel …