WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Journal of Computer Science and Technology
  2. Journal of Computer Science and Technology : Volume 29
  3. Journal of Computer Science and Technology : Volume 29, Issue 6, November 2014
  4. Complete Bipartite Anonymity for Location Privacy
Loading...

Please wait, while we are loading the content...

Journal of Computer Science and Technology : Volume 32
Journal of Computer Science and Technology : Volume 31
Journal of Computer Science and Technology : Volume 30
Journal of Computer Science and Technology : Volume 29
Journal of Computer Science and Technology : Volume 29, Issue 6, November 2014
A General Low-Cost Indirect Branch Prediction Using Target Address Pointers
Retention Benefit Based Intelligent Cache Replacement
A Static Greedy and Dynamic Adaptive Thread Spawning Approach for Loop-Level Parallelism
An Intra-Server Interconnect Fabric for Heterogeneous Computing
Memory Efficient Two-Pass 3D FFT Algorithm for Intel® Xeon Phi$^{TM}$ Coprocessor
Improved Blocking Time Analysis and Evaluation for the Multiprocessor Priority Ceiling Protocol
Feature-Adaptive Rendering of Loop Subdivision Surfaces on Modern GPUs
A Two-Step Regularization Framework for Non-Local Means
A Holistic Approach for Efficient Contour Detection
Mammogram Enhancement Using Lifting Dyadic Wavelet Transform and Normalized Tsallis Entropy
Semisupervised Sparse Multilinear Discriminant Analysis
Merge-Weighted Dynamic Time Warping for Speech Recognition
CPL: Detecting Protein Complexes by Propagating Labels on Protein-Protein Interaction Network
Complete Bipartite Anonymity for Location Privacy
Automated Power Control for Virtualized Infrastructures
Improved Linear Attacks on the Chinese Block Cipher Standard
Improved Linear Cryptanalysis of CAST-256
Contents
Author Index
Journal of Computer Science and Technology : Volume 29, Issue 5, September 2014
Journal of Computer Science and Technology : Volume 29, Issue 4, July 2014
Journal of Computer Science and Technology : Volume 29, Issue 3, May 2014
Journal of Computer Science and Technology : Volume 29, Issue 2, March 2014
Journal of Computer Science and Technology : Volume 29, Issue 1, January 2014
Journal of Computer Science and Technology : Volume 28
Journal of Computer Science and Technology : Volume 27
Journal of Computer Science and Technology : Volume 26
Journal of Computer Science and Technology : Volume 25
Journal of Computer Science and Technology : Volume 24
Journal of Computer Science and Technology : Volume 23
Journal of Computer Science and Technology : Volume 22
Journal of Computer Science and Technology : Volume 21
Journal of Computer Science and Technology : Volume 20
Journal of Computer Science and Technology : Volume 19
Journal of Computer Science and Technology : Volume 18
Journal of Computer Science and Technology : Volume 17
Journal of Computer Science and Technology : Volume 16
Journal of Computer Science and Technology : Volume 15
Journal of Computer Science and Technology : Volume 14
Journal of Computer Science and Technology : Volume 13
Journal of Computer Science and Technology : Volume 12

Similar Documents

...
Complete Bipartite Anonymity: Confusing Anonymous Mobility Traces for Location Privacy

Article

...
HilAnchor: Location Privacy Protection in the Presence of Users’ Preferences

Article

...
K-Nearest Neighbor Query Processing Algorithms for a Query Region in Road Networks

Article

...
Privacy Petri Net and Privacy Leak Software

Article

...
Threshold-Based Shortest Path Query over Large Correlated Uncertain Graphs

Article

...
Detecting Communities in K-Partite K-Uniform (Hyper)Networks

Article

...
Bipartite-Oriented Distributed Graph Partitioning for Big Learning

Article

...
Continuous Probabilistic Subspace Skyline Query Processing Using Grid Projections

Article

...
Search Result Diversification Based on Query Facets

Article

Complete Bipartite Anonymity for Location Privacy

Content Provider Springer Nature Link
Author Dong, Kai Gu, Tao Tao, Xian Ping Lv, Jian
Copyright Year 2014
Abstract Users are vulnerable to privacy risks when providing their location information to location-based services (LBS). Existing work sacrifices the quality of LBS by degrading spatial and temporal accuracy for ensuring user privacy. In this paper, we propose a novel approach, Complete Bipartite Anonymity (CBA), aiming to achieve both user privacy and quality of service. The theoretical basis of CBA is that: if the bipartite graph of k nearby users’ paths can be transformed into a complete bipartite graph, then these users achieve k-anonymity since the set of “end points connecting to a specific start point in a graph” is an equivalence class. To achieve CBA, we design a Collaborative Path Confusion (CPC) protocol which enables nearby users to discover and authenticate each other without knowing their real identities or accurate locations, predict the encounter location using users’ moving pattern information, and generate fake traces obfuscating the real ones. We evaluate CBA using a real-world dataset, and compare its privacy performance with existing path confusion approach. The results show that CBA enhances location privacy by increasing the chance for a user confusing his/her path with others by 4 to 16 times in low user density areas. We also demonstrate that CBA is secure under the trace identification attack.
Starting Page 1094
Ending Page 1110
Page Count 17
File Format PDF
ISSN 10009000
Journal Journal of Computer Science and Technology
Volume Number 29
Issue Number 6
e-ISSN 18604749
Language English
Publisher Springer US
Publisher Date 2014-11-17
Publisher Place Boston
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword location privacy k-anonymity path confusion query obfuscation complete bipartite anonymity Computer Science Software Engineering Theory of Computation Data Structures, Cryptology and Information Theory Artificial Intelligence (incl. Robotics) Information Systems Applications (incl. Internet)
Content Type Text
Resource Type Article
Subject Theoretical Computer Science Computational Theory and Mathematics Computer Science Applications Software Hardware and Architecture
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...