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

Zarrin Montazeri

dblp:179/3448 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0001-8160-9616ORCID · reported

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

Security and privacy · 2 · 2 first-authorTheory of computation · 1 · 1 first-author

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%
Computer networks
1 paper
Wireless sensing and localization · 50% Cellular and mobile networks · 50%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
anonymization
0.312017
Achieving Perfect Location Privacy in Wireless Devices Using Anonymization · IEEE Trans. Inf. Forensics Secur. 2017
Privacy and data protection
location privacy
0.312017
Achieving Perfect Location Privacy in Wireless Devices Using Anonymization · IEEE Trans. Inf. Forensics Secur. 2017
Wireless sensing and localization
location-based services
0.112017
Achieving Perfect Location Privacy in Wireless Devices Using Anonymization · IEEE Trans. Inf. Forensics Secur. 2017
Cellular and mobile networks › mobility management › user mobility
user mobility modeling
0.112017
Achieving Perfect Location Privacy in Wireless Devices Using Anonymization · IEEE Trans. Inf. Forensics Secur. 2017

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

markov chain modeling · 0.6information-theoretic privacy metric · 0.6
YearPublicationVenuePosition
2017 Achieving Perfect Location Privacy in Wireless Devices Using Anonymization
abstract
The popularity of mobile devices and location-based services (LBSs) has raised significant concerns regarding the location privacy of their users. A popular approach to protect location privacy is anonymizing the users of LBS systems. In this paper, we introduce an information-theoretic notion for location privacy, which we call perfect location privacy. We then demonstrate how anonymization should be used by LBS systems to achieve the defined perfect location privacy. We study perfect location privacy under two models for user movements. First, we assume that a user's current location is independent from her past locations. Using this independent identically distributed (i.i.d.) model, we show that if the pseudonym of the user is changed before O(n2/r-1 ) observations are made by the adversary for that user, then the user has perfect location privacy. Here, n is the number of the users in the network and r is the number of all possible locations. Next, we model users' movements using Markov chains to better model real-world movement patterns. We show that perfect location privacy is achievable for a user if the user's pseudonym is changed before O(n 2/IEI-r observations are collected by the adversary for that user, where IEI is the number of edges in the user's Markov chain model.
Zarrin Montazeri, Amir Houmansadr, Hossein Pishro-Nik
IEEE Trans. Inf. Forensics Secur.1
2016 Achieving perfect location privacy in Markov models using anonymization
Zarrin Montazeri, Amir Houmansadr, Hossein Pishro-Nik
ISITA1