Protecting Privacy of Location-Based Services in Road Networks

Tan, Zheng; Wang, Cheng; Yan, Chungang; Zhou, MengChu; Jiang, Changjun

doi:10.1109/tits.2020.2992232

Cited by 22 publications

(8 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Method Application [23], [29] Privacy Labels Data privacy [1], [33] Blockchain methods GDPR compliance [83], [84] Virtual Trip Lines Anonymous data collection [96] Private Info. Retrieval Anonymous data retrieval [97]- [99] Differential Privacy Anonymous data retrieval…”

Section: Papermentioning

confidence: 99%

See 1 more Smart Citation

Privacy and Trust in the Internet of Vehicles

Zavvos

Gerding

Yazdanpanah

et al. 2022

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

The Internet of Vehicles aims to fundamentally improve transportation by connecting vehicles, drivers, passengers, and service providers together. Several new services such as parking space identification, platooning and intersection control-to name just a few-are expected to improve traffic congestion, reduce pollution, and improve the efficiency, safety and logistics of transportation. Proposed end-user services, however, make extensive use of private information with little consideration for the impact on users and third parties (those individuals whose information is indirectly involved). This article provides the first comprehensive overview of privacy and trust issues in the Internet of Vehicles at the service level. Various concerns over privacy are formalised into four basic categories: privacy of personal information, trust, consent to provide information, and multi-party privacy. To help analyse services and to facilitate future research, the main relevant end-user services are taxonomised according to voluntary and involuntary information they require and produce. Finally, this work identifies several open research problems and highlights general approaches to address them. These especially relate to measuring the tradeoff between privacy and service functionality, automated consent negotiation, trust towards the IoV and its individual services, and identifying and resolving multi-party privacy conflicts.

show abstract

Section: Papermentioning

confidence: 99%

“…Privacy-by-design can be further employed per individual service, as in [84] who employed VTLs to collect anonymous traffic data. Similarly, [96] attempt to protect privacy in location-based services i.e. services which answer users' queries to points of interest using Private Information Retrieval.…”

Section: Papermentioning

confidence: 99%

Privacy and Trust in the Internet of Vehicles

Zavvos

Gerding

Yazdanpanah

et al. 2022

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

show abstract

“…We adopt the following notation in this section: p 2 = q > 2, and p are prime numbers, and m = 2q (later we split this case into subcases p = 2 and p > 2). Our starting point is the block matrix A = A 2 ; A 1 ; A 3 over Z p , where A 1 and A 2 are described in (9), and A 3 in ( 23) and (24).…”

Section: Elimination Steps In Type-3 Matrixmentioning

confidence: 99%

“…A main challenge in constructing PIR protocols is minimizing the communication complexity. The idea of PIR was introduced by Chor et al [1], together with the 2-server PIR protocol having the communication complexity O(n 1/3 ) for the dataset size n. PIR has a wide variety of applications such as anonymous communication [2,3], privacy-preserving media streaming [4], blockchain security [5,6], personalized advertisement [7], location and contact discovery [8][9][10], etc.…”

Section: Introduction 1private Information Retrievalmentioning

confidence: 99%

New Bounds and a Generalization for Share Conversion for 3-Server PIR

Paskin-Cherniavsky

Nissenbaum

2022

Entropy

View full text Add to dashboard Cite

Private Information Retrieval (PIR) protocols, which allow the client to obtain data from servers without revealing its request, have many applications such as anonymous communication, media streaming, blockchain security, advertisement, etc. Multi-server PIR protocols, where the database is replicated among the non-colluding servers, provide high efficiency in the information-theoretic setting. Beimel et al. in CCC 12’ (further referred to as BIKO) put forward a paradigm for constructing multi-server PIR, capturing several previous constructions for k≥3 servers, as well as improving the best-known share complexity for 3-server PIR. A key component there is a share conversion scheme from corresponding linear three-party secret sharing schemes with respect to a certain type of “modified universal” relation. In a useful particular instantiation of the paradigm, they used a share conversion from (2,3)-CNF over Zm to three-additive sharing over Zpβ for primes p1,p2,p where p1≠p2 and m=p1·p2, and the relation is modified universal relation CSm. They reduced the question of the existence of the share conversion for a triple (p1,p2,p) to the (in)solvability of a certain linear system over Zp, and provided an efficient (in m,logp) construction of such a sharing scheme. Unfortunately, the size of the system is Θ(m2) which entails the infeasibility of a direct solution for big m’s in practice. Paskin–Cherniavsky and Schmerler in 2019 proved the existence of the conversion for the case of odd p1, p2 when p=p1, obtaining in this way infinitely many parameters for which the conversion exists, but also for infinitely many of them it remained open. In this work, using some algebraic techniques from the work of Paskin–Cherniavsky and Schmerler, we prove the existence of the conversion for even m’s in case p=2 (we computed β in this case) and the absence of the conversion for even m’s in case p>2. This does not improve the concrete efficiency of 3-server PIR; however, our result is promising in a broader context of constructing PIR through composition techniques with k≥3 servers, using the relation CSm where m has more than two prime divisors. Another our suggestion about 3-server PIR is that it’s possible to achieve a shorter server’s response using the relation CSm′ for extended Sm′⊃Sm. By computer search, in BIKO framework we found several such sets for small m’s which result in share conversion from (2,3)-CNF over Zm to 3-additive secret sharing over Zpβ′, where β′>0 is several times less than β, which implies several times shorter server’s response. We also suggest that such extended sets Sm′ can result in better PIR due to the potential existence of matching vector families with the higher Vapnik-Chervonenkis dimension.

show abstract

“…In order to protect the location privacy of users in LBS, various location privacy preservation technologies have been proposed. These technologies can be classified into three categories, i.e., Private Information Retrieval (PIR) [2], location generalization [3], and location perturbation [4]. PIR is based on cryptography and can provide provable privacy preservation.…”

Section: Introductionmentioning

confidence: 99%

Differentially Private Location Preservation with Staircase Mechanism Under Temporal Correlations

Fang

Han

Juan

et al. 2021

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Location-Based Service (LBS) is one of basic services in collaborative applications. However, LBS applications may disclose user's location privacy, which receives considerable concerns. Many methods have been proposed to protect privacy in LBS. Planar Isotropic Mechanism (PIM) is a typical location privacy preservation method in the scenario of continuous location data release. However, the method is complicated, since it requires two convex hull transformations and one isotropic position transform. To solve the problem, we propose a Staircase Mechanism (SM) based location privacy preservation method for the scenario of continuous location data release. The proposed method replaces PIM with SM, whose implementation is simple and efficient. Furthermore, SM can achieve the same privacy budget with less noise addition, so it can maintain higher quality of services in LBS. Comprehensive experiments conducted on real location data demonstrate that the proposed method is efficient and can maintain high data utility compared with the method based on PIM.

show abstract

Protecting Privacy of Location-Based Services in Road Networks

Cited by 22 publications

References 50 publications

Privacy and Trust in the Internet of Vehicles

Privacy and Trust in the Internet of Vehicles

New Bounds and a Generalization for Share Conversion for 3-Server PIR

Differentially Private Location Preservation with Staircase Mechanism Under Temporal Correlations

Contact Info

Product

Resources

About