Filters








18,437 Hits in 4.5 sec

Maintaining K-Anonymity against Incremental Updates

Jian Pei, Jian Xu, Zhibin Wang, Wei Wang, Ke Wang
2007 International Conference on Scientific and Statistical Database Management  
In this paper, we investigate the problem of maintaining k-anonymity against incremental updates, and propose a simple yet effective solution.  ...  We analyze how inferences from multiple releases may temper the k-anonymity of data, and propose the monotonic incremental anonymization property.  ...  Maintaining k-anonymity against various types of incremental updates is an important and practical problem.  ... 
doi:10.1109/ssdbm.2007.16 dblp:conf/ssdbm/PeiXWWW07 fatcat:eco7vhhbrbavpak37lm3ksgqyi

K-anonymization incremental maintenance and optimization techniques

Traian Marius Truta, Alina Campan
2007 Proceedings of the 2007 ACM symposium on Applied computing - SAC '07  
We propose in this paper an incremental updating technique for the maintenance of k-anonymized versions of large evolving datasets.  ...  In this paper, we introduce algorithms for the maintenance of k-anonymized versions of large evolving datasets. These algorithms incrementally manage insert/delete/update dataset modifications.  ...  We evaluate the performance of our method by comparing the results it produces against the results provided by the static (non-incremental) k-anonymization method presented in [3] .  ... 
doi:10.1145/1244002.1244093 dblp:conf/sac/TrutaC07 fatcat:z653cr7lyfbnrd24g5j4ukobqm

Differentially Private Set-Valued Data Release against Incremental Updates [chapter]

Xiaojian Zhang, Xiaofeng Meng, Rui Chen
2013 Lecture Notes in Computer Science  
., k-anonymity), differential privacy provides strong privacy guarantees against adversaries with arbitrary background knowledge.  ...  Extensive experiments on real datasets confirm that our approach maintains high utility and scalability for counting query.  ...  To tackle the above challenges, we investigate the problem of how to publish set-valued data against incremental updates while maintaining ε-differential privacy.  ... 
doi:10.1007/978-3-642-37487-6_30 fatcat:j5l4x4jndbegnoene2fzoorn4y

Suppression and Generalization – Based Privacy Preserving Updates to Confidential Databases

I. Kavitha I. Kavitha
2013 IOSR Journal of Computer Engineering  
So the data sharing is common in order to provide the data remain k-anonymous even after the updates.  ...  The properties are anonymous authentication, privacy preservation, confidential access, anonymity maintenance, data management, secure computation, data integrity and also access control.  ...  And also the attacks are introduced against the anonymization of incremental data.  ... 
doi:10.9790/0661-01015154 fatcat:ixqfwsvcpfbtrlrgbkpahdxoem

Protecting location privacy against location-dependent attack in mobile services

Xiao Pan, Jianliang Xu, Xiaofeng Meng
2008 Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08  
The main idea is to incrementally maintain maximal cliques for location cloaking in an un-directed graph that takes into consideration the effect of continuous location updates.  ...  In this paper, we present location-dependent attack resulting from continuous and dependent location updates and propose an incremental clique-based cloaking algorithm, called ICliqueCloak, to defend against  ...  Then we add the edges to the graph one by one and incrementally update the set of maximal cliques.  ... 
doi:10.1145/1458082.1458341 dblp:conf/cikm/PanXM08 fatcat:jewtn3baazda3avpgt6f73eoze

Protecting Location Privacy against Location-Dependent Attacks in Mobile Services

Xiao Pan, Jianliang Xu, Xiaofeng Meng
2012 IEEE Transactions on Knowledge and Data Engineering  
Therefore, adopting both the location k-anonymity and cloaking granularity as privacy metrics, we propose a new incremental clique-based cloaking algorithm, called ICliqueCloak, to defend against location-dependent  ...  The main idea is to incrementally maintain maximal cliques needed for location cloaking in an undirected graph that takes into consideration the effect of continuous location updates.  ...  To reduce the computational complexity, we propose to maintain the maximal cliques incrementally.  ... 
doi:10.1109/tkde.2011.105 fatcat:4uzmkuxrsnhx3bo5d24zfirvui

Secure, Anonymity-Preserving and Lightweight Mutual Authentication and Key Agreement Protocol for Home Automation IoT Networks [article]

Akash Gupta, Gaurav S. Kasbekar
2021 arXiv   pre-print
The scheme achieves confidentiality, message integrity, anonymity, unlinkability, forward and backward secrecy, and availability.  ...  We show using a detailed security analysis and numerical results that our proposed scheme provides better security and anonymity, and is more efficient in terms of computation time, communication cost,  ...  It then extracts and stores T K 12 and DDC 12 in its database. It also increments the counter CC 1 by 1 and updates the values M I 1 C and M I C 1 in its database.  ... 
arXiv:2105.09687v2 fatcat:ldklimz7pjcm7e276oodhgo4iu

K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization

Tochukwu Iwuchukwu, David J. DeWitt, AnHai Doan, Jeffrey F. Naughton
2007 2007 IEEE 23rd International Conference on Data Engineering  
the advantage of supporting incremental updates.  ...  In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing techniques can be used to  ...  Incremental Utility In a dynamic environment, the spatial index is a natural mechanism for allowing changes to be made on a data set while maintaining a k-anonymous view.  ... 
doi:10.1109/icde.2007.369024 dblp:conf/icde/IwuchukwuDDN07 fatcat:semsw5i2gfhvnjanzp66bl7syi

Online Learning of a Probabilistic and Adaptive Scene Representation [article]

Zike Yan, Xin Wang, Hongbin Zha
2021 arXiv   pre-print
An incremental and parallel inference is performed to update the parameter space in real-time.  ...  Constructing and maintaining a consistent scene model on-the-fly is the core task for online spatial perception, interpretation, and action.  ...  The objectiveness is then to maintain and update a parameter space θ t k ∈ Θ t incrementally as the measurement of the spatial distribution.  ... 
arXiv:2103.16832v1 fatcat:qx3ncxz7rnhqbidvxqqvoqswoq

Nymble: Blocking Misbehaving Users in Anonymizing Networks

Patrick P. Tsang, Apu Kapadia, Cory Cornelius, Sean W. Smith
2011 IEEE Transactions on Dependable and Secure Computing  
Our system is thus agnostic to different servers' definitions of misbehavior -servers can blacklist users for whatever reason, and the privacy of blacklisted users is maintained.  ...  As a result, administrators block all known exit nodes of anonymizing networks, denying anonymous access to misbehaving and behaving users alike.  ...  Otherwise S indexes the newly issued credential as k := I C , updates U C := U C ∪ {(k, ⊥, sid )}, increments I C , and returns k. • The Connection Establishment Oracle, O CE , allows the adversary to  ... 
doi:10.1109/tdsc.2009.38 fatcat:kjhpaoz3gjhljboafvcm6jlu7e

Privacy Preservation in Sequential Published Social Networks Against Mutual Friend Attack

Jyothi Vadisala, Valli Kumari Vatsavayi
2018 International Journal of Engineering & Technology  
The kw-Number of Mutual Friend Anonymization model is proposed to anonymize each sequential published network.  ...  In this privacy model, k indicates the privacy level and w is the time interval taken by the adversary to acquire the knowledge of the victim.  ...  and incrementally updated.Fig 2 shows the pseudo code for incrementally updating of the GS-Table.  ... 
doi:10.14419/ijet.v7i4.17424 fatcat:c24l4ktw4zdwbabwv7ihp6o224

On the Formation of Historically k-Anonymous Anonymity Sets in a Continuous LBS [chapter]

Rinku Dewri, Indrakshi Ray, Indrajit Ray, Darrell Whitley
2010 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
The historical k-anonymity property is therefore enforced to ensure that all cloaking regions include at least k objects in common.  ...  To this effect, this paper presents an algorithm to efficiently enforce historical k-anonymity by partitioning of an object's cloaking region.  ...  Besides, the provider needs to be able to distinguish updates from the same object in order to maintain service quality [3] .  ... 
doi:10.1007/978-3-642-16161-2_5 fatcat:ewshyx47ebd77eu2t25ryl5mzu

Improved privacy preserving method for periodical SRS publishing

Wei Huang, Tong Yi, Haibin Zhu, Wenqian Shang, Weiguo Lin
2021 PLoS ONE  
Theoretical analysis indicates that PPMS(k, θ, ɑ)-bounding can thwart the above-mentioned attacks.  ...  To remedy this problem, an improved periodical SRS data publishing-PPMS(k, θ, ɑ)-bounding is proposed.  ...  They presented a privacy preserving approach, called Monotonic Incremental Anonymization, to guarantee the k-anonymity on each release.  ... 
doi:10.1371/journal.pone.0250457 pmid:33886662 pmcid:PMC8691852 fatcat:usw3bnczaff4bcpoc7w3ggyeyu

Privacy-preserving incremental data dissemination

Ji-Won Byun, Tiancheng Li, Elisa Bertino, Ninghui Li, Yonglak Sohn
2009 Journal of Computer Security  
Although the k-anonymity and -diversity models have led to a number of valuable privacy-protecting techniques and algorithms, the existing solutions are currently limited to static data release.  ...  In this paper, we consider incremental data dissemination, where a dataset is continuously incremented with new data.  ...  Conclusions In this paper, we discussed inference attacks against the anonymization of incremental data.  ... 
doi:10.3233/jcs-2009-0316 fatcat:tn7iwmozk5b2hhou5pz5yrktjq

Incremental $k$ -Anonymous Microaggregation in Large-Scale Electronic Surveys With Optimized Scheduling

David Rebollo-Monedero, Cesar Hernandez-Baigorri, Jordi Forne, Miguel Soriano
2018 IEEE Access  
This has stimulated the need for anonymization techniques striving to attain a difficult compromise between the usefulness of the data and the protection of our privacy. k-Anonymous microaggregation permits  ...  INDEX TERMS data privacy, statistical disclosure control, k-anonymity, microaggregation, electronic surveys, large-scale datasets  ...  ACKNOWLEDGMENT The authors gratefully acknowledge the patient, thorough suggestions of the anonymous reviewers, which greatly assisted in improving the readability and contents of this document.  ... 
doi:10.1109/access.2018.2875949 fatcat:gab7xhvd4jbbvef4oaekiligoq
« Previous Showing results 1 — 15 out of 18,437 results