Recent advances in mobile communication and development of sophisticated equipments lead to the wide spread use of Location Based Services (LBS). A major concern for large-scale deployment of LBSs is the potential abuse of their client location data, which may imply sensitive personal information. Protecting location information of the mobile user is challenging because a location itself may reveal user identity. Several schemes have been proposed for location cloaking. In our paper, we propose a generic Enhanced Location Privacy Model (LPM), which describes the concept, the architecture, algorithms and the functionalities for location privacy in LBS. As per the architecture, the system ensures location privacy, without trusting anybody including the peers or LBS servers. The system is fully distributed and evaluation shows its efficiency and high level of privacy with QoS
PERTURBED ANONYMIZATION: TWO LEVEL SMART PRIVACY FOR LBS MOBILE USERS cscpconf
The use of smart mobile devices like tablets, smart phones and navigational gadgets provide
most promising communication and better services to mobile users. Location Based Services
(LBS) have become very common in recent years. Mobile users submit their location dependent
queries to the untrusted LBS server to acquire a particular service. Ideally, user’s personal
information such as location data is supposed to be protected while communicating to LBS and
at the same time quality of service must be maintained. Therefore, there is a need to have a
balanced trade-off between privacy and quality of service. To fulfil such trade-off, this paper
proposes a solution that first forms the cloaking region at mobile device, perform perturbation
to handle the problem of trusted third party and the anonymizer further anonymizes the location
to remove the problem of enough users required to form the cloaking region. The proposed
approach protects the location privacy of the user and also maintains the quality of service by
selecting appropriate service to the particular user. The proposed algorithm provides two-level
location protection to the user, and thus ensures smart mobility of the LBS user.
USER-DEFINED PRIVACY GRID SYSTEM FOR CONTINUOUS LOCATION-BASED SERVICESnexgentechnology
This document proposes a user-defined privacy grid system called Dynamic Grid System (DGS) to provide privacy-preserving location-based services. DGS uses a semi-trusted third party called a query server to process user requests while preserving the privacy of user locations. It divides query processing between the query server and service provider. Experimental results show DGS is more efficient than existing techniques requiring a fully-trusted third party, providing better privacy guarantees with lower communication and computation costs.
Location based spatial query processing in wireless broadcast environments(sy...Mumbai Academisc
This document discusses a novel approach for reducing latency in answering location-based spatial queries (LBSQs) in wireless broadcast environments. The approach uses peer-to-peer sharing to process queries using results cached in neighboring mobile peers, without requiring delay to communicate with a server. It maintains high scalability and accuracy while decreasing latency. The feasibility of the approach is demonstrated through probabilistic analysis and simulation results showing decreased latency as the number of clients increases.
Privacy preserving relative location based services for mobile usersLeMeniz Infotech
Privacy preserving relative location based services for mobile users
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Web : http://www.lemenizinfotech.com
Web : http://www.ieeemaster.com
Mail : projects@lemenizinfotech.com
Blog : http://ieeeprojectspondicherry.weebly.com
Blog : http://www.ieeeprojectsinpondicherry.blogspot.in/
Youtube:https://www.youtube.com/watch?v=eesBNUnKvws
USER-DEFINED PRIVACY GRID SYSTEM FOR CONTINUOUS LOCATION-BASED SERVICES - IEE...Nexgen Technology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Privacy preserving optimal meeting location determination on mobile devicesAdz91 Digital Ads Pvt Ltd
The document proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. It aims to solve this fair rendezvous point (FRVP) problem in a way that protects users' location privacy from both other users and third-party service providers. The algorithms utilize homomorphic encryption to privately compute the meeting point from users' location preferences without revealing those preferences. The document evaluates the privacy and performance of the algorithms through both theoretical analysis and prototype implementation on mobile devices.
Privacy preserving optimal meeting location determination on mobile devicesAdz91 Digital Ads Pvt Ltd
The document proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. It aims to solve this problem, called the Fair Rendezvous Point (FRVP) problem, in a way that protects users' location privacy from both other users and third-party service providers. The algorithms take advantage of homomorphic cryptography to privately compute the optimal location based on users' encrypted location preferences. The document evaluates the privacy and performance of the proposed algorithms through both theoretical analysis and prototype implementation on mobile devices.
PERTURBED ANONYMIZATION: TWO LEVEL SMART PRIVACY FOR LBS MOBILE USERS cscpconf
The use of smart mobile devices like tablets, smart phones and navigational gadgets provide
most promising communication and better services to mobile users. Location Based Services
(LBS) have become very common in recent years. Mobile users submit their location dependent
queries to the untrusted LBS server to acquire a particular service. Ideally, user’s personal
information such as location data is supposed to be protected while communicating to LBS and
at the same time quality of service must be maintained. Therefore, there is a need to have a
balanced trade-off between privacy and quality of service. To fulfil such trade-off, this paper
proposes a solution that first forms the cloaking region at mobile device, perform perturbation
to handle the problem of trusted third party and the anonymizer further anonymizes the location
to remove the problem of enough users required to form the cloaking region. The proposed
approach protects the location privacy of the user and also maintains the quality of service by
selecting appropriate service to the particular user. The proposed algorithm provides two-level
location protection to the user, and thus ensures smart mobility of the LBS user.
USER-DEFINED PRIVACY GRID SYSTEM FOR CONTINUOUS LOCATION-BASED SERVICESnexgentechnology
This document proposes a user-defined privacy grid system called Dynamic Grid System (DGS) to provide privacy-preserving location-based services. DGS uses a semi-trusted third party called a query server to process user requests while preserving the privacy of user locations. It divides query processing between the query server and service provider. Experimental results show DGS is more efficient than existing techniques requiring a fully-trusted third party, providing better privacy guarantees with lower communication and computation costs.
Location based spatial query processing in wireless broadcast environments(sy...Mumbai Academisc
This document discusses a novel approach for reducing latency in answering location-based spatial queries (LBSQs) in wireless broadcast environments. The approach uses peer-to-peer sharing to process queries using results cached in neighboring mobile peers, without requiring delay to communicate with a server. It maintains high scalability and accuracy while decreasing latency. The feasibility of the approach is demonstrated through probabilistic analysis and simulation results showing decreased latency as the number of clients increases.
Privacy preserving relative location based services for mobile usersLeMeniz Infotech
Privacy preserving relative location based services for mobile users
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Web : http://www.lemenizinfotech.com
Web : http://www.ieeemaster.com
Mail : projects@lemenizinfotech.com
Blog : http://ieeeprojectspondicherry.weebly.com
Blog : http://www.ieeeprojectsinpondicherry.blogspot.in/
Youtube:https://www.youtube.com/watch?v=eesBNUnKvws
USER-DEFINED PRIVACY GRID SYSTEM FOR CONTINUOUS LOCATION-BASED SERVICES - IEE...Nexgen Technology
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Privacy preserving optimal meeting location determination on mobile devicesAdz91 Digital Ads Pvt Ltd
The document proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. It aims to solve this fair rendezvous point (FRVP) problem in a way that protects users' location privacy from both other users and third-party service providers. The algorithms utilize homomorphic encryption to privately compute the meeting point from users' location preferences without revealing those preferences. The document evaluates the privacy and performance of the algorithms through both theoretical analysis and prototype implementation on mobile devices.
Privacy preserving optimal meeting location determination on mobile devicesAdz91 Digital Ads Pvt Ltd
The document proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. It aims to solve this problem, called the Fair Rendezvous Point (FRVP) problem, in a way that protects users' location privacy from both other users and third-party service providers. The algorithms take advantage of homomorphic cryptography to privately compute the optimal location based on users' encrypted location preferences. The document evaluates the privacy and performance of the proposed algorithms through both theoretical analysis and prototype implementation on mobile devices.
IRJET- Quantify Mutually Dependent Privacy Risks with Locality DataIRJET Journal
This document discusses how co-location information shared on social networks can threaten users' location privacy by enabling more accurate localization of users' locations over time. It formalizes the problem of quantifying privacy risks from co-location data and location information, and proposes optimal and approximate localization attack algorithms to incorporate co-location data. Experimental evaluations on mobility trace data show that considering a single friend's co-locations can decrease a user's median location privacy by up to 62%. Differential privacy perspectives are also discussed. The study aims to quantify the effect of co-location information on location privacy risks.
Privacy preserving optimal meeting location determination on mobile devicesIGEEKS TECHNOLOGIES
This paper proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. It addresses the privacy issues in location-based services (LBS) that require sharing of user locations. Two algorithms are presented that allow each user to provide a single location preference to the solver while preserving privacy from other users and the service provider. The paper evaluates the security and privacy of the algorithms through theoretical analysis and implementation on mobile devices. A user study provides insights into privacy concerns with LBS and the usability of the proposed solutions.
Secure Multi-Party Negotiation: An Analysis for Electronic Payments in Mobile...IDES Editor
This document summarizes and analyzes secure multi-party negotiation protocols for electronic payments in mobile computing. It presents a framework for secure multi-party decision protocols using lightweight implementations. The main focus is on synchronizing security features to avoid agreement manipulation and reduce user traffic. The paper describes negotiation between an auctioneer and bidders, showing multiparty security is better than existing systems. It analyzes the performance of encryption algorithms like ECC, XTR, and RSA for use in the multiparty negotiation protocols.
User defined privacy grid system for continuous location based services abstractSoftroniics india
This document proposes a user-defined privacy grid system (DGS) to provide privacy-preserving location-based services. Existing systems rely on a fully-trusted third party or only achieve regional location privacy. The proposed DGS uses a semi-trusted third party (query server) that does not store or access user locations. It allows users to define a query area and grid structure. The system encrypts location information and grid cell identifiers during communication between the user, query server, and service provider to match points of interest to the user while preserving privacy. Experimental results show it is more efficient than state-of-the-art techniques for continuous location-based services.
User defined privacy grid system for continuous location-based servicesLeMeniz Infotech
User defined privacy grid system for continuous location-based services
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Web : http://www.lemenizinfotech.com
Web : http://www.ieeemaster.com
Mail : projects@lemenizinfotech.com
Blog : http://ieeeprojectspondicherry.weebly.com
Blog : http://www.ieeeprojectsinpondicherry.blogspot.in/
Youtube:https://www.youtube.com/watch?v=eesBNUnKvws
Synthesis of Non-Replicated Dynamic Fragment Allocation Algorithm in Distribu...IDES Editor
This document summarizes a research paper that proposes a new dynamic fragment allocation algorithm for distributed database systems. The algorithm incorporates time constraints of database accesses, a volume threshold, and the volume of data transmitted between sites over time to dynamically reallocate fragments based on changing access patterns. It aims to migrate fragments to sites that consistently transfer the most data to/from that fragment over recent time intervals. This is intended to improve performance by minimizing data transmission costs as access patterns change. Key factors like the volume threshold, time interval duration, and consistency threshold regulate how frequently fragments are reallocated.
Collaborative Filtering Approach For QoS PredictionEditor IJMTER
Many researchers propose that, not only functional but also non-functional properties, also
known as quality of service (QoS), should be taken into consideration when consumers select
services. Consumers need to make prediction on quality of unused web services before selecting.
Usually, this prediction is based on other consumers’ experiences. Being aware of different QoS
experiences of consumers, this paper proposes a collaborative filtering based approach to making
similarity mining and prediction from consumers’ experiences. Experimental results demonstrate that
this approach can make significant improvement on the effectiveness of QoS prediction for web
services.
Machine Learning Applications in Grid Computingbutest
This document discusses applying machine learning techniques to validate computational services in grid computing environments. It proposes a method of functional validation where a client presents test cases to a prospective service provider, and the provider responds. If the responses consistently match the client's expectations, the client will commit to using the service. The document applies concepts from machine learning like PAC learning and Chernoff bounds to determine how many test cases are needed to validate a service with a given level of confidence. It argues that functional validation is needed because keywords and ontologies alone cannot precisely describe computational services in heterogeneous distributed systems.
The document discusses privacy-preserving algorithms for determining an optimal meeting location for a group of users. It proposes two algorithms that take advantage of homomorphic cryptosystems to privately compute a fair rendezvous point from user location preferences, without revealing the actual locations. The algorithms are evaluated through a prototype implementation on mobile devices and a user study to analyze usability and privacy protections.
Big Data Analytics- USE CASES SOLVED USING NETWORK ANALYSIS TECHNIQUES IN GEPHIRuchika Sharma
This report is done as a part in completion of our Big Data Analysis Course at Jindal Global Business School.
In this report, we have mainly focused on literature review of 10 use-cases in the visualization task. We have worked on use cases pertaining to varied use of social media site Twitter in the political, cultural and business context; use by drug marketers and musicians among others.
Big Data Analysis- Live DATA PRESENTATION- Bitcoin Alpha trust networkRuchika Sharma
This presentation was made as a part of our Big Data Analysis course to further analyse the of Gephi software in understanding live data and interpreting our findings by visualizing the data thereof. We have used the Bitcoin Alpha Trust network to carry out our analysis.
Responsive Parameter based an AntiWorm Approach to Prevent Wormhole Attack in...IDES Editor
The recent advancements in the wireless technology
and their wide-spread deployment have made remarkable
enhancements in efficiency in the corporate and industrial
and Military sectors The increasing popularity and usage of
wireless technology is creating a need for more secure wireless
Ad hoc networks. This paper aims researched and developed
a new protocol that prevents wormhole attacks on a ad hoc
network. A few existing protocols detect wormhole attacks but
they require highly specialized equipment not found on most
wireless devices. This paper aims to develop a defense against
wormhole attacks as an Anti-worm protocol which is based on
responsive parameters, that does not require as a significant
amount of specialized equipment, trick clock synchronization,
no GPS dependencies.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
www.impulse.net.in
Email: ieeeprojects@yahoo.com/ imbpulse@gmail.com
PROTECTING PRIVACY IN VANETs USING MIX ZONES WITH VIRTUAL PSEUDONYM CHANGE IJNSA Journal
This document summarizes a research paper that proposes a technique for securely changing pseudonyms in vehicular ad hoc networks (VANETs) to enhance privacy. The technique uses "mix zones", predefined regions where vehicles can change pseudonyms. It introduces "virtual pseudonym changes" using transceivers if real vehicles are insufficient. Transceivers mimic pseudonym changes to increase complexity for adversaries trying to link pseudonyms. The technique calculates mapping weights between zones to determine when virtual changes are needed. It aims to guarantee high privacy even with low traffic by obscuring pseudonym linkages.
This document summarizes a research paper that proposes an efficient and scalable server architecture called "Presence Cloud" to address problems in large-scale mobile presence services. Presence Cloud organizes presence servers in a quorum-based overlay network with balanced load and small diameter. It employs a one-hop caching strategy and directed search algorithm to reduce message transmission and provide fast buddy list searches with low latency. The performance of Presence Cloud is analyzed in terms of search cost and satisfaction level.
Location Sharing System Using GPS Technology for Minimizing SMS DeliveryIJERA Editor
Enhanced Privacy in Mobile Online Social Networks to providing the location information to the User /server in the
online location server. MOSNs, more and more users‘ location information will be collected by the service providers
in mOSN. The users‘ privacy, including location privacy and social network privacy can be improved using the User
Registration & encryption of the data stored into the server. It should aiming at achieving enhanced privacy against
the insider attack launched by the service providers in mOSNs, we introduce a new architecture with multiple location
servers for the first time and propose a secure solution supporting location sharing among friends and strangers in
location-based applications. In our construction, the user‘s friend set in each friend‘s query submitted to the location
servers is divided into multiple subsets by the social network server randomly. Location-based services (LBSs) are
one of the most important components in mOSNs, which provides information and entertainment service based on the
geographical position of the mobile device. The entity of users, with mobile devices, is able to communicate with
other users and share their locations. Online social network Server manages users‘ identity-related information such as
users‘ profiles and friend lists. Location server stores users‘ location information and provides LBSs according to the
requests sent from users. Here we are going to improve the user location privacy, social network privacy.
Privacy preserving optimal meeting location determination on mobile devicesShakas Technologies
This document proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. Existing location-based services that rely on users sharing their locations compromise privacy. The proposed algorithms use homomorphic encryption to compute a fair meeting point from user location preferences without revealing individual locations. They are evaluated for privacy under various adversarial scenarios and implemented on mobile devices. A user study provides insight into privacy awareness and the usability of the solutions.
IDP: A Privacy Provisioning Framework for TIP Attributes in Trusted Third Par...Rida Qayyum
Location-Based Services (LBS) System is rapidly growing due to radio communication services with wireless mobile devices having a positioning component in it. LBS System offers location-based services by knowing the actual user position. A mobile user uses LBS to access services relevant to their locations. In order to provide Point of Interest (POI), LBS confronts numerous privacy related challenges in three different formats including Non-Trusted Third Party (NTTP), Trusted Third Party (TTP), and Mobile Peer-to-Peer (P2P). The current study emphasized the TTP based LBS system where the Location server does not provide full privacy to mobile users. In TTP based LBS system, a user’s privacy is concerned with personal identity, location information, and time information. In order to accomplish privacy under these concerns, state-of-the-art existing mechanisms have been reviewed. Hence, the aim to provide a promising roadmap to research and development communities for the right selection of privacy approach has achieved by conducting a comparative survey of the TTP based approaches. Leading to these privacy attributes, the current study addressed the privacy challenge by proposing a new privacy protection model named “Improved Dummy Position” (IDP) that protects TIP (Time, Identity, and Position) attributes under TTP LBS System. In order to validate the privacy level, a comparative analysis has been conducted by implementing the proposed IDP model in the simulation tool, Riverbed Modeler academic edition. The different scenarios of changing query transferring rate evaluate the performance of the proposed model. Simulation results demonstrate that our IDP could be considered as a promising model to protect user’s TIP attributes in a TTP based LBS system due to better performance and improved privacy level. Further, the proposed model extensively compared with the existing work.
Exploiting Service Similarity for Privacy in Location Based Search QueriesMigrant Systems
This document proposes a privacy-supportive architecture for location-based services that allows users to make informed decisions about location privacy without significantly affecting service quality. The key aspects are:
1) Users first submit queries with generalized locations and receive a "service similarity profile" showing how results may vary across locations.
2) Users can then select a noisy location based on their privacy preferences while observing how it impacts results.
3) An example local search application is described to demonstrate how result set boundaries with no change can be identified, allowing large default privacy regions. Testing found users can add significant location noise while still getting accurate results.
This document proposes a user-centric approach called MobiCrowd to improve location privacy in location-based services. MobiCrowd allows mobile users to collaborate by storing each other's location information and responding to queries, hiding users from the location server unless no collaborative peers have the requested information. An epidemic model is developed to analyze how parameters like query rates and data lifetime affect privacy. Results show MobiCrowd hides a high fraction of queries, significantly enhancing privacy, and implementation shows it is lightweight with negligible collaboration costs.
IRJET- Quantify Mutually Dependent Privacy Risks with Locality DataIRJET Journal
This document discusses how co-location information shared on social networks can threaten users' location privacy by enabling more accurate localization of users' locations over time. It formalizes the problem of quantifying privacy risks from co-location data and location information, and proposes optimal and approximate localization attack algorithms to incorporate co-location data. Experimental evaluations on mobility trace data show that considering a single friend's co-locations can decrease a user's median location privacy by up to 62%. Differential privacy perspectives are also discussed. The study aims to quantify the effect of co-location information on location privacy risks.
Privacy preserving optimal meeting location determination on mobile devicesIGEEKS TECHNOLOGIES
This paper proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. It addresses the privacy issues in location-based services (LBS) that require sharing of user locations. Two algorithms are presented that allow each user to provide a single location preference to the solver while preserving privacy from other users and the service provider. The paper evaluates the security and privacy of the algorithms through theoretical analysis and implementation on mobile devices. A user study provides insights into privacy concerns with LBS and the usability of the proposed solutions.
Secure Multi-Party Negotiation: An Analysis for Electronic Payments in Mobile...IDES Editor
This document summarizes and analyzes secure multi-party negotiation protocols for electronic payments in mobile computing. It presents a framework for secure multi-party decision protocols using lightweight implementations. The main focus is on synchronizing security features to avoid agreement manipulation and reduce user traffic. The paper describes negotiation between an auctioneer and bidders, showing multiparty security is better than existing systems. It analyzes the performance of encryption algorithms like ECC, XTR, and RSA for use in the multiparty negotiation protocols.
User defined privacy grid system for continuous location based services abstractSoftroniics india
This document proposes a user-defined privacy grid system (DGS) to provide privacy-preserving location-based services. Existing systems rely on a fully-trusted third party or only achieve regional location privacy. The proposed DGS uses a semi-trusted third party (query server) that does not store or access user locations. It allows users to define a query area and grid structure. The system encrypts location information and grid cell identifiers during communication between the user, query server, and service provider to match points of interest to the user while preserving privacy. Experimental results show it is more efficient than state-of-the-art techniques for continuous location-based services.
User defined privacy grid system for continuous location-based servicesLeMeniz Infotech
User defined privacy grid system for continuous location-based services
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Web : http://www.lemenizinfotech.com
Web : http://www.ieeemaster.com
Mail : projects@lemenizinfotech.com
Blog : http://ieeeprojectspondicherry.weebly.com
Blog : http://www.ieeeprojectsinpondicherry.blogspot.in/
Youtube:https://www.youtube.com/watch?v=eesBNUnKvws
Synthesis of Non-Replicated Dynamic Fragment Allocation Algorithm in Distribu...IDES Editor
This document summarizes a research paper that proposes a new dynamic fragment allocation algorithm for distributed database systems. The algorithm incorporates time constraints of database accesses, a volume threshold, and the volume of data transmitted between sites over time to dynamically reallocate fragments based on changing access patterns. It aims to migrate fragments to sites that consistently transfer the most data to/from that fragment over recent time intervals. This is intended to improve performance by minimizing data transmission costs as access patterns change. Key factors like the volume threshold, time interval duration, and consistency threshold regulate how frequently fragments are reallocated.
Collaborative Filtering Approach For QoS PredictionEditor IJMTER
Many researchers propose that, not only functional but also non-functional properties, also
known as quality of service (QoS), should be taken into consideration when consumers select
services. Consumers need to make prediction on quality of unused web services before selecting.
Usually, this prediction is based on other consumers’ experiences. Being aware of different QoS
experiences of consumers, this paper proposes a collaborative filtering based approach to making
similarity mining and prediction from consumers’ experiences. Experimental results demonstrate that
this approach can make significant improvement on the effectiveness of QoS prediction for web
services.
Machine Learning Applications in Grid Computingbutest
This document discusses applying machine learning techniques to validate computational services in grid computing environments. It proposes a method of functional validation where a client presents test cases to a prospective service provider, and the provider responds. If the responses consistently match the client's expectations, the client will commit to using the service. The document applies concepts from machine learning like PAC learning and Chernoff bounds to determine how many test cases are needed to validate a service with a given level of confidence. It argues that functional validation is needed because keywords and ontologies alone cannot precisely describe computational services in heterogeneous distributed systems.
The document discusses privacy-preserving algorithms for determining an optimal meeting location for a group of users. It proposes two algorithms that take advantage of homomorphic cryptosystems to privately compute a fair rendezvous point from user location preferences, without revealing the actual locations. The algorithms are evaluated through a prototype implementation on mobile devices and a user study to analyze usability and privacy protections.
Big Data Analytics- USE CASES SOLVED USING NETWORK ANALYSIS TECHNIQUES IN GEPHIRuchika Sharma
This report is done as a part in completion of our Big Data Analysis Course at Jindal Global Business School.
In this report, we have mainly focused on literature review of 10 use-cases in the visualization task. We have worked on use cases pertaining to varied use of social media site Twitter in the political, cultural and business context; use by drug marketers and musicians among others.
Big Data Analysis- Live DATA PRESENTATION- Bitcoin Alpha trust networkRuchika Sharma
This presentation was made as a part of our Big Data Analysis course to further analyse the of Gephi software in understanding live data and interpreting our findings by visualizing the data thereof. We have used the Bitcoin Alpha Trust network to carry out our analysis.
Responsive Parameter based an AntiWorm Approach to Prevent Wormhole Attack in...IDES Editor
The recent advancements in the wireless technology
and their wide-spread deployment have made remarkable
enhancements in efficiency in the corporate and industrial
and Military sectors The increasing popularity and usage of
wireless technology is creating a need for more secure wireless
Ad hoc networks. This paper aims researched and developed
a new protocol that prevents wormhole attacks on a ad hoc
network. A few existing protocols detect wormhole attacks but
they require highly specialized equipment not found on most
wireless devices. This paper aims to develop a defense against
wormhole attacks as an Anti-worm protocol which is based on
responsive parameters, that does not require as a significant
amount of specialized equipment, trick clock synchronization,
no GPS dependencies.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
www.impulse.net.in
Email: ieeeprojects@yahoo.com/ imbpulse@gmail.com
PROTECTING PRIVACY IN VANETs USING MIX ZONES WITH VIRTUAL PSEUDONYM CHANGE IJNSA Journal
This document summarizes a research paper that proposes a technique for securely changing pseudonyms in vehicular ad hoc networks (VANETs) to enhance privacy. The technique uses "mix zones", predefined regions where vehicles can change pseudonyms. It introduces "virtual pseudonym changes" using transceivers if real vehicles are insufficient. Transceivers mimic pseudonym changes to increase complexity for adversaries trying to link pseudonyms. The technique calculates mapping weights between zones to determine when virtual changes are needed. It aims to guarantee high privacy even with low traffic by obscuring pseudonym linkages.
This document summarizes a research paper that proposes an efficient and scalable server architecture called "Presence Cloud" to address problems in large-scale mobile presence services. Presence Cloud organizes presence servers in a quorum-based overlay network with balanced load and small diameter. It employs a one-hop caching strategy and directed search algorithm to reduce message transmission and provide fast buddy list searches with low latency. The performance of Presence Cloud is analyzed in terms of search cost and satisfaction level.
Location Sharing System Using GPS Technology for Minimizing SMS DeliveryIJERA Editor
Enhanced Privacy in Mobile Online Social Networks to providing the location information to the User /server in the
online location server. MOSNs, more and more users‘ location information will be collected by the service providers
in mOSN. The users‘ privacy, including location privacy and social network privacy can be improved using the User
Registration & encryption of the data stored into the server. It should aiming at achieving enhanced privacy against
the insider attack launched by the service providers in mOSNs, we introduce a new architecture with multiple location
servers for the first time and propose a secure solution supporting location sharing among friends and strangers in
location-based applications. In our construction, the user‘s friend set in each friend‘s query submitted to the location
servers is divided into multiple subsets by the social network server randomly. Location-based services (LBSs) are
one of the most important components in mOSNs, which provides information and entertainment service based on the
geographical position of the mobile device. The entity of users, with mobile devices, is able to communicate with
other users and share their locations. Online social network Server manages users‘ identity-related information such as
users‘ profiles and friend lists. Location server stores users‘ location information and provides LBSs according to the
requests sent from users. Here we are going to improve the user location privacy, social network privacy.
Privacy preserving optimal meeting location determination on mobile devicesShakas Technologies
This document proposes privacy-preserving algorithms for determining an optimal meeting location for a group of users. Existing location-based services that rely on users sharing their locations compromise privacy. The proposed algorithms use homomorphic encryption to compute a fair meeting point from user location preferences without revealing individual locations. They are evaluated for privacy under various adversarial scenarios and implemented on mobile devices. A user study provides insight into privacy awareness and the usability of the solutions.
IDP: A Privacy Provisioning Framework for TIP Attributes in Trusted Third Par...Rida Qayyum
Location-Based Services (LBS) System is rapidly growing due to radio communication services with wireless mobile devices having a positioning component in it. LBS System offers location-based services by knowing the actual user position. A mobile user uses LBS to access services relevant to their locations. In order to provide Point of Interest (POI), LBS confronts numerous privacy related challenges in three different formats including Non-Trusted Third Party (NTTP), Trusted Third Party (TTP), and Mobile Peer-to-Peer (P2P). The current study emphasized the TTP based LBS system where the Location server does not provide full privacy to mobile users. In TTP based LBS system, a user’s privacy is concerned with personal identity, location information, and time information. In order to accomplish privacy under these concerns, state-of-the-art existing mechanisms have been reviewed. Hence, the aim to provide a promising roadmap to research and development communities for the right selection of privacy approach has achieved by conducting a comparative survey of the TTP based approaches. Leading to these privacy attributes, the current study addressed the privacy challenge by proposing a new privacy protection model named “Improved Dummy Position” (IDP) that protects TIP (Time, Identity, and Position) attributes under TTP LBS System. In order to validate the privacy level, a comparative analysis has been conducted by implementing the proposed IDP model in the simulation tool, Riverbed Modeler academic edition. The different scenarios of changing query transferring rate evaluate the performance of the proposed model. Simulation results demonstrate that our IDP could be considered as a promising model to protect user’s TIP attributes in a TTP based LBS system due to better performance and improved privacy level. Further, the proposed model extensively compared with the existing work.
Exploiting Service Similarity for Privacy in Location Based Search QueriesMigrant Systems
This document proposes a privacy-supportive architecture for location-based services that allows users to make informed decisions about location privacy without significantly affecting service quality. The key aspects are:
1) Users first submit queries with generalized locations and receive a "service similarity profile" showing how results may vary across locations.
2) Users can then select a noisy location based on their privacy preferences while observing how it impacts results.
3) An example local search application is described to demonstrate how result set boundaries with no change can be identified, allowing large default privacy regions. Testing found users can add significant location noise while still getting accurate results.
This document proposes a user-centric approach called MobiCrowd to improve location privacy in location-based services. MobiCrowd allows mobile users to collaborate by storing each other's location information and responding to queries, hiding users from the location server unless no collaborative peers have the requested information. An epidemic model is developed to analyze how parameters like query rates and data lifetime affect privacy. Results show MobiCrowd hides a high fraction of queries, significantly enhancing privacy, and implementation shows it is lightweight with negligible collaboration costs.
This document summarizes a research paper on privacy in location-based services. It discusses how location privacy is an important issue for location-based services. It describes an architecture used to implement privacy-preserving location services with a client-server model. It also discusses various techniques used for preserving privacy, including obfuscation-based methods, SP-filtering protocols, and Hide and Seek protocols. The paper focuses on implementing and combining the SP-filtering and Hide and Seek protocols to determine if two users are in proximity while preserving their location privacy. It provides details on how these protocols work and how they are implemented using obfuscated locations.
Privacy in Location-Based Services using SP-Filtering in Hide and Seek Protoc...Editor Jacotech
This document summarizes a research paper about preserving privacy in location-based services. It discusses how location privacy is an important issue for location-based services. It describes an architecture used to implement privacy-preserving techniques at the service layer without interfering with existing services. It then covers various privacy-preserving techniques including obfuscation-based methods, SP-filtering protocols, and hide and seek protocols. It provides details on how obfuscation can be used to generalize user locations. It also explains how SP-filtering protocols work to calculate the minimum and maximum distances between generalized locations to determine proximity. Finally, it describes how hide and seek protocols can be combined with SP-filtering to more accurately determine proximity when locations may overlap
The document proposes a privacy-preserving reputation system for location-based queries. It aims to allow users to query a database of location data (points of interest) while protecting their location information and preventing unauthorized access. The system uses an adaptive oblivious transfer protocol for secure data transmission between the user and location server. It also establishes a secure communication mechanism using encryption and decryption during the data retrieval process. Additionally, the system incorporates a privacy-preserving reputation technique using authorization rules and data integrity checks to control misleading data and ensure data accuracy. The experimental results show that the proposed system using elliptic curve cryptography encryption has lower overhead and delay than existing systems using RSA encryption for private information retrieval.
Privacy - Preserving Reputation with Content Protecting Location Based Queriesiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Need a project proposal for my computer science 3 course. I dont eve.pdfaristogifts99
Need a project proposal for my computer science 3 course. I dont even know where to start.
Need a unique program proposal as well as the program itself with all header files,
implementation files, and source files. Also need it commented.
In the proposal, describe what you intend to do for your project in terms of:
-general description of the problem you will be solving
-itemized list of use cases
-list of parameters that will be part of the user interface
-what structures and algorithms will you be using
Your proposal should be submitted as a Word document giving your name, project title and four
sections for each of the bulleted items listed above. Each section should have one paragraph
summarizing the section, followed by text or bullets detailing them. At the end should be a
References section that lists any outside sources (such as a particular implementation or problem
or code library) you plan on using.
Solution
HIDING IN THE MOBILE CROWD LOCATION PRIVACY THROUGH COLLABORATION
ABSTRACT
Location-aware smartphones support various location-based services (LBSs): users query the
LBS server and learnon the fly about their surroundings. However, such queries give away
private information, enabling the LBS to track users. A user-collaborative privacy-preserving
approach is proposed for LBSs. This solution does not requirechanging the LBS server
architecture and does not assume third party servers; yet, it significantly improves users’
locationprivacy. The gain stems from the collaboration of mobile devices: they keep their context
information in a buffer and pass it toothers seeking such information. Thus, a user remains
hidden from the server, unless all the collaborative peers in the vicinity lackthe sought
information. A novel epidemic model is developed to capture possibly time-dependent,dynamics
of information propagation among users. Used in the Bayesian inference framework, this model
helps analyze theeffects of various parameters, such as users’ querying rates and the lifetime of
context information, on users’ location privacy.The results show that our scheme hides a high
fraction of location-based queries, thus significantly enhancing users’ locationprivacy. Finally,
implementation indicates that it is lightweight and the cost of collaboration is negligible.
EXISTING SYSTEM
To enhance privacy for LBS users several solutions have been proposed and two main
categories are
Centralizedand
User-centric
Centralized approaches
Centralized approaches introduce a third party inthe system, which protects users’ privacy by
operatingbetween the user and the LBS. Such an intermediaryproxy server could anonymize
queriesby removing any information that identifies the useror her device.
It could blend a user’squery with those of other users, so that the LBS serveralways sees a group
of queries.
User-centric approaches
User-centric approaches operate on the device. Typicallythey aim to blur the location
information by,for example, having the user’s s.
Anonymous Usage of Location-Based Services Through Spatial and.docxrossskuddershamus
Anonymous Usage of Location-Based Services Through Spatial and
Temporal Cloaking
Marco Gruteser and Dirk Grunwald
Department of Computer Science
University of Colorado at Boulder
Boulder, CO 80309
{gruteser,grunwald}@cs.colorado.edu
Abstract
Advances in sensing and tracking technology enable
location-based applications but they also create signif-
icant privacy risks. Anonymity can provide a high de-
gree of privacy, save service users from dealing with
service providers’ privacy policies, and reduce the ser-
vice providers’ requirements for safeguarding private in-
formation. However, guaranteeing anonymous usage of
location-based services requires that the precise location
information transmitted by a user cannot be easily used
to re-identify the subject. This paper presents a mid-
dleware architecture and algorithms that can be used by
a centralized location broker service. The adaptive al-
gorithms adjust the resolution of location information
along spatial or temporal dimensions to meet specified
anonymity constraints based on the entities who may
be using location services within a given area. Using
a model based on automotive traffic counts and carto-
graphic material, we estimate the realistically expected
spatial resolution for different anonymity constraints.
The median resolution generated by our algorithms is
125 meters. Thus, anonymous location-based requests
for urban areas would have the same accuracy currently
needed for E-911 services; this would provide sufficient
resolution for wayfinding, automated bus routing ser-
vices and similar location-dependent services.
1 Introduction
Improvements in sensor and wireless communication
technology enable accurate, automated determination
and dissemination of a user’s or object’s position [1, 2].
There is an immense interest in exploiting this positional
data through location-based services (LBS) [3, 4, 5, 6].
For instance, LBSs could tailor their functionality to the
user’s current location, or vehicle movement data would
improve traffic forecasting and road planning.
However, without safeguards, extensive deployment
of these technologies endangers users’ location privacy
and exhibits significant potential for abuse [7, 8, 9].
Common privacy principles demand, among others, user
consent, purpose binding,1 and adequate data protection
1 When seeking user consent, data collectors need to explain the spe-
cific purpose for which the data will be used. Subsequent use for other
purposes is prohibited without additional user approval.
for collection and usage of personal information [10].
Complying with these principles generally requires no-
tifying users (data subjects) about the data collection and
the purpose through privacy policies; it also entails im-
plementing security measures to ensure that collected
data is only accessed for the agreed-upon purpose.
This paper investigates a complimentary approach that
concentrates on the principle of minimal collection. In
this approach.
Securing Location of User in Geo Social NetworkingIRJET Journal
The document describes a technique called LocX that aims to improve location privacy in geo-social networks without adding uncertainty to query results. LocX works by having each user apply a secret coordinate transformation to their actual locations before sharing them with the server. This allows queries to be evaluated correctly by the user while preventing servers from seeing users' actual location data. The technique is designed to provide strong location privacy even against powerful attackers and to be efficient enough for use on mobile devices.
A Survey of Privacy-Preserving Algorithms for Finding meeting point in Mobile...IJERA Editor
Location privacy in Location Based Services (LBS) is the capability to protect the connection between user’s identity, uncertainty sources, servers and database, thereby restraining an impending attacker from conveniently linking users of LBS to convinced locations. Smart Phones have become most important gadget for maintaining the daily activities, highly interconnected urban population is also increasingly dependent on these gadgets to regulate and schedule their daily lives. These applications often depend on current location of user or a class of user. Use of Smart Mapping technology is also increasing in large area; this system provides an easy attainable online platform that can be used for accessing many services. This survey paper projects the privacy-preserving algorithm to find the most favorable meeting location for a class of users. GSM calculates the location of all users.
User-Defined Privacy Grid System for Continuous Location-Based Services1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Privacy Preservation And Data Security In Location Based ServicesEditorJST
This document summarizes a research paper about preserving privacy and security in location-based services. It proposes a two-stage approach using oblivious transfer and a data retrieval phase to allow a user to query a database without revealing their identity or location to the server. The data on the server is encrypted for security. An intermediate service provider acts as a trusted third party to facilitate the private queries. If data is attacked, it can be recovered from a secondary server using message authentication codes to detect changes. The goal is to let users access location data privately while also protecting the server's data.
DESIGN AND ANALYSIS OF DKRINGA PROTOCOL FOR LOCATION PRIVACY IN TRUSTED ENVIR...ijsptm
Originally K-anonymity principle was first used in relational databases to tackle the problem of data anonymity. In earlier protection techniques K threshold is used as personalization factor for mobile users. In case, K users are not present around needy client mobile user, query can be delayed and thus it will not help to achieve the Quality of service parameter. Moreover, authors have adopted methodology that if K-1
additional travelling users or queries are not seen by needy users, dummies are populated in the environment to improve the quality of service. Earlier architectures shows poor usage of K-principle, cryptography and cloaking space, which leads to threat during communication, more communication cost,
more computation cost. We present here enhanced privacy model in a trustworthy third party privacy context that employs the notion of K-anonymity. In this work, enhanced algorithms are introduced, that guarantees a success of Location Based Services (LBS) query replies coming back to mobile client. Client sends the query to the anonymization server (AS), where this server cloaks the users with other at least K
users. Our novelty in the experiment is that we have introduced cryptography from client to AS, modified
earlier algorithms for Ring-Band approach, smart location updates and simulated the scaled experiment in populated cities environment. The AS add the dummies but creates ring-band cloaking area and sends it to LBS server. Cryptography adds some time however ring-band approach reduces communication overhead. We have studied the performance with variation of different parameters. The response from LBS comes to AS with Point of Interests (POIs) along the ring-band. After which AS filters for precise POIs and sends reply to mobile client. With ring-band approach we may also skip the AS and have client to LBS approach directly but without identity protection.
Cloaking Areas Location Based Services Using Dynamic Grid System & Privacy En...IJMTST Journal
Due to the large increasing use of Location Based Services (LBS), which require personal data of the user to provide the continuous service, protecting the privacy of these data has become a challenge. An approach to preserving a privacy is through anonymity, by hiding the identity and user location data of the mobile device from the service provider(third party) or from any unauthorized party who has access at the user’s request .Considering the challenge mentioned, in this paper gives a classification according to the Architecture, approaches and techniques used in previous works, and presents a survey of solutions to provide anonymity in LBS including the open issues or possible improvements to current solutions. All of this, in order to provide guidelines for choosing the best solution approach to a specific scenery in which anonymity is required.
SURVEY PAPER ON PRIVACY IN LOCATION BASED SEARCH QUERIES.ijiert bestjournal
Due to tremendous growth in mobile phones,the mark et for Location Based Services is growing fast. Man y mobile phone applications uses location based services suc h as nearest store finder,car navigation system et c. Location � Based Services provides services to mobile device u sers based on the location information as well as d ata profile of the users. Using these services mobile users retrie ve information about nearest POI. This involves loc ation and data profile of the user�s to be misused. In order to pr otect user�s private information many solutions ar e offered but most of them only addressed on snapshot and no supp ort for continuous query and MQMO .Some papers add ressed MQMO but fails to provide privacy. This paper focus es on MQMO and also protect user�s private informat ion using PIR (private information retrieval) .
STATE-OF-THE-ART, CHALLENGES: PRIVACY PROVISIONING IN TTP LOCATION BASED SERV...Rida Qayyum
Nowadays, Location-based services (LBS) System is commonly used by Mobile users worldwide due to the immense growth of the Internet and Mobile devices. A mobile user uses LBS to access services relevant to their locations. LBS usage raises severe privacy concerns. A secure LBS system is required to protect three fundamentals metrics such as temporal information, user identity, and spatial information. Different models are being used to deal with such privacy metrics such as TTP and NTTP. In current study, we have conducted a comprehensive survey on TTP privacy protecting techniques which are being used in LBS systems. Primarily, it would be facilitating the mobile users with full privacy when they interact with the LBS system. Moreover, it is aimed to provide a promising roadmap to research and development communities for right selection of privacy approach.
This document summarizes a research paper on generating random regions in a spatial cloaking algorithm to preserve location privacy. The paper proposes two algorithms - the first provides a direct list of locations ordered by proximity, while the second generates regions of different shapes to minimize the chances of a user's location being disclosed. Spatial cloaking techniques blur a user's exact location into a cloaked region to satisfy privacy requirements like k-anonymity. The paper presents a system model where users communicate directly with location-based services instead of through peers, and describes how queries are processed by the services to search for points of interest within cloaked regions.
External Defense (TTP based LBS System) Rida Qayyum
Muhammad Usman Ashraf, Rida Qayyum, and Hina Ejaz, ”STATE- OF-THE-ART, CHALLENGES: PRIVACY PROVISIONING IN TTP LOCATION BASED SERVICES SYSTEMS”, International Journal of Advanced Research in Computer Science (IJARCS), Vol. 10, No. 2, pp. 68-75, April 2019. DOI: https://doi.org/10.26483/ijarcs.v10i2
Rida Qayyum, Hina Ejaz “Provisioning Privacy for TIP Attribute in Trusted Third Party (TTP) Location Based Services (LBS) System”, May 2019. DOI: 10.13140/RG.2.2.25631.59041
Rida Qayyum, Hina Ejaz, " Data Security in Mobile Cloud Computing: A State of the Art Review", International Journal of Modern Education and Computer Science (IJMECS), Vol. 12, No. 2, pp. 30-35, April 2020. DOI: 10.5815/ijmecs.2020.02.04
Muhammad Usman Ashraf, Kamal M. Jambi, Rida Qayyum, Hina Ejaz, and Iqra Ilyas “IDP: A Privacy Provisioning Framework for TIP Attributes in Trusted Third Party-based Location-based Services Systems”, International Journal of Advanced Computer Science and Applications(IJACSA), 11(7), pp. 604-617, July 2020. DOI: 10.14569/IJACSA.2020.0110773
Rida Qayyum. " A Roadmap Towards Big Data Opportunities, Emerging Issues and Hadoop as a Solution ", International Journal of Education and Management Engineering (IJEME), Vol.10, No.4, pp.8-17, 2020. DOI: 10.5815/ijeme.2020.04.02
Rida Qayyum,Hina Ejaz."A Comparative Study of Location Based Services Simulators". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.7, Issue 11,pp.1-12, November 2020, DOI :10.22362/ijcert/2020/v7/i11/v7i1101
Privacy preserving location sharing services for social networks(1)Kamal Spring
A common functionality of many location-based social networking applications is a location sharing service that allows a group of friends to share their locations. With a potentially un-trusted server, such a location sharing service may threaten the privacy of users. Existing solutions for Privacy-Preserving Location Sharing Services (PPLSS) require a trusted third party that has access to the exact location of all users in the system or rely on expensive algorithms or protocols in terms of computational or communication overhead. Other solutions can only provide approximate query answers. To overcome these limitations, we propose a new encryption notion, called Order-Retrievable Encryption (ORE), for PPLSS for social networking applications. The distinguishing characteristics of our PPLSS are that it allows a group of friends to share their exact locations without the need of any third party or leaking any location information to any server or users outside the group, achieves low computational and communication cost by allowing users to receive the exact location of their friends without requiring any direct communication between users or multiple rounds of communication between a user and a server, provides efficient query processing by designing an index structure for our ORE scheme, supports dynamic location updates, and provides personalized privacy protection within a group of friends by specifying a maximum distance where a user is willing to be located by his/her friends. Experimental results show that the computational and communication cost of our PPLSS is much better than the state-of-the-art solution.
Ähnlich wie LPM: A DISTRIBUTED ARCHITECTURE AND ALGORITHMS FOR LOCATION PRIVACY IN LBS (20)
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
LPM: A DISTRIBUTED ARCHITECTURE AND ALGORITHMS FOR LOCATION PRIVACY IN LBS
1. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
DOI : 10.5121/ijnsa.2012.4210 135
LPM: A DISTRIBUTED ARCHITECTURE AND
ALOGORITHMS FOR LOCATION PRIVACY IN LBS
Muhamed Ilyas1,*
, Dr. R. Vijayakumar2
1
Research Scholar, School of Computer Science, Mahatma Gandhi University
Kottayam, Kerala, India
Muhamed.ilyas@gmail.com
2
School of Computer Science, Mahatma Gandhi University
Kottayam, Kerala, India
Kiran2k@bsnl.in
ABSTRACT
Recent advances in mobile communication and development of sophisticated equipments lead to the wide
spread use of Location Based Services (LBS). A major concern for large-scale deployment of LBSs is the
potential abuse of their client location data, which may imply sensitive personal information. Protecting
location information of the mobile user is challenging because a location itself may reveal user identity.
Several schemes have been proposed for location cloaking. In our paper, we propose a generic Enhanced
Location Privacy Model (LPM), which describes the concept, the architecture, algorithms and the
functionalities for location privacy in LBS. As per the architecture, the system ensures location privacy,
without trusting anybody including the peers or LBS servers. The system is fully distributed and
evaluation shows its efficiency and high level of privacy with QoS.
KEYWORDS
Location privacy, Location Based Services, Location Cloaking, Distributed Query Processing
1. INTRODUCTION
The last decade showed an accelerated development of mobile and Internet technologies. Internet
technology with globally connected mobile networks introduces new business models and the
development of service architecture. Location-Based Services (LBS) are such an example.
Location based services (LBS) are Internet services that provide information or enable
communication based on the location of users and/or resources at specific times. Service
providers envision offering many new services based on a user’s location as well as augmenting
many existing services with location information [3]. At the same time, LBSs poses a new threat,
i.e., privacy preservation. For example, someone wants to have dinner and is searching for a
restaurant using the Internet. In order to get more accurate and useful research results, more
terms such as the mobile user’s location, the type of food, etc. should be included in his search
criteria. Unfortunately, if the queries are not securely managed, it could be possible for a third
party to retrieve the mobile user’s personal sensitive information such as his location
information, his habit, etc. In this case, even if an individual does not directly release personal
information to the service provider, this provider may become aware of the sensitive information
if it has to provide a service to such an individual [4].
Research in the field of privacy preservation in pervasive computing has mainly concentrated
on techniques for anonymous communication [1], access control and obfuscation [6, 7], dummy
requests [5], or on a combination of such techniques. Many of these techniques are based on a
central server called Location anonymizer (LA). In this case, the mobile user has to submit
his/her location identifier to the LA, and LA cloaks the location using different models
2. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
136
developed, like K-anonymity, before submitting the query to the LBS. Location Cloaking with a
centralized architecture must trust the central third party server with their identities, locations and
queries. However, there are a number of disadvantages for centralized approaches, such as a
single point of failure, bottlenecks due to communication overhead, and privacy threats as these
systems store all information in a single place. To overcome these problems, several
decentralized approaches have bee proposed. [ 22 ].
We propose a distributed approach to protect user privacy in LBS that does not need a
centralized server for location cloaking and does not trust any one including participating peers.
Our approach is similar to the work proposed by [5], but with cluster based peer selection
algorithm and an enhanced distributed peer cloaking method. Our approach uses the capabilities
of current mobile systems to form ad-hoc Wireless Personal Area Networks (WPANs) using
technologies like Bluetooth. As per the system, a user who needs a location services, called
query initiator, initially forms a peer group of n individuals based on a cluster algorithm. Then it
randomly selects a peer, called query requestor, to forward the query, on behalf of the query
initiator, to the LBS server. A major challenge of this approach is the selection of the query
requestor with uniform probability. It ensures that even if the LSP has access to the information
that currently n devices form an ad-hoc network, the LSP is only able to identify the query
initiator with a probability of 1/n [5].
In our approach, the user and the peers do not reveal their exact location to each other.
Instead the actual positions are obfuscated with an imprecise location like circle. For maximal
privacy protection this approach combines obfuscation with K-anonymity [5]. If a user requires a
location service, our algorithm computes a minimum bounding circle (called Global Cloaking
Area, GCA), that enclose obfuscated locations of all his peers. The GCA contains the obfuscated
location of the user and the obfuscated locations of all other K-1 peers.
In summary, our contributions in this paper are as follows:
We propose a heuristic algorithm to compute the obfuscated location, called Self Cloaked
Area (SCA), of the user and all its participating peers. Self Cloaking is done individually by the
query initiator and all participating peers.
We develop a Greedy algorithm for generating a user’s K-anonymous obfuscated location
from available n SCAs. In each iteration the algorithm checks the K-anonymity and continues
until K-anonymity level is met. Unlike in [5], where the selection of peers to meet the K-
anonymity is done by the query initiator, our work distributes this process among peers. Each
peer calculates, whether it’s Self Cloaked Area is within the GCA and is eligible to participate in
the obfuscation process to meet the K-anonymity level.
We present a near-uniform random selection algorithm to select a query requestor without
revealing their identities. In paper [5] they presented a decentralized approach to protect user
privacy during the access of LBSs using wireless ad-hoc networks. Users do not need to trust any
involved party, including their peers, the LSP or the infrastructure. We extend this work by
further decentralizing location obfuscation among peers with less computational overheads, and
also introducing simple greedy algorithm for a near-uniform random selection for any type of
peer distribution.
2. RELATED WORKS
Location anonymity and privacy awareness in location-based services has been extensively
studied as a solution to protect user privacy in recent literatures. The objective is to allow the
mobile user to request services without compromising his/her privacy, especially location
privacy [8]. Several privacy protection techniques have already been proposed. These
techniques are broadly classified into TTP-based methods and (ii) TTP-free methods. Based on
3. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
137
the underlying methodologies, these techniques can further be divided into three categories:
pseudonym, Cloaking, Transformation.
2.1 Simple and TTP Schemes
In the simplest form of communication between an LBS user (U) and an LBS provider (P),
the former sends a simple query (Q) containing an ID, his location (L) and a request for
information (I) that he wants to retrieve from P as shown in figure 1. Thus, a simple query sent
from U to P can be Q = {ID, L, I} = {ID, xU, yU, “Where is the closest bus station?”} By sending
their current locations to P, LBS users assume that P manages their data honestly and refrains
from any misuse. However, LBS providers cannot always be trusted and more complex
communication schemes are needed. [23].
Figure 1. Simple communication scheme with an LBS user and an LBS provider
Most of the initial solutions for location privacy were based on Trusted Third Parties (TTP)
as shown in Figure 2. In the simple scheme described above, users send their location
information and queries directly to the LBS provider. In TTP scheme, instead of sending the
query directly to LBS server, it is submitted to a TTP, where the location and identification of
the user is obfuscated using either transformation or pseudonym. TTP act as an intermediate
entity between user and LBS server. So, LBS providers are no longer aware of the real locations
and identities of the users. The problem is that the user has to trust the third party intermediate
entity instead of LBS server as in the case of simple LBS service, and whatever location privacy
LBS users can get depends on the honest behaviour of the TTP.
Figure 2. A TTP based scheme
TTP-based schemes are very common because they are easy to understand/develop, and
because, in general, they offer a reasonable trade-off between efficiency, accuracy and privacy.
Moreover, some of the ideas used in these schemes arose in more mature fields like e-commerce
[23]. A TTP can act as a Pseudonymiser or as an Anonymiser.
Pseudonymiser is the simplest form of a TTP scheme. It receives queries from users and,
prior to forwarding to them to the LBS server; it replaces the real ID of the user with
pseudonym. In this way the real user is hidden from the LBS server. However, the real ID is
kept with the Pseudonymiser in order to forward the answer from the LBS server to the user.
The problem is that it is vulnerable to attack as both real IDs and their corresponding
LBS
ProviderUser
Q= {ID, L, I}
{Answer}
LBS Provider
T
T
P
Users
4. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
138
pseudonyms are stored at the same place. Moreover, users must completely trust
Pseudonymiser, because the latter see all the location information of the former.
Anonymiser is the most sophisticated form of TTP scheme. In this scheme, the intermediate
entity which act as a TTP, hide the real location of the user by using the k-anonymity property.
k-Anonymity is an interesting approach to hide a user location by cloaking (spatial cloaking) the
location of another k-1 users. Spatial cloaking with k-anonymity was first suggested by
Samarati and Sweeney [16, 17, and 18]. The location of a user is k-anonymous if it is
indistinguishable from the location of another k − 1 users. So, the fundamental idea behind k-
anonymisers is to replace the real location of the user by cloaking areas (spatial cloaking) in
which at least k users are located. Spatial cloaking is being applied in both TTP based scheme as
well as TTP free schemes. While the former employs a centralized method, the latter suggests
different distributed methods for maximum location privacy.
2.2 TTP Based Spatial Cloaking
Spatial Cloaking is the most widely used privacy preserving technique for users accessing
LBS. The main idea behind cloaking approaches is to blur a user’s exact location in a larger
cloaked region and to make him/her indistinguishable among the set of other (real or dummy)
users located in the cloaked region
Many existing approaches in spatial cloaking are based on a centralized architecture. These
approaches rely on the existence of a trusted Intermediary server called location anonymizer
which protects a user’s private location and identity information from an untrusted location
server (e.g., Mokbel et al., 2006; Gruteser and Grunwald, 2003; Gedik and Liu, 2005a, 2005b;
Du et al., 2007) [9 -14]. The main idea in centralized cloaking is to put an anonymiser between
the users and the location server to prevent the server from learning users’ precise location
information and identities. Every location-based query is first sent to the anonymizer, which
transforms the user’s exact location to a cloaked area (i.e., rectangle or circle) and forwards the
query to the LBS server for that cloaked area. While different cloaking algorithms are proposed
for cloaking a user’s location, the common objective is to blur a user’s location in an area of size
at least Amin and/or among a set of at least k – 1 other users. Depending on the approach, these
parameters can be specified by each user independently, or are chosen as system parameters.
During the second phase, the privacy-aware location server, which is modified to process a
cloaked region query, generates a candidate list which is guaranteed to include the nearest
neighbor of any point inside the cloaked region. This list is then transferred to the client side for
further refinement to obtain the final result set [15]. The blurred spatial area can be based either
on the k-anonymity concept [Samarati 2001; Sweeney 2002a, 2002b] [16, 17,18] (i.e., the area
should contain at least k users) or on a graph model that represents a road network [Duckham
and Kulik 2005]. [19]
2.2 TTP Free Spatial Cloaking
Centralized approaches discussed above, however the centralized approach has several
disadvantages. This approach requires an anonymiser, as sophisticated as the location server
itself, to act as a proxy between users and the server per query. There are chances for single
point of failure/attack and bottleneck due to communication overhead. Another important
drawback is that, in many scenarios cloaking users’ location information in a larger region or
among k – 1 other user does not protect user’s location information. This is due to the fact that
based on user distributions in the space and the value of k (or similarly size of the cloaked
region), precise user location can be derived using several techniques. To overcome these
limitations, decentralized approaches have been proposed that construct cloaked region. The
approaches proposed by Chow et al. (2006) [20] and Ghinita et al. (2007b, 2007c) [20, 21]
assume users communicate with each other to collaboratively form a cloaked region. Ghinita et
al. (2007b) propose a hierarchical overlay network resembling a distributed B+ tree for
constructing the cloaked region that overcomes the above drawback. However, it suffers from
5. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
139
very slow response time. Ghinita et al. (2007c)[21] propose methods which provide stronger
privacy than Chow et al. (2006) for various distributions and do not suffer from slow response
time of Ghinita et al. (2007b). The authors propose a distributed method to find a random set of
k adjacent users based on their 1-D Hilbert ordering. Finally, Duckham and Kulik (2005) [19]
propose a graph model to represent possible user’s locations and denote the cloaked region by a
set of vertices in the graph. The client progressively gives more information about her precise
location until the query result set reaches her desired accuracy.
Tanzima Hashem, Lars Kulik [5] have developed a decentralized approach to protect user
privacy during the access of LBSs using wireless ad-hoc networks. Users do not need to trust
any involved party, including their peers, the LSP or the infrastructure provider. It exploits the
wireless advantage that all users in communication range can overhear a message to anonymize
the communication among users.
Wireless Ad-hoc networks are adaptive and self-organizing, and a consequence securing
such networks is non-trivial. Several efficient protocols have been developed for securing
medium access, routing, resource management, quality of service and security in mobile ad-hoc
networks. In particular, protocols like AODV, R-AODV (Reliant Ad-hoc On-demand Distance
Vector Routing) and Trust Based Scheme for QoS Assurance in Mobile Ad-Hoc Networks [25]
propose security enhancements by ensuring that data does not go through malicious nodes that
have been known to misbehave. However, in our paper, we are not going into the details of ad-
hoc network security.
Our work is similar to [5] but with less communication overhead and with a distributed
cloaking method. In [5], every user has to maintain the list of their peers within the
communication range all the time and it is maintained even if the user is not intended to submit
any request to the LBS server. This makes heavy processing and communication overhead for
all users in a mobile environment, and peers may change dynamically. Secondly, calculating the
cloaked area and selecting K-1 peers within the cloaked area are done at the query requestor,
which incurs processing overhead at the query requestor. In our method, selecting K-1 peers
within the cloaked area is done dynamically, only when the user wants to get some service from
the LBS server. Selection of K-1 peers within the cloaked area is done by the peers, thus
eliminating the process overhead at the query requestor. The second Simulation results show
that it has less communication overhead and high quality of service.
2.3 Query processing
Several efficient algorithms has been developed for finding the nearest POI with respect a
rectangular or a circular area. In new Casper [10], Mokbel et al. have developed an algorithm
that returns a range of POIs including the nearest POIs for every point of a rectangle. In [12],
algorithms have been proposed to evaluate m-nearest POIs for every point of a circle. All of
these algorithms may need to return a large set of answers and thus incur high processing and
communication overheads. In our previous paper [24], this issue has been addressed by using a
decentralized architecture for processing POI and range queries.
3. SYSTEM ARCHITECTURE AND LOCATION CLOAKING
We present a decentralized system that employs the power of ad-hoc networking for
obfuscating the user location from third party LBS servers. User and each participating peer,
cloaks their location as a circle, where the user location may be anywhere within the circle, and
thus the location cannot be identified by an adversary. The user, who wants to access the LBS
service, first determines K-1 number of participating peers for cloaking the location. After that it
determines the size of the circle, which contains all K-1 peers that participate in the cloaking
process, (Called Global Cloaked Area) in terms of its radius. The cloaking process proceeds in
6. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
140
two stages. Initially, the query initiator determines the radius of GCA and value of K. and it
calculates its Self Cloaked Area (SCA). Then it sends a broadcast message to all its peers, which
are normally one hope away from the user. The message contains three parameters; the pseudo
IP address of the query initiator, the parameters of its SC, and the parameters of the initial GCA.
On receiving the message, each peer calculates its SCA. Then it performs a spatial ‘within’
operation to identify that its SCA lies completely within the boundary of GCA. The result is true
if the SCA is fully within GCA, else the result is false. The peer returns its SCA along with
Boolean result of the spatial operation. After receiving the results from its peers, the query
initiator checks for the K-anonymity. If the desired anonymity is met, it proceeds to the next
step, otherwise continues the process with hope distances > 1 until the K-anonymity level is
met. The GCA will be a minimum radii circle which encloses all K-1 SCAs. Then our Random
Selection Algorithm selects a query requestor to forward the query along with GCA to LBS
Server.
In our proposed method, the peers are responsible for identifying themselves, whether to
participate in the cloaking process or not. This is a distributed approach, thus eliminating the
overhead at the query initiator for calculating the Globally Cloaked Area (GCA) with K-1 peers.
3.1 Generating SCA
In our approach, we generate a circular cloaked area which contains the peer’s real location
anywhere in the circle. We have developed a heuristic algorithm to generate the cloaked circle.
Let (x, y) be the real location of the mobile user. (The location might be received from GPS or
any other means). In order to obtain maximum anonymity, we cloak the point (x, y) with a
surrounding circle. But if we generate such a circle, adversary can easily identify the location of
the user, as it may be centre of the circle. So we translate the real location of the user to a point
(x0, y0), and generate a pseudo circle with centre (x0, y0) as shown in figure 3. The radius of the
pseudo circle is chosen in such a way that the real location (x, y) of the mobile user must be
anywhere within the circle. Let R be the radius of the Self cloaked circle, decided by each user.
In order to find a random point (x0, y0), we randomly choose a distance value r, where r <= R,
and an angle θ, where 0<= θ <= 2П.
Figure 3. Self Cloaking
The real location (x, y) of the user is transformed into another location by using simple polar to
rectangular coordinate conversion equation x = r cos θ, y = r sin θ
Then, the transformed location (x0, y0) is obtained by x0 = x + r Cos θ
y0 = y + r Sin θ, where r <= R
.
(x, y)
(x0, y0)
r
R
θ
7. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
141
The cloaked area, with radius R, then can be calculated. This ensures that the original location
of the mobile user is within or on the boundary of the newly created obfuscated circle with
centre (x0, y0). The algorithm for generating a self cloaked area by a user is given below.
Algorithm 1: ComputeSCA
Input:
x0 , y0 : Centre of the GCA circle
RGCA : Radius of GCA
Ref : xi , yi , R
Ref : within (Boolean)
Output:
xi : x-coordinate of the obfuscated user position
yi : y-coordinate of the obfuscated user position
R : Radius of SCA ( Obfuscated circle)
1. x x-coordinate of the user position from GPS
2. y y-coordinate of the user position from GPS
3. Let r ( Random value where 0< r ≤ R
4. θ ( Random value where 0 ≤ θ ≤ 2П
5. R ( Required radius of the obfuscated circle (SCA)
6. xi = x + r cos θ
7. yi = y + r sin θ
8. within Return ‘True’ if the spatial ‘within’ operation of SCA with GCA (RGCA as
radius), else return ‘False’
9. return xi, yi, R, within as reference
10. Return true if spatial within operation is true
3.2 Generating GCA
Figure 4. Globally Cloaked Area
R
(xo, yo)
.
(x1, y1)
.
(x2, y2)
.
(x3, y3)
.
(x4, y4)
.
8. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
142
Let Kl and Kh be lowest and highest anonymity level of the query initiator j. Also let Rl and
Rh be the lowest and highest radius of the circular area which the query initiator wants to
obfuscate, which we call the Globally Cloaked Area (GCA) as shown in figure 4. R is selected
in such a way that it balances the K-anonymity and an optimal area which includes all other K-1
self cloaked peers. At the first step, the Query initiator sends a message to all its 1-hop peers
requesting its pseudonym, the obfuscated origin (xpi, yPi) of the Self Cloaked Area (SCA) and
the radius of SCA; if SCA of the peer Pi is within the Globally Cloaked Area (GCA).
Initially the message is sent down to all 1-hop peers with a value R. If the query initiator
fails to find sufficient number of SCAs within the limits of GCA, query initiator either
decrement the value of K or it increments the value of R. This process continues until the value
of K >= Kl and the value of R reaches Rh.
3.3 The Greedy Algorithm
We present an algorithm to compute the Globally Cloaked Area of the query initiator j. This
is Greedy algorithm which executes until the desired level of anonymity is obtained. Assume
that K is the desired anonymity level of j and Rl and Rh be the lowest and highest radius of the
Globally Cloaked Area. i.e., the area of Globally Cloaked Area is пRl
2
≤ GCA ≤ пRh
2
. To
compute the GCA, we have to find the smallest circle r that encloses a K-subset (including j’s
SCA) from the n SCAs. The SCA of a user i is described by its obfuscated centre (xi, yi) and the
radius ri. If the initial GCA with radius Rl and query initiators obfuscated centre (x0,y0), is not
able to contain all K-1 SCAs then the value of R (Radius of GCA) is incremented in each step
until Rl reaches the value Rh. We have developed a greedy-based algorithm (GBA) with a time
complexity of O(h), where h is the hop count. Initially the message is broadcasted to all 1-hop
peers. All peers receiving this message, computes its own SCA, perform a spatial ‘within’
operation with GCA (The ‘within’ predicate in spatial geometry returns t (TRUE) if the first
geometry is completely inside the second geometry). If the result of the ‘Within’ operation is
true, then function returns the obfuscated centre of the SCA, and the radius of the SCA. The
numbers of SCAs are counted after each hop iteration, if the number of SCAs are below the K-
anonymity level, then we increment the hop and continue the process until the system desired
parameter hmax is reached.
Algorithm 2: Compute GCA
Input:
hmax : The maximum hop count
K : The anonymity level
Rl : The minimum radius of the GCA
Rh : The maximum radius of the GCA
x0, y0 : Obfuscated coordinates of Query initiator
Output: A, The Globally Cloaked Area of the Query initiator that covers K-SCAs
1. A α
2. Let S(Pseudo ID, x0, y0, Boolean Result) be the set of SCA
3. S α
4. Compute SCA of Query initiator
5. x0 X-coordinate of the centre of SCA of Query initiator
6. y0 Y coordinate of the centre of SCA of Query initiator
7. AGCA Initial Area of GCA with circle Rl
8. for R = Rl to Rh step 1 do
9. for h = 1 to hmax step 1 do
9. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
143
i. if Compute SCA = true then add SCA to S
ii. Count Total count of Peers after Computing their SCAs and within the
geometrical boundary of AGCA
b. if Count < K then continue else stop
10. if count < K the continue to step 8 else stop
11. Stop
Once the Optimal GCA has been computed, the query initiator randomly finds a query
requestor from the set of available peers within the GCA. The query initiator performs a random
selection operation over the set of n SCAs to select a query requestor to forward the query on
behalf of query initiator to the LBS server. The peers are addressed with their pseudonyms that
are sent back from peers, during the process of computing SCAs. The query is then forwarded to
the query requestor, and it is submitted to the LBS server with GCA. Since the GCA is an
obfuscated area, adversary may find it difficult to locate the query initiator. Moreover all IPs are
encrypted with their pseudonyms. The LBS server returns a list of results applicable for this
GCA. From this set of result the query initiator filter the values that he is interested in.
4. EXPERIMENTAL EVALUATION
We evaluate our system with Greedy based GCA computation in [5]. We adopted the
selection metric from two classes: processing time at the query initiator (finding the GCA and
the peers participating in the process) and peer response time for the query from the query
initiator. This can be decomposed as the sum of communications delay (CD) and Query
initiator’s processing time (QP). Peer response time (TR) is the sum of the time required to
calculate its cloaked area (TC) and the communication overhead (CD). i.e., (TR = TC + CD). As
both of the systems assume the same communication delay, this may be approximated as TR ≈
TC. To compare the performance, we define average peer response time metric as shown in table
1.
Table 1: Definition of average peer response time
As our system employs a simple transformation method to obfuscate peer location, the average
response time comparatively less that other methods as shown in figure 5. The processing time
QP is less compared to the methods in [5], because, the greedy algorithm that forms the GCA to
meet K-anonymity, is run at the query initiator, whereas in our method, this process has been
distributed among individual peers. The time complexity of the processing time for the greedy
algorithm of GGC in [5] is O(n log n) where as our system the time complexity is O(h) where h
is the hop of the peers that are included in the GCA. We set our simulation for experiments in
this article on a Pentium 2.8 GHz and 1 GB RAM with varying K and R for GCA. For all K the
system has shown remarkable performance compared to GGC in [5], because all SCA
computation and the selection of optimal GCA are done at peers simultaneously, instead of
computing at the system of query initiator. Figure 5 shows the average response time for GGC
and for our system. We assume that the distributions of objects are normal. Figure 6 shows the
computational cost for generating GCA for a set of 50 users. Since, in our system, the SCAs are
n No. of peers
ti Time that Query initiator requested the peer i
tj Time that Query initiator received the result from peer i
AvgRT Average response time, computed as ∑(ti - tj) / n
10. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
144
calculated at the peers, the value of the anonymity level K or the numbers of peer does not affect
Figure 5. Response time for K subset of 25 SCAs
the total computational cost. All the computations are distributed and are executed in our system
simultaneously. Where as in the case GGC the GCA is calculated by the query initiator and the
computational cost of GCA is directly proportional to the value of K and the number of peers n.
Figure 6. Computational cost for a subset of 25 SCAs
11. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
145
5. CONCLUSION
In this paper, we have presented a distributed location obfuscation method, to protect location
privacy for Location Based services (LBS). In this case, the query initiator does not want to trust
anyone including the peers and any third party service providers. Even peers do not reveal their
exact locations, instead presents only their Self cloaked Areas. The system we presented fully
distributes all computations, and even GCA calculation is done at peers. We have also presented
algorithms which needs less computation time at the query initiator, compared to our previous
works, due to the fully distributed approach. We also evaluated our system with different size of
K-anonymity level and shows good accuracy and optimal results.
We plan to extend our work, with a network assisted approach, where the numbers of
participating peers are less than the anonymity level K. We are also investigating the possibility
of moving peers and dynamic Self Cloaked Areas (SCA).
REFERENCES
[1] J. Al-Muhtadi, R. H. Campbell, A. Kapadia, M. D. Mickunas, and S. Yi. “Routing Through the
Mist: Privacy Preserving Communication in Ubiquitous Computing Environments”, In Proc. of
ICDCS02, pages 74-83. IEEE Computer Society, 2002.
[2] C. Bettini, S. Mascetti, and X. S. Wang. Privacy protection through anonymity in location-based
services. To appear in Handbook of Database Security: Applications and Trends, Springer, 2007.
[3] Yan Sun, Thomas F. La Porta, and Parviz Kermani, “A Flexible Privacy-Enhanced Location-
Based Services System Framework and Practice,” IEEE Transactions On Mobile Computing,
Vol. 8, No.3, Mar. 2009, pp. 304-321.
[4] Lin Yao1, Chi Lin1, Xiangwei Kong, Feng Xia1, Guowei Wu1, “A Clustering-based
Location Privacy Protection Scheme for Pervasive Computing”, 2010 IEEE/ACM International
Conference on Green Computing and Communications & 2010 IEEE/ACM International
Conference on Cyber, Physical and Social Computing.
[5] Tanzima Hashem∗, Lars Kulik, Don’t trust anyone’’: Privacy protection for location-based
services, Pervasive and Mobile Computing 7 (2011) 44–59
[6] F. Gandon and N. M. Sadeh. A Semantic E-Wallet to Reconcile Privacy and Context Awareness.
In Proc. Of ISWC03, volume 2870 of LNCS, pages 385{401. Springer, 2003.
[7] R. Wishart, K. Henricksen, and J. Indulska. Context obfuscation for privacy via ontological
descriptions. In Proc. of First Int. Workshop on Location- and Context-Awareness (LoCA),
volume 3479 of LNCS, pages 276-288. Springer, 2005.
[8] 2PASS: Bandwidth-Optimized Location Cloaking for Anonymous Location-Based Services
Haibo Hu, and Jianliang Xu, Senior Member, IEEE
[9] M. Gruteser, D. Grunwald, Anonymous usage of location-based services through spatial and
temporal cloaking, in: MobiSys’03: Proc. of the 1st Int. Conf. on Mobile Systems, Applications
and Services, 2003, pp. 31–42.
[10] M.F. Mokbel, C.-Y. Chow, W.G. Aref, The new casper: query processing for location services
without compromising privacy, in: VLDB’06: Proc. of the 32nd Int. Conf. on Very Large Data
Bases, 2006, pp. 763–774.
[11] B. Gedik, L. Liu, Protecting location privacy with personalized k-anonymity: architecture and
algorithms, IEEE Transactions on Mobile Computing 7 (1) (2008) 1–18.
[12] P. Kalnis, G. Ghinita, K. Mouratidis, D. Papadias, Preventing location-based identity inference
in anonymous spatial queries, IEEE Transactions on Knowledge and Data Engineering 19 (12)
(2007) 1719–1733.
[13] B. Gedik, L. Liu, Location privacy in mobile systems: a personalized anonymization model, in:
ICDCS’05: Proc. of the 25th IEEE Int. Conf. on Distributed Computing Systems, 2005, pp. 620–
629.
[14] C. Bettini, X. Wang, S. Jajodia, Protecting privacy against location-based personal identification,
in: SDM’05, Proc. of the 2nd VLDB Workshop on Secure Data Management, 2005, pp. 185–
199.
[15] A taxonomy of approaches to preserve location privacy in location-based services Ali
Khoshgozaran and Cyrus Shahabi
[16] SAMARATI, P. 2001. Protecting respondents’ identities in microdata release. IEEE Trans.
Knowl Data Engin. 13, 6, 1010–1027.
12. International Journal of Network Security & Its Applications (IJNSA), Vol.4, No.2, March 2012
146
[17] SWEENEY, L. 2002a. Achieving k-anonymity privacy protection using generalization and
suppression. Inter. J. Uncert. Fuzz. Knowl.-Based Syst. 10, 5, 571–588.
[18] SWEENEY, L. 2002b. k-anonymity: A model for protecting privacy. Inter. J. Uncert. Fuzz.
Knowl.-Based Syst. 10, 5, 557–570.
[19] DUCKHAM, M. AND KULIK, L. 2005. A formal model of obfuscation and negotiation for
location privacy. In Proceedings of the International Conference on Pervasive Computing.
[20] Chow, C., Mokbel, M. and Liu, X. (2006) ‘A peer-to-peer spatial cloaking algorithm for
anonymous location-based service’, GIS, pp.171–178.
[21] Ghinita, G., Kalnis, P. and Skiadopoulos S. (2007b) ‘PRIVE: anonymous location-based queries
in distributed mobile systems’, WWW, pp.371–380.
[22] Ghinita, G., Kalnis, P. and Skiadopoulos, S. (2007c) ‘MobiHide: a mobile peer-to-peer system
for anonymous location-based queries’, SSTD, pp.221–238.
[23] Agusti Solanas, Josep Domingo-Ferrer, and Antoni Mart´ınez-Ballest (2008) ‘Location Privacy
in Location-Based Services: Beyond TTP-based Schemes’
[24] Muhamed Ilyas & R. Vijayakumar (2010) ‘A Proxy based Framework for Efficient Range Query
Processing in a Cellular Network’, I.J. Information Tech. and Comp. Sc., 2, 1-8.
[25] Sridhar Subramanian and Baskaran Ramachandran (2012), ‘Trust Based Scheme for QoS
Assurance in Mobile Ad-Hoc Networks’, International Journal of Network Security & Its
Applications (IJNSA), Vol.4, No.1
Authors
Muhamed Ilyas received his MCA degree from University of Kerala, Trivandrum, India. He is currently
pursuing his PhD degree in the School of Computer Science, Mahatma Gandhi University, Kottayam,
Kerala, India, under the guidance of Dr. R. Vijayakumar. His research interests include next-generation
wireless system architectures, design and evaluation of location and service management schemes in
mobile computing environments, and mobile database systems. He is a member of the ACM
Dr. R. Vijayakumar, working as Professor in the School of Computer Science, Mahatma Gandhi
University, Kottayam, Kerala, India had completed 25 years of teaching career. His graduation is in B.Sc
(Electrical Engineering) from College of Engineering, Trivandrum in 1984; and his M.Tech Degree in
Computer Science & Engineering is from IIT Bombay in 1992. He was awarded the first Ph. D in
Computer Science and Engineering in the faculty of Engineering from University of Kerala in 2000.
Published 47 papers in National levels, International levels and journals in various fields of Parallel
Distributed Processing and applications He is a consultant of Co-operative bank/Govt. institutions
computerization and banking software/Hardware. He was member of Board of studies for Under Graduate
and Post graduate studies in Kannur University and Mahatma Gandhi University, Kerala. Being the
Senate Member of Calicut University, Kerala he is Chairman of Board of examiners in Computer Science
and related subjects in Universities in South India. Completed sponsored projects of Govt. of Kerala and
institutions in Kerala in the fields of Computer Network and applications. Apart from these he is research
guide in Mahatma Gandhi University, Kerala and Anna University, Coimbatore, India.