2013 6th International Conference on Information Management, Innovation Management and Industrial Engineering 2013
DOI: 10.1109/iciii.2013.6702947
|View full text |Cite
|
Sign up to set email alerts
|

Preserving users' privacy for continuous query services in road networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 6 publications
0
14
0
Order By: Relevance
“…Finally, the privacy model δp is calculated. If it is not satisfied, r i is expanded from all the sides until it is equal to δp and R i = r i (steps [27][28][29]. When all these conditions are achieved, AS-DTMC proceeds to issue the snapshot query to the LBSs with R i (step 30), otherwise, the snapshot will be suppressed and the cloaking engine will process the subsequent snapshots (steps 31-32).…”
Section: Algorithm Depictionmentioning
confidence: 98%
See 1 more Smart Citation
“…Finally, the privacy model δp is calculated. If it is not satisfied, r i is expanded from all the sides until it is equal to δp and R i = r i (steps [27][28][29]. When all these conditions are achieved, AS-DTMC proceeds to issue the snapshot query to the LBSs with R i (step 30), otherwise, the snapshot will be suppressed and the cloaking engine will process the subsequent snapshots (steps 31-32).…”
Section: Algorithm Depictionmentioning
confidence: 98%
“…However, the privacy metric employed in these previous studies is only the granularity of cloaked regions (without considering the location k-anonymity). Another related work is [29], which employed entropy of information theory to measure the location anonymity level by considering the probabilities of users being in a cloaked region. As entropy does not care whether user locations are actually different, the exact user location would be disclosed if all k users are at the same location.…”
Section: Maximum Movement Boundary Attackmentioning
confidence: 99%
“…As compared to the wired medium, ensuring security for the wireless medium is more challenging mainly due to the broadcast nature of the transmissions. Similar to wired communication, cryptographic schemes were adopted in wireless technology to ensure information security and they are still handy in several application scenarios [1][2][3][4][5]. But cryptographic schemes rely on the assumption that it is computationally challenging to calculate inverses of certain oneway functions within reasonable time limits using the currently available computing power.…”
Section: Introductionmentioning
confidence: 99%
“…The second strategy is about the identity issue; in addition to the encryption techniques mentioned before, other solutions exploit node locations [11][12][13][14], which help in determining the malicious nodes on the basis of their positions with respect to the normal ones. As an example, Verifiable Multilateration (VM) [12] uses localization in order to evaluate the reliability of the sensor nodes and identifying possible outliers.…”
Section: 1mentioning
confidence: 99%
“…As an example, Verifiable Multilateration (VM) [12] uses localization in order to evaluate the reliability of the sensor nodes and identifying possible outliers. Note that [13,14] are tailored to secure wireless communications of mobile devices, but the defined methods could be applied to WSN.…”
Section: 1mentioning
confidence: 99%