Spatiotemporal Mobility Based Trajectory Privacy-Preserving Algorithm in Location-Based Services
Sensors, 2021 Recent years have seen the wide application of Location-Based Services (LBSs) in our daily life. Although users can enjoy many conveniences from the LBSs, they may lose their trajectory privacy when their location data are collected.
Zhiping Xu +4 more
doaj +1 more source
Towards trajectory anonymization: a generalization-based approach [PDF]
, 2009 Trajectory datasets are becoming popular due to the massive usage of GPS and locationbased services. In this paper, we address privacy issues regarding the identification of individuals in static trajectory datasets.
Atzori, Maurizio +5 more
core +2 more sources
The K-Anonymization Method Satisfying Personalized Privacy Preservation
Chemical Engineering Transactions, 2015 Even if k-anonymity model can prevent publishing data from disclosing privacy effectively and efficiently, due to the uneven distribution of the sensitive data, ordinary k-anonymization method cannot guarantee each tuple satisfying the personalized ...
J.L. Song +4 more
doaj +1 more source
(α, k)-anonymous data publishing [PDF]
Journal of Intelligent Information Systems, 2009 Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the association of individuals to sensitive information.
Raymond Wong +3 more
openaire +2 more sources
Location Anonymization With Considering Errors and Existence Probability [PDF]
, 2017 Mobile devices that can sense their location using GPS or Wi-Fi have become extremely popular. However, many users hesitate to provide their accurate location information to unreliable third parties if it means that their identities or sensitive ...
Akihiko Ohsuga, Yuichi Sei
core +2 more sources
PTA: An Efficient System for Transaction Database Anonymization
IEEE Access, 2016 Several approaches have been proposed to anonymize relational databases using the criterion of k-anonymity, to avoid the disclosure of sensitive information by re-identification attacks.
Jerry Chun-Wei Lin +3 more
doaj +1 more source
Energy efficient privacy preserved data gathering in wireless sensor networks having multiple sinks [PDF]
, 2009 Wireless sensor networks (WSNs) generally have a many-to-one structure so that event information flows from sensors to a unique sink. In recent WSN applications, many-tomany structures are evolved due to need for conveying collected event information to ...
Bahsi, Hayretdin +2 more
core +1 more source
Attribute Couplet Attacks and Privacy Preservation in Social Networks
IEEE Access, 2017 The emerging of social networks, e.g., Facebook, Twitter, and Instagram, has eventually changed the way in which we live. Social networks are acquiring and storing a significant amount of profile information and daily activities of over billions of ...
Dan Yin, Yiran Shen, Chenyang Liu
doaj +1 more source
Development and Analysis of Deterministic Privacy-Preserving Policies Using Non-Stochastic Information Theory [PDF]
, 2019 A deterministic privacy metric using non-stochastic information theory is developed. Particularly, minimax information is used to construct a measure of information leakage, which is inversely proportional to the measure of privacy.
Farokhi, Farhad
core +2 more sources
Reidentification and k-anonymity: A model for disclosure risk in graphs [PDF]
, 2016 In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modeling the anonymity of a database table and we prove that n-confusion is a generalization of k-anonymity. After a short survey on the
Stokes, Klara, Torra, Vicenç
core +1 more source