CN105307111A - Position privacy protection method based on incremental neighbour inquiry - Google Patents
Position privacy protection method based on incremental neighbour inquiry Download PDFInfo
- Publication number
- CN105307111A CN105307111A CN201410317993.5A CN201410317993A CN105307111A CN 105307111 A CN105307111 A CN 105307111A CN 201410317993 A CN201410317993 A CN 201410317993A CN 105307111 A CN105307111 A CN 105307111A
- Authority
- CN
- China
- Prior art keywords
- query
- space
- user
- point
- inquiry
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a position privacy protection method based on incremental neighbour inquiry. The position privacy protection method respectively comprises the following three steps: (1), structuring an anonymous area; (2), estimating an inquiry point; and (3), performing incremental neighbour inquiry. The position privacy protection method is used for protecting the position privacy by adopting an incremental neighbour inquiry algorithm in combination with a road network environment under a P2P system structure. The position privacy protection method disclosed by the invention has the advantages that: a user structures the anonymous area by referring to the density of a road network at first while seeking a proxy user; a real position is replaced by the anonymous area, such that the position privacy requirement is ensured; to reduce communication expenses of an inquiry user and a position server, the position server stores a divided basic unit space by using a quadtree structure; the inquiry user estimates the position of the inquiry point according to the distribution condition of interest points, such that a returned result set satisfies requirements of the inquiry user while the communication expenses are controllable; and a requirement space range and an inquiry end condition are redefined, such that an inquiry range can cover a k neighbour result range expected by the inquiry user when the incremental neighbour inquiry taking the inquiry point as the circle centre achieves the inquiry end condition.
Description
Technical field
The present invention relates to the method for secret protection of a kind of mobile terminal in location Based service, specifically a kind of by increment NN Query, assailant cannot be inferred user's accurate location is with the method for protective position privacy.
Background technology
In recent years, along with popularizing fast of intelligent mobile terminal, the development of wireless communication technology, location Based service (LocationBasedService, LBS) penetrates into the every aspect of people's life.LBS refers to that mobile terminal utilizes various location technology to obtain oneself current position, and proposes the service relevant with customer location.This service brings great convenience to the life of people, changes the life style of people subtlely.Along with the fast development of LBS, location privacy problem receives the concern of people day by day.Such as when from my nearest hospital where user enjoys K-NN search " ", in the process of the service such as shortest path query " the nearest path in XX dining room ", assailant, by intercepting and capturing the Query Information of user, can infer the personal information, positional information etc. that user.This causes grave danger to the privacy of individual subscriber, and thus location privacy protection problems demand solves.
System configuration for location privacy protection can be divided into client server architecture, central server structure, mobile P 2 P structure etc.Wherein, 1) adopt the method for client server architecture to have assumed name based on k anonymity, user sends k positional information to location server, comprises actual position and the individual false position of k-1 of user, makes location server cannot tell the actual position of user.User can also construct the anonymous zone comprising customer location, and the location server anonymous zone of submitting to according to user cannot the accurate location at consumer positioning place.Client server architecture is easy to realize, but mobile terminal must possess powerful computing capability and storage capacity, and only utilize the knowledge of self to carry out anonymity, the positional information of other user in surrounding enviroment cannot be utilized, so the attack of not only easy person under attack, and the waste of shareable resource can be caused.2) researcher proposes position k anonymity technology based on central server structure, namely when user proposes the demand of location-based service, not directly send the single LBS comprising self accurate location to ask location server, but have employed anonymous server, this anonymous server is collected the request of k neighboring user and is constructed anonymous zone and send to location server.Because anonymous server constantly need carry out anonymity process and Query Result refinement, its burden is excessive, and when anonymous server victim controls or attack time, can bring serious privacy leakage problem to whole system.3) mobile P 2 P structure does not need static infrastructure, when user proposes service request, select an equity point at random by multihop routing to act on behalf of, then this equity point sends to server the service request of user, server returns query results to this equity point, and this equity point finally returns to inquiring user Query Result.This architecture is applicable in the mobile network without static infrastructure, but it assumes that each equity point is trusty, and when there is assailant in equity point, the location privacy protection of user is just difficult to ensure.
Therefore existing technology and scheme oneself through being difficult to the requirement meeting user, the active position method for secret protection studied under suitable system configuration becomes a urgent problems day by day.
Summary of the invention
The reciprocity mobile subscriber for oneself providing P2P to serve is believable to the present invention is directed to both cannot ensureing of existing in background technology; cannot ensure again as we provide the location server of inquiry service to be believable, so the object of the present invention is to provide a kind of method for secret protection can provide comparatively safe secret protection in the system configuration of untrusted.
The technical scheme realizing the object of the invention is: a kind of based on increment NN Query location privacy protection method, the method comprises the following steps:
A kind of location privacy protection method based on increment NN Query of the present invention, it uses P2P system configuration, and inquiring user agency by agreement user completes inquiry request, and considers the impact of road network environment on Query Result.The method that the present invention proposes has the following advantages compared with the existing method SpaceTwist based on increment NN Query:
1) inquiring user replaces actual position to initiate inquiry request to proxy user with anonymous zone.Mobile P 2 P structure can not ensure that each equity point is believable, request will be sent to proxy user when initiating inquiry request by user, in order to the privacy threats preventing incredible proxy user from bringing, first user will construct anonymous zone before seeking proxy user, replace actual position to ensure location privacy demand with anonymous zone, and inquiring user consider road mileage factor when constructing anonymous zone.
2) by estimating that the point of interest of each anonymous zone determines query point position.Proxy user initiates the increment NN Query centered by query point to location server, in SpaceTwist scheme, query point is Stochastic choice, inquiry communication-cost and the uncontrollable problem of query results can be brought like this, consider the impact of road mileage on Query Result herein, by the query point of estimation road mileage determination increment NN Query.
3) increment NN Query can cover the k neighbour range of results that inquiring user is expected.After determining query point, proxy user proposes increment NN Query to location server, herein the increment NN Query in SpaceTwist scheme is improved, change the definition of demand space and the condition of poll-final, make query context can cover the k neighbour range of results of inquiring user expectation.
Accompanying drawing explanation
Fig. 1 is system construction drawing of the present invention.
Fig. 2 is two-dimensional space cross segmentation figure of the present invention.
Fig. 3 is increment NN Query critical condition figure of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the present invention is further described.
As shown in Figure 1, a kind of location privacy protection method based on increment NN Query of the present invention, its system configuration is made up of mobile subscriber, base station and location server.Each mobile terminal possesses basic positioning function, and can not only be communicated with location server by mobile base station, can also carry out P2P communicate with other users, and what wherein initiate inquiry request is that inquiring user (is designated as
), receive inquiring user request and what carry out increment NN Query with location server is that proxy user (is designated as
).Location server provides the services such as location-based NN Query, range query.
Particularly, the location privacy protection method based on increment NN Query of the present invention, it is mainly divided into three key steps:
Step one: anonymous zone constructs
P2P network can not ensure proxy user
confidence level, so at inquiring user
when sending LBS inquiry, to proxy user
the inquiry request proposed can not comprise the accurate location of user.The anonymous zone building method that the present invention proposes with reference to road mileage, because road mileage and the density of population have positive correlation, the local density of population that road network is intensive is also corresponding larger.
1, inquiry request is defined
, inquiring user
with
form to proxy user
initiate inquiry request, wherein
represent user identifier;
=
represent inquiring user
the centre point latitude and longitude coordinates of anonymous zone;
represent anonymous zone radius;
represent inquiring user
the query point of the increment NN Query estimated;
represent inquiring user
inquiry request content;
2, proxy requests is defined
, proxy user
with
form send agents query request to location server, wherein
represent the identifier of proxy user;
represent from inquiry request
the query point of the increment NN Query of middle acquisition;
represent from inquiry request
the inquiring user of middle acquisition
inquiry request content;
3, road network granularity is defined
if,
for any one region, subspace in plane space region,
for
girth,
for
interior road total length, then define
for
road network granularity;
In order to easily implement and without loss of generality, we are considered as a square G the two-dimensional space that location server is responsible for, and then carry out cross recursive subdivision G, until the square space be divided into
be not more than a set-point, as shown in Figure 2.Inquiring user
first the segmentation result to G is obtained from location server before location server sends LBS request.
In order to reduce inquiring user
with the communication overhead of location server, we use quad-tree structure to store these elementary cell spaces, the corresponding block comminute region of each node in quaternary tree, and the information such as link length in storage area center point coordinate, the region length of side, region in the data field of each node, regional center point coordinates, the region length of side are for determining corresponding cut zone, and in region, link length is for estimating query point.The corresponding elementary cell space of quad-tree structure leaf node, nonleaf node is to the region in requisition for continuation segmentation.Inquiring user
obtain this quaternary tree of recursive search after segmentation result, find the unitary space at oneself place, and using the circumscribed circle region of this unitary space as inquiring user
anonymous zone.
Step 2: query point is estimated
The increment NN Query that the present invention proposes requires that query results maintains a metastable scale, ensures that the result set returned meets inquiring user while making communication-cost controlled
requirement.Query point evaluation method is: inquiring user
to sending inquiry theme (as restaurant, hospital etc.) during location server request region segmentation result to location server, while location server return area segmentation quaternary tree, attach the density factor of this theme on data set
(interest point that the road of unit length distributes); According to density factor
the interest point distributed in each unitary space is calculated with the link length of unitary space; Hunting zone is expanded to surrounding, until the interest point of estimation meets the demand of inquiring user in hunting zone centered by the unitary space at place, anonymous zone; Construct the minimum circumscribed circle of this hunting zone, using any point on this circumscribed circle as query point, can solve like this query point apart from anonymous zone excessive or cross minor issue.
Step 3: increment NN Query
Definition supply space: with query point
for the circular space in the center of circle, its radius
for the Query Result that returns recently and query point
distance.
Definition demand space: with inquiring user
anonymous zone there is phase concentric
circular space, its radius R is that location server returns Query Result
to the center of circle, anonymous zone
distance, wherein
for in the Query Result that returned closest to the center of circle
simultaneously and the center of circle
distance be greater than query point again
with the center of circle
the Query Result point of distance, namely
meet:
Ensure that demand space is not less than inquiring user like this
the k neighbour range of results expected, wherein
represent the current number of results returned of location server,
represent arbitrary Query Result wherein, minimum value is got in min () expression,
distance between representing at 2.
Increment NN Query process: proxy user
receive inquiring user
inquiry request after form proxy requests
and send proxy requests
to location server; Proxy user
initialization supply space radius
be 0, initial reguirements space radius R is
, calculate query point
to the demand space center of circle
distance
; Location server is with query point
centered by carry out NN Query and continuous result returned to proxy user
; Proxy user
calculate the Query Result and query point that return
distance, upgrade supply space radius
; Proxy user
calculate the distance at Query Result and the center, anonymous zone returned
if,
be greater than
and being less than current demand space radius R, then the space radius R that upgrades demand makes it equal
; Each renewal supply space radius
after demand space radius R, check whether satisfied
if meet, supply space comprises demand space, poll-final completely.
According to the critical condition that can obtain the description of increment NN Query process as shown in Figure 3.Now
with
meet
.It should be noted that poll-final condition can not ensure
just in time be positioned on broken circle as shown in Figure 3,
be actually the outer Query Result closest to broken circle of broken circle, can ensure that query context covers like this
reduce query context as best one can while the k neighbour range of results expected, reduce communication overhead.
Claims (5)
1., based on a location privacy protection method for increment NN Query, its system configuration is made up of mobile subscriber, base station and location server, it is characterized in that: the method comprises the following steps:
Step one: anonymous zone constructs
1) inquiry request is defined
, inquiring user
with
form to proxy user
initiate inquiry request, wherein
represent user identifier;
=
represent inquiring user
the centre point latitude and longitude coordinates of anonymous zone;
represent anonymous zone radius;
represent inquiring user
the query point of the increment NN Query estimated;
represent inquiring user
inquiry request content;
2) proxy requests is defined
, proxy user
with
form send agents query request to location server, wherein
represent the identifier of proxy user;
represent from inquiry request
the query point of the increment NN Query of middle acquisition;
represent from inquiry request
the inquiring user of middle acquisition
inquiry request content;
3) road network granularity is defined
if,
for any one region, subspace in plane space region,
for
girth,
for
interior road total length, then define
for
road network granularity;
Step 2: query point is estimated
Inquiring user
to sending inquiry theme during location server request region segmentation result to location server, while location server return area segmentation quaternary tree, attach the density factor of this theme on data set
; According to density factor
the interest point distributed in each unitary space is calculated with the link length of unitary space; Hunting zone is expanded to surrounding, until the interest point of estimation meets the demand of inquiring user in hunting zone centered by the unitary space at place, anonymous zone;
Step 3: increment NN Query
Definition supply space: with query point
for the circular space in the center of circle, its radius
for the Query Result that returns recently and query point
distance;
Definition demand space: with inquiring user
anonymous zone there is phase concentric
circular space, its radius R is that location server returns Query Result
to the center of circle, anonymous zone
distance, wherein
for in the Query Result that returned closest to the center of circle
simultaneously and the center of circle
distance be greater than query point again
with the center of circle
the Query Result point of distance, namely
meet:
Ensure that demand space is not less than inquiring user like this
the k neighbour range of results expected, wherein
represent the current number of results returned of location server,
represent arbitrary Query Result wherein, minimum value is got in min () expression,
distance between representing at 2.
2. a kind of location privacy protection method based on increment NN Query according to claim 1; it is characterized in that: in step 2; the two-dimensional space that location server is responsible for is considered as a square G, then carries out cross recursive subdivision G, until the square space be divided into
be not more than a set-point, inquiring user
first the segmentation result to G is obtained from location server before location server sends LBS request.
3. a kind of location privacy protection method based on increment NN Query according to claim 1 and 2, it is characterized in that: in step 2, location server uses quad-tree structure to store the elementary cell space be divided into, the corresponding block comminute region of each node in quaternary tree, and storage area center point coordinate in the data field of each node, the region length of side, link length information in region, regional center point coordinates, the region length of side is for determining corresponding cut zone, in region, link length is for estimating query point, the corresponding elementary cell space of quad-tree structure leaf node, nonleaf node is to the region in requisition for continuation segmentation, inquiring user
obtain this quaternary tree of recursive search after segmentation result, find the unitary space at oneself place, and using the circumscribed circle region of this unitary space as inquiring user
anonymous zone.
4. a kind of location privacy protection method based on increment NN Query according to claim 1, is characterized in that: in step 3, inquiring user
increment NN Query scope is estimated, using the minimum circumscribed circle center of circle of this scope as increment NN Query query point according to the distributed quantity of point of interest in each elementary cell space.
5. a kind of location privacy protection method based on increment NN Query according to claim 1, is characterized in that: in step 3, proxy user
receive inquiring user
inquiry request after form proxy requests
and send proxy requests
to location server; Proxy user
initialization supply space radius
be 0, initial reguirements space radius R is
, calculate query point
to the demand space center of circle
distance
; Location server is with query point
centered by carry out NN Query and continuous result returned to proxy user
; Proxy user
calculate the Query Result and query point that return
distance, upgrade supply space radius
; Proxy user
calculate the distance at Query Result and the center, anonymous zone returned
if,
be greater than
and being less than current demand space radius R, then the space radius R that upgrades demand makes it equal
; Each renewal supply space radius
after demand space radius R, check whether satisfied
if meet, supply space comprises demand space, poll-final completely.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410317993.5A CN105307111A (en) | 2014-07-07 | 2014-07-07 | Position privacy protection method based on incremental neighbour inquiry |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410317993.5A CN105307111A (en) | 2014-07-07 | 2014-07-07 | Position privacy protection method based on incremental neighbour inquiry |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105307111A true CN105307111A (en) | 2016-02-03 |
Family
ID=55203768
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410317993.5A Pending CN105307111A (en) | 2014-07-07 | 2014-07-07 | Position privacy protection method based on incremental neighbour inquiry |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105307111A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105791283A (en) * | 2016-02-29 | 2016-07-20 | 电子科技大学 | Circle range search method specific to encrypted spatial data |
| CN106372670A (en) * | 2016-09-06 | 2017-02-01 | 南京理工大学 | Loyalty index prediction method based on improved nearest neighbor algorithm |
| CN107133527A (en) * | 2017-04-20 | 2017-09-05 | 河南科技大学 | A kind of personalized recommendation method based on location privacy protection |
| CN107172095A (en) * | 2017-07-05 | 2017-09-15 | 重庆邮电大学 | Customer location method for secret protection under a kind of road network environment based on longitude and latitude grid |
| CN107204984A (en) * | 2017-06-22 | 2017-09-26 | 石家庄铁道大学 | A kind of location privacy protection method and system |
| CN107204988A (en) * | 2017-06-28 | 2017-09-26 | 华南理工大学 | A kind of location privacy protection method under the structure based on P2P |
| CN107729494A (en) * | 2017-10-18 | 2018-02-23 | 北京中遥地网信息技术有限公司 | A kind of POI search methods based on the mapping of Z-type space curve |
| CN107835241A (en) * | 2017-11-02 | 2018-03-23 | 辽宁工业大学 | A kind of secret protection region construction method in road network environment under Continuous Nearest Neighbors Inquiry |
| CN108632401A (en) * | 2018-03-14 | 2018-10-09 | 中国互联网络信息中心 | Reduce the anonymous querying method and system of privacy compromise on DNS recursion servers |
| CN109858279A (en) * | 2019-01-16 | 2019-06-07 | 安徽师范大学 | Based on the k nearest Neighbor for trusting excitation and location privacy protection |
| CN110248315A (en) * | 2019-04-24 | 2019-09-17 | 广东工业大学 | A kind of location privacy protection method based on double anchor points |
| CN110611667A (en) * | 2019-09-02 | 2019-12-24 | 深圳市赛梅斯凯科技有限公司 | Dynamic position privacy protection method and device in edge computing environment |
| CN111061824A (en) * | 2019-11-27 | 2020-04-24 | 北京中交兴路信息科技有限公司 | Range judgment method, device and equipment based on improved quadtree |
| CN111597462A (en) * | 2020-05-14 | 2020-08-28 | 河南科技大学 | Position neighbor query method based on differential privacy |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102595319A (en) * | 2012-03-12 | 2012-07-18 | 浙江大学 | Method for protecting user position privacy in mobile peer-to-peer network |
| CN103037306A (en) * | 2012-12-06 | 2013-04-10 | 南京邮电大学 | Privacy protection method based on location service in scene of Internet of Things (IOT) |
| CN103249038A (en) * | 2013-04-09 | 2013-08-14 | 哈尔滨工程大学 | Privacy protection method based on location of moving object in road network space |
| US20140090023A1 (en) * | 2012-09-27 | 2014-03-27 | Hong Kong Baptist University | Method and Apparatus for Authenticating Location-based Services without Compromising Location Privacy |
-
2014
- 2014-07-07 CN CN201410317993.5A patent/CN105307111A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102595319A (en) * | 2012-03-12 | 2012-07-18 | 浙江大学 | Method for protecting user position privacy in mobile peer-to-peer network |
| US20140090023A1 (en) * | 2012-09-27 | 2014-03-27 | Hong Kong Baptist University | Method and Apparatus for Authenticating Location-based Services without Compromising Location Privacy |
| CN103037306A (en) * | 2012-12-06 | 2013-04-10 | 南京邮电大学 | Privacy protection method based on location service in scene of Internet of Things (IOT) |
| CN103249038A (en) * | 2013-04-09 | 2013-08-14 | 哈尔滨工程大学 | Privacy protection method based on location of moving object in road network space |
Non-Patent Citations (2)
| Title |
|---|
| 彭瑞卿: "移动网络中的位置隐私保护方法研究", 《武汉大学2013年博士学位论文》 * |
| 毛典辉，蔡强，李海生，黄今慧: "协作代理增量查询的LBS隐私保护方法", 《华中科技大学学报（自然科学版）》 * |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105791283A (en) * | 2016-02-29 | 2016-07-20 | 电子科技大学 | Circle range search method specific to encrypted spatial data |
| CN105791283B (en) * | 2016-02-29 | 2018-09-21 | 电子科技大学 | A kind of circular scope searching method for encrypted spatial data |
| CN106372670A (en) * | 2016-09-06 | 2017-02-01 | 南京理工大学 | Loyalty index prediction method based on improved nearest neighbor algorithm |
| CN107133527B (en) * | 2017-04-20 | 2019-10-29 | 河南科技大学 | A kind of personalized recommendation method based on location privacy protection |
| CN107133527A (en) * | 2017-04-20 | 2017-09-05 | 河南科技大学 | A kind of personalized recommendation method based on location privacy protection |
| CN107204984A (en) * | 2017-06-22 | 2017-09-26 | 石家庄铁道大学 | A kind of location privacy protection method and system |
| CN107204984B (en) * | 2017-06-22 | 2020-05-19 | 石家庄铁道大学 | Position privacy protection method and system |
| CN107204988A (en) * | 2017-06-28 | 2017-09-26 | 华南理工大学 | A kind of location privacy protection method under the structure based on P2P |
| CN107204988B (en) * | 2017-06-28 | 2020-05-22 | 华南理工大学 | Position privacy protection method based on P2P structure |
| CN107172095A (en) * | 2017-07-05 | 2017-09-15 | 重庆邮电大学 | Customer location method for secret protection under a kind of road network environment based on longitude and latitude grid |
| CN107172095B (en) * | 2017-07-05 | 2020-04-28 | 重庆邮电大学 | Method for protecting user position privacy in road network environment based on graticule |
| CN107729494A (en) * | 2017-10-18 | 2018-02-23 | 北京中遥地网信息技术有限公司 | A kind of POI search methods based on the mapping of Z-type space curve |
| CN107835241A (en) * | 2017-11-02 | 2018-03-23 | 辽宁工业大学 | A kind of secret protection region construction method in road network environment under Continuous Nearest Neighbors Inquiry |
| CN107835241B (en) * | 2017-11-02 | 2021-05-07 | 辽宁工业大学 | Privacy protection area construction method under continuous neighbor query in road network environment |
| CN108632401A (en) * | 2018-03-14 | 2018-10-09 | 中国互联网络信息中心 | Reduce the anonymous querying method and system of privacy compromise on DNS recursion servers |
| CN109858279A (en) * | 2019-01-16 | 2019-06-07 | 安徽师范大学 | Based on the k nearest Neighbor for trusting excitation and location privacy protection |
| CN109858279B (en) * | 2019-01-16 | 2022-07-08 | 安徽师范大学 | K nearest neighbor query method based on trust incentive and position privacy protection |
| CN110248315A (en) * | 2019-04-24 | 2019-09-17 | 广东工业大学 | A kind of location privacy protection method based on double anchor points |
| CN110611667A (en) * | 2019-09-02 | 2019-12-24 | 深圳市赛梅斯凯科技有限公司 | Dynamic position privacy protection method and device in edge computing environment |
| CN110611667B (en) * | 2019-09-02 | 2022-04-12 | 锦图计算技术(深圳)有限公司 | Dynamic position privacy protection method and device in edge computing environment |
| CN111061824A (en) * | 2019-11-27 | 2020-04-24 | 北京中交兴路信息科技有限公司 | Range judgment method, device and equipment based on improved quadtree |
| CN111061824B (en) * | 2019-11-27 | 2023-07-25 | 北京中交兴路信息科技有限公司 | Range judging method, device and equipment based on improved quadtree |
| CN111597462A (en) * | 2020-05-14 | 2020-08-28 | 河南科技大学 | Position neighbor query method based on differential privacy |
| CN111597462B (en) * | 2020-05-14 | 2022-03-29 | 河南科技大学 | Position neighbor query method based on differential privacy |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105307111A (en) | Position privacy protection method based on incremental neighbour inquiry | |
| US9736685B2 (en) | Cloaking with footprints to provide location privacy protection in location-based services | |
| CN107251624B (en) | Location determination of mobile devices | |
| Pingley et al. | Cap: A context-aware privacy protection system for location-based services | |
| Hashem et al. | “Don’t trust anyone”: Privacy protection for location-based services | |
| Wicker | The loss of location privacy in the cellular age | |
| Pingley et al. | A context-aware scheme for privacy-preserving location-based services | |
| CN104580350B (en) | The system and method determined for position | |
| Chow et al. | Privacy in location-based services: a system architecture perspective | |
| CN105246072A (en) | User position privacy protection method under road network environment and system thereof | |
| JP2014531587A (en) | Positioning based on georeference of mobile devices | |
| Victor et al. | Geofences on the blockchain: Enabling decentralized location-based services | |
| Che et al. | A dual-active spatial cloaking algorithm for location privacy preserving in mobile peer-to-peer networks | |
| Ullah et al. | A novel model for preserving location privacy in Internet of Things | |
| Ashraf et al. | State-of-the-art Challenges: Privacy Provisioning in TPP Location Based Services Systems | |
| Ashraf et al. | IDP: A privacy provisioning framework for TIP attributes in trusted third party-based location-based services systems | |
| Song et al. | Efficient dummy generation for considering obstacles and protecting user location | |
| Miura et al. | A hybrid method of user privacy protection for location based services | |
| Gao et al. | Location privacy protection algorithm for mobile networks | |
| Che et al. | SALS: semantics-aware location sharing based on cloaking zone in mobile social networks | |
| Konstantinidis et al. | Towards planet-scale localization on smartphones with a partial radiomap | |
| Kasori et al. | Location privacy protection considering the location safety | |
| Miura et al. | Evaluation of a hybrid method of user location anonymization | |
| Li et al. | A decentralized location-query-sensitive cloaking algorithm for LBS | |
| Salem et al. | 3rd party geolocation messaging: a positioning enabler middleware for realizing context-aware polling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160203 |