2017
DOI: 10.1016/j.future.2016.08.023
|View full text |Cite
|
Sign up to set email alerts
|

L2P2: A location-label based approach for privacy preserving in LBS

Abstract: Abstract:The developments in positioning and mobile communication technology have made the location-based service (LBS) applications more and more popular. For privacy reasons and due to lack of trust in the LBS providers, k-anonymity and l-diversity techniques have been widely used to preserve privacy of users in distributed LBS architectures in Internet of Things (IoT). However, in reality, there are scenarios where the locations of users are identical or similar/near each other in IoT. In such scenarios the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
57
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 79 publications
(58 citation statements)
references
References 30 publications
0
57
0
1
Order By: Relevance
“…Since the element bit length in Z p is less than that in G, the size of access policy update query in our system is less than that in [31,32,33]. (2) The sizes of keyword index in schemes [34,35] are (2l 1 + 2|S| + 1)|G| and (l 1 + 2|S| + 2)|G|, respectively. That in in our system is (l 1 )|Z p | + |G|, which is less that the other schemes [34,35].…”
Section: Communication Overhead Comparisonmentioning
confidence: 94%
See 2 more Smart Citations
“…Since the element bit length in Z p is less than that in G, the size of access policy update query in our system is less than that in [31,32,33]. (2) The sizes of keyword index in schemes [34,35] are (2l 1 + 2|S| + 1)|G| and (l 1 + 2|S| + 2)|G|, respectively. That in in our system is (l 1 )|Z p | + |G|, which is less that the other schemes [34,35].…”
Section: Communication Overhead Comparisonmentioning
confidence: 94%
“…Table 10 shows the computation cost for keyword index generation and keyword match test. (1) The schemes in [34,35] require e 1 and (2l 2 )e p to generate encrypted keyword index, while the computation cost of that in our system is one exponentiation operation in group G. (2) In the keyword match test phase, our system consumes one exponentiation operation in group G T , which is much smaller than the computation costs in other schemes [34,35].…”
Section: Communication Overhead Comparisonmentioning
confidence: 96%
See 1 more Smart Citation
“…So forth, a very high primacy for the sake of channel access would be given to the apps that might deliver these type of messages in order to ensure effective road security measures . Additionally, warning messages, real‐time traffic danger information that might be revealed inside maps and navigation system and disseminated by the RSU, might also be very important in order to provide prompt substitute for driving journeys . We can define road network as a type of mobile adhoc network that might present a plenty of services that might not only associated with road safety but also very helpful for infotainment services.…”
Section: System Model and Threatmentioning
confidence: 99%
“…2 Additionally, warning messages, real-time traffic danger information that might be revealed inside maps and navigation system and disseminated by the RSU, might also be very important in order to provide prompt substitute for driving journeys. 22 We can define road network as a type of mobile adhoc network that might present a plenty of services that might not only associated with road safety but also very helpful for infotainment services. Moreover, RSU can play a key role for the drivers by disseminating traffic information, climatological, and geographical data.…”
Section: • Qos For Safety Applicationsmentioning
confidence: 99%