CN108449335B - A kind of location-based service method for secret protection and system based on range cover - Google Patents
A kind of location-based service method for secret protection and system based on range cover Download PDFInfo
- Publication number
- CN108449335B CN108449335B CN201810212081.XA CN201810212081A CN108449335B CN 108449335 B CN108449335 B CN 108449335B CN 201810212081 A CN201810212081 A CN 201810212081A CN 108449335 B CN108449335 B CN 108449335B
- Authority
- CN
- China
- Prior art keywords
- range
- query
- user
- inquiry
- cover
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000010276 construction Methods 0.000 claims abstract description 25
- 230000009466 transformation Effects 0.000 claims description 8
- 230000000875 corresponding effect Effects 0.000 description 50
- 230000008859 change Effects 0.000 description 9
- 230000002633 protecting effect Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 3
- 238000007418 data mining Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004321 preservation Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 101100391182 Dictyostelium discoideum forI gene Proteins 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000001681 protective effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of location-based service method for secret protection covered based on range and systems.The method covers scale sequence, makes its satisfaction: the inquiring position sequence of user query scale sequence for user query scale sequence, construction inquiryThe inquiring position sequence for covering scale sequence with inquiry meets the constraint of position enquiring relevance；The inquiry covers corresponding subsequence in scale sequence and meets cover range accuracy；The inquiry covers corresponding subsequence in scale sequence and meets cover range high efficiency；The inquiry covers corresponding subsequence in scale sequence and meets cover wide security.The system comprises the location privacy protection servers being arranged between user terminal and location server；For for given user query scale sequence, construction inquiry to cover scale sequence, submits to location server and obtain return query result, screen as the query result within the scope of user query and return to user.The present invention has effectively achieved LBS inquiry secret protection.
Description
Technical field
The invention belongs to networks to service secret protection technical field, more particularly, to a kind of position covered based on range
Set service privacy protection method and system.
Background technique
With the development of wireless communication and mobile positioning technique, more and more mobile devices have GPS positioning function
Can, so that location-based service (LBS) increased popularity, it is had become towards one of most promising service of mobile subscriber.LBS refers to base
The geographical location information provided by positioning of mobile equipment function, it is typical for the various information query service that user provides
Using map class application, such as Google Maps, and the inquiry based on point of interest is specifically included that, convenience store nearby is such as inquired.Mesh
Before, LBS achieves immense success in social commercial field, it was reported that global LBS relative commercial application annual earnings have surpassed
Cross 15,000,000,000 dollars.It is asked safely however, LBS while bringing huge convenient to individual, has also caused serious location privacy
Topic.Because user is when obtaining location-based service, it usually needs report their current geographic position, i.e. inquiring position.These positions
Confidence ceases highly sensitive privacy, and the personal whereabouts of user can be accurately inferred to using them.These sensitive individual subscriber whereabouts
Be leaked to insincere third party, such as LBS provider, will certainly the location privacy to user constitute serious threat safely.LBS
The concern that is just causing people increasingly extensive of location privacy safety problem, how to be effectively protected the LBS location privacy peace of user
A urgent problem to be solved is had become entirely.
In order to protect the location privacy safety of LBS, researcher has been presented for many methods, comprising: assumed name method, fuzz method,
Enciphered method and dummy argument method etc..(1) assumed name method refer to by LBS inquire in the assumed name that is temporarily constructed with one of user identifier replace,
To cut off the connection between user and inquiry.However, assumed name method is subject to the threat of data mining, and due to user's body
Part is hidden, this is also an obstacle to the application of authentication is needed.(2) fuzz method refers to extensive (using hidden area) or disturbs
Location information in dynamic (using noise) user query, so that attacker can not identify user's specific location.Due to issuing clothes
Be engaged in device is modified inquiry, and the accuracy of service can be reduced when many.In addition, assumed name method and fuzz method generally rely on
In trusted third party's anonymous server, this is easy to cause performance bottleneck and privacy bottleneck.(3) enciphered method refers to by using encryption
Technology makes user query completely invisible to server, thus achieve the purpose that secret protection, it is typical as being based on privacy information
Retrieve the LBS enciphered method of (PIR).But enciphered method usually require that change server LBS algorithm, and need additional hardware and
The support of complicated algorithm reduces the actual availability of method.(4) dummy argument method is before inquiry is exposed to server, in advance
Dummy argument is added, and dummy argument inquiry and true inquiry are submitted together, so that server is difficult to obtain user's actual position.This kind of skill
Art depends on the construction quality of dummy argument, is prone to the supposition attack based on data distribution characteristics.
In conclusion effective LBS location privacy method for security protection needs to meet the requirement of the following aspects.(1)
The safety for guaranteeing user location privacy, even if that is, attacker has grasped priori knowledge abundant, it is also difficult to from LBS search sequence
In be inferred to the actual position track of user.(2) guarantee the accuracy of the final LBS query result of mobile subscriber, i.e. comparison introduces
The front and back of Privacy Preservation Mechanism, the finally obtained service result of user should be consistent.(3) actual availability of LBS is not damaged,
I.e. Privacy Preservation Mechanism does not require to change the LBS algorithm of server end, does not need additional hardware supported, will not look into LBS
The execution efficiency of inquiry, which constitutes conspicuousness, to be influenced.Wherein, it is desirable that (2) and (3) is required actually to require location privacy protection method
Client user and server end LBS algorithm are realized fully transparent.The more safe and reliable and availability height there is still a need for exploitation
Position enquiring method for secret protection and system.
Summary of the invention
Aiming at the above defects or improvement requirements of the prior art, the present invention provides a kind of position clothes covered based on range
It is engaged in method for secret protection and system, its object is to cover range by construction inquiry, before location-based service high efficiency is controllable
It puts, effective protection location-based service personal secrets, thus solves to need exist for developing more safe and reliable and availability height
Position enquiring method for secret protection and the technical issues of system.
To achieve the above object, according to one aspect of the present invention, a kind of location-based service covered based on range is provided
Method for secret protection, for given user query scale sequenceRange sequence is covered in construction inquiry
ColumnSo that the inquiry covers scale sequence and meets the following conditions simultaneously:
Condition 1, the inquiring position sequence of user query scale sequenceThe inquiring position sequence of scale sequence is covered with inquiryMeet the constraint of position enquiring relevance, it may be assumed that
For the inquiring position sequence of user query scale sequenceIts corresponding inquiry is covered
The inquiring position sequence of lid scale sequenceWhereinCorresponding Lk, one of constraint below:
Constraint 1, ifThere are LaAnd LbFor same position,Corresponding person isWithThenWithIt is same
Position, it may be assumed that
Or
Constraint 2, ifThere are LaAnd LbBelong to the band of position that level is rItsCorresponding person isWithThenWithBelong to the band of position that level is rThat is:
Wherein, the band of position, that is, position units set possesses a level for any position region D, is denoted as r；
Condition 2, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover range accuracy, i.e., arbitrarilyMeet
Condition 3, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and covers range high efficiency；
Condition 4, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and covers wide security.
Preferably, the location-based service method for secret protection covered based on range, the condition 3 are i.e. anyMeetWherein ρ is to cover range high efficiency threshold value；
WhereinFor location-based service efficiency caused by location privacy protection, calculate as follows:
Wherein: Pk@R is the arbitary inquiry P of user query scale sequencekQuery context circular scope radius,Corresponding subsequence in scale sequence is covered for inquiryQuery context circular scope radius.
Preferably, the location-based service method for secret protection covered based on range, the condition 4 are i.e. anyMeetWherein μ is to cover wide security threshold value；
WhereinIt is user location privacy in the safety coefficient of server end, calculates as follows:
Wherein: Pk@L is the arbitary inquiry P of user query scale sequencekQuery context central point,For inquiry
Cover corresponding subsequence in scale sequenceQuery context central point, For user query range sequence
The arbitary inquiry P of columnkQuery context central point and inquiry cover scale sequence in corresponding subsequenceQuery context
The distance between central point, α are distance threshold.
Preferably, the location-based service method for secret protection covered based on range, inquiry cover range according to
Following method construct:
(1) user's current queries range P, user's history query context sequence data acquisition: are obtained And user's history query context sequenceScale sequence is covered in corresponding inquiry
(2) position enquiring relevance constrains: for the user's history query context sequence obtained in step (1)In appoint
One inquiry Pk, k=1,2 ..., n:
As the central point P of its query contextkIt is when@L is identical as the central point P@L of user's current queries range, then described to go through
Inquiry P in history query context sequencekThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionMake
Range P is covered for user's current queries range P respective queries*Inquiring position, it may be assumed that
Or
The level r=1,2 of the band of position is traversed ..., rm, the band of position D for being r for arbitrary levels, when it is wrapped simultaneously
P containing present scope and historical query range Pk, then user's current queries range P respective queries cover range P*Fall in the history
Query context PkHistory cover rangeThe level at place is the band of position D of r*In；
To obtain position enquiring relevance constraint condition: user's current queries range P respective queries cover range P*For
Central point isQuery context or in level be r band of position D*In；
(3) obtain candidate query range set: obtain it is all meet in step (2) or position enquiring relevance constraint item
Part, the set for covering range accuracy, covering range high efficiency and covering the query context of wide securityEven if
:
(4) it obtains inquiry and covers range: the candidate query range set that step (3) are obtained, preferential according to safety,
The search strategy that high efficiency is preferential or harmony is preferential, search user's current queries range P respective queries cover range P*；
As the search strategy search user current queries range P respective queries cover range P preferential according to safety*When,
User's current queries range P respective queries cover range P*User location in the candidate query range set obtained for step (3)
Safety coefficient highest candidate query range of the privacy in server end, it may be assumed that
As the search strategy search user current queries range P respective queries cover range P preferential according to high efficiency*When,
User's current queries range P respective queries cover range P*Location privacy in the candidate query range set obtained for step (3)
The highest candidate query range of location-based service efficiency caused by protection, it may be assumed that
When according to harmonious preferential search strategy search user's current queries range P respective queries cover range P*When,
User's current queries range P respective queries cover range P*User location in the candidate query range set obtained for step (3)
Privacy is in the safety coefficient of server end and the maximum candidate query range of the product of location-based service efficiency, it may be assumed that
Preferably, the structure of range is covered in the location-based service method for secret protection covered based on range, the inquiry
The method of making further comprises the steps of:
(5) query context is covered in stochastic transformation: for the cover query context P obtained in step (4)*=(P*@L,P*@
R), by the radius for covering query context be extended at random 1.0~1.2 times and as after expansion cover query context radius,
Cover query context after obtaining random expanded scope, the cover query context as user query range P construction.
Other side according to the invention provides a kind of location-based service intimacy protection system covered based on range,
It includes the location privacy protection server being arranged between user terminal and location server；The location privacy protection service
Device is trusted client, for for given user query scale sequenceConstruction inquiry is covered
Scale sequenceInquiry cover scale sequence is submitted into location server, and obtains position
It sets server and returns to query result, the query result is screened as the query result within the scope of user query, and return to use
Family.
Scale sequence is covered in the inquiryMeet the following conditions simultaneously:
Condition 1, the inquiring position sequence of user query scale sequenceThe inquiring position sequence of scale sequence is covered with inquiryMeet the constraint of position enquiring relevance, it may be assumed that
For the inquiring position sequence of user query scale sequenceIts corresponding inquiry is covered
The inquiring position sequence of lid scale sequenceWhereinCorresponding Lk, one of constraint below:
Constraint 1, ifThere are LaAnd LbFor same position,Corresponding person isWithThenWithIt is same
Position, it may be assumed that
Or
Constraint 2, ifThere are LaAnd LbBelong to the band of position that level is rItsCorresponding person isWith
ThenWithBelong to the band of position that level is rThat is:
Wherein, the band of position, that is, position units set possesses a level for any position region D, is denoted as r；
The level in region is higher, and the position that it includes is also more.
Condition 2, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover range accuracy, i.e., arbitrarilyMeet
Condition 3, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and covers range high efficiency；
Condition 4, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and covers wide security.
Preferably, the location-based service intimacy protection system covered based on range, the condition 3 are i.e. anyMeetWherein ρ is to cover range high efficiency threshold value；
WhereinFor location-based service efficiency caused by location privacy protection, calculate as follows:
Wherein: Pk@R is the arbitary inquiry P of user query scale sequencekQuery context circular scope radius,Corresponding subsequence in scale sequence is covered for inquiryQuery context circular scope radius.
Preferably, the location-based service intimacy protection system covered based on range, the condition 4 are i.e. anyMeetWherein μ is to cover wide security threshold value；
WhereinIt is user location privacy in the safety coefficient of server end, calculates as follows:
Wherein: Pk@L is the arbitary inquiry P of user query scale sequencekQuery context central point,For inquiry
Cover corresponding subsequence in scale sequenceQuery context central point, For user query range sequence
The arbitary inquiry P of columnkQuery context central point and inquiry cover scale sequence in corresponding subsequenceQuery context
The distance between central point, α are distance threshold.
Preferably, the location-based service intimacy protection system covered based on range, the position covered based on range
Set service intimacy protection system, comprising:
Data acquisition module, for obtaining user's current queries range P, user's history query context sequenceAnd user's history query context sequenceScale sequence is covered in corresponding inquiry
Position enquiring relevance constraints module, the data for being obtained according to data acquisition module generate inquiry relevance about
Beam condition: user's current queries range P respective queries cover range P*Centered on point beQuery context or be in layer
The secondary band of position D for r*In；It is preferred that including the first submodule and second submodule；First submodule is used to look into when it
Ask the central point P of rangekWhen@L is identical as the central point P@L of user's current queries range, then the historical query scale sequence
In inquiry PkThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionAs user's current queries
Range P respective queries cover range P*Inquiring position, it may be assumed thatThe second submodule is for traversing position
The level r=1,2 in region is set ..., rm, the band of position D for being r for arbitrary levels, when it includes simultaneously present scope P and is gone through
History query context Pk, then user's current queries range P respective queries cover range P*Fall in the historical query range PkHistory
Cover rangeThe level at place is the band of position D of r*In；
Candidate query range set obtains module, for obtaining all satisfaction inquiry relevance constraint conditions, covering range
Accuracy, the set covered range high efficiency and cover the query context of wide securityI.e. so that:
Inquiry covers range and obtains module, for from candidate query range set, according to the search strategy that user selects,
It searches for user's current queries range P respective queries and covers range P*；It include: safety first search submodule, for according to peace
The preferential search strategy search user's current queries range P respective queries of full property cover range P*: by candidate query range set
Middle user location privacy is corresponding as user's current queries range P in the highest candidate query range of safety coefficient of server end
Range P is covered in inquiry*；High efficiency first search submodule, for current according to the preferential search strategy search user of high efficiency
Query context P respective queries cover range P*: by the highest candidate query model of location-based service efficiency in candidate query range set
It encloses and covers range P as user's current queries range P respective queries*；Harmonious first search submodule, for according to harmony
Preferential search strategy search user's current queries range P respective queries cover range P*: it will be used in candidate query range set
Family location privacy is worked as in the safety coefficient of server end and the highest candidate query range of the product of location-based service efficiency as user
Preceding query context P respective queries cover range P*。
Preferably, the location-based service intimacy protection system covered based on range, the position covered based on range
Set service intimacy protection system, further includes: stochastic transformation module is looked into for covering the cover that range acquisition module obtains to inquiry
Ask range P*=(P*@L,P*@R), the radius for covering query context is extended to 1.0~1.2 times at random and as covering after expansion
The radius of lid query context, the cover query context after obtaining random expanded scope, the cover as user query range P construction
Query context.
In general, through the invention it is contemplated above technical scheme is compared with the prior art, can obtain down and show
Beneficial effect:
Method and system energy provided by the invention: (1) guaranteeing the safety of location privacy, i.e. attacker is difficult to according to priori
Knowledge analyzes the true inquiring position or query context of user from LBS request sequence.(2) guarantee the efficient of location-based service
Property, i.e. secret protection will not influence too much the overall performance of location-based service.(3) guarantee the accuracy of location-based service, i.e.,
Before and after comparing secret protection, the location-based service result that user obtains is consistent.(4) availability of protective position service, i.e., it is hidden
Private protection does not change the LBS algorithm of server-side, does not change existing LBS framework, does not change the existing use habit of user yet.
Detailed description of the invention
Fig. 1 is the location-based service intimacy protection system structural schematic diagram provided by the invention covered based on range；
Fig. 2 is the location-based service method for secret protection query result schematic diagram provided by the invention covered based on range.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.As long as in addition, technical characteristic involved in the various embodiments of the present invention described below
Not constituting a conflict with each other can be combined with each other.
Present invention meaning LBS inquiry is represented by E=(U, A, T, P), in which: U is user label；A is querying attributes
(such as hospital, hotel)；T is corresponding timestamp when submitting inquiry；P is inquiring position and relevant parameter.Inquiry request E association
Query context P be represented by a border circular areas, i.e. P is represented by P=(P@L, P@R), wherein P@L indicate range center
Point position, P R indicate the radius of circular scope.The location service request that query context sequence is initiated whithin a period of time by user
The query context contained is constituted, and can be denoted asWherein, Pk(k=1,2 ..., n) indicate one
Query context.The query context center that inquiring position sequence is contained by the location service request that user initiates whithin a period of time
Point is constituted, and can be denoted asWherein, Lk=Pk@L indicates an inquiring position.
The location-based service method for secret protection provided by the invention covered based on range, specifically: for given user
Query context sequenceScale sequence is covered in construction inquiry So that
The inquiry covers scale sequence and meets the following conditions simultaneously:
Condition 1, the inquiring position sequence of user query scale sequenceThe inquiring position sequence of scale sequence is covered with inquiryMeet the constraint of position enquiring relevance, it may be assumed that
For the inquiring position sequence of user query scale sequenceIts corresponding inquiry is covered
The inquiring position sequence of lid scale sequenceWhereinCorresponding Lk, one of constraint below:
Constraint 1, ifThere are LaAnd LbFor same position,Corresponding person isWithThenWithIt is same
Position, it may be assumed that
Or
Constraint 2, ifThere are LaAnd LbBelong to the band of position that level is rItsCorresponding person isWith
ThenWithBelong to the band of position that level is rThat is:
Wherein, the band of position, that is, position units set possesses a level for any position region D, is denoted as r；
The level in region is higher, and the position that it includes is also more, possesses highest level rmThe band of position, that is, entire map, belong to
The band of position same level r collection is combined intoIt meets following characteristics:
Feature 1, any two same level band of position are non-intersecting, it may be assumed that
Feature 2, any two same level region area is equal, i.e. (wherein, AR indicates region area):
The union of feature 3, all same level bands of position is equal to map itself, it may be assumed that
Feature 4, arbitrary region are both contained in the region of some higher, it may be assumed that
In fact, there is the associations of very strong position between the inquiry request that same user is initiated whithin a period of time
Property.Be mainly manifested in, these inquiry requests usually surround several fixations position or region (such as user's residence or unit) and send out
It rises.The attacker for knowing abundant background knowledge is easy to know the rule of this relevance between user query position, and accordingly
Come reduce privacy methods construction cover range area, to reduce user location privacy in the safety of insincere server end
Property.Illustrate the problem below by way of a simply example.Assuming that attacker has grasped, user is in two different time points
The inquiry request submitted surrounds the same fixed position and initiates (being assumed to be P L).Assuming that privacy methods are the two requests
Constructing the cover range generated is respectivelyWithDue to covering rangeWithIt must satisfy location-based service accuracy, because
This,So according to priori knowledge, attacker it may be concluded that
Therefore, range is covered to be reduced into the protecting effect of position personal secretsI.e. in query service twice, attacker
Eliminable cover range is respectively as follows:WithSo that defining the 4 cover models provided
It encloses safety and is unable to get guarantee.
Therefore to consider the relevance problem between user query position, i.e., the position initiated whithin a period of time with user
Inquiry request sequence is research unit, so that should also show to accord between the center for the cover scale sequence that construction generates
It shares family and really inquires the position relevance of rule (for example, in the preceding example, covering rangeWithSimilarly surround phase
It is initiated with position, i.e.,), so that attacker is difficult to reduce cover range, reduce the guarantor for covering range
Protect effect.
Condition 2, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover range accuracy, i.e., arbitrarilyMeet
Condition 3, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover range high efficiency, i.e., arbitrarilyMeetWherein ρ is to cover
Lid range high efficiency threshold value；
WhereinFor location-based service efficiency caused by location privacy protection, calculate as follows:
Wherein: Pk@R is the arbitary inquiry P of user query scale sequencekQuery context circular scope radius,Corresponding subsequence in scale sequence is covered for inquiryQuery context circular scope radius.
Condition 4, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover wide security, i.e., arbitrarilyMeetWherein μ is to cover
Lid wide security threshold value；
WhereinIt is user location privacy in the safety coefficient of server end, calculates as follows:
Wherein: Pk@L is the arbitary inquiry P of user query scale sequencekQuery context central point,For inquiry
Cover corresponding subsequence in scale sequenceQuery context central point, For user query range sequence
The arbitary inquiry P of columnkQuery context central point and inquiry cover scale sequence in corresponding subsequenceQuery context
The distance between central point, α are distance threshold, when cover range centerWith user query position PkDistance between@L is super
When crossing the threshold value, attacker can not know the true inquiring position of user or range substantially, and the safety of location privacy reaches at this time
Peak (i.e. 1.0).
The inquiry is covered range and can be constructed as follows:
(1) user's current queries range P, user's history query context sequence data acquisition: are obtained And user's history query context sequenceScale sequence is covered in corresponding inquiry
(2) position enquiring relevance constrains: for the user's history query context sequence obtained in step (1)In appoint
One inquiry Pk, k=1,2 ..., n:
As the central point P of its query contextkIt is when@L is identical as the central point P@L of user's current queries range, then described to go through
Inquiry P in history query context sequencekThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionMake
Range P is covered for user's current queries range P respective queries*Inquiring position, it may be assumed that
Or
The level r=1,2 of the band of position is traversed ..., rm, the band of position D for being r for arbitrary levels, when it is wrapped simultaneously
P containing present scope and historical query range Pk, then user's current queries range P respective queries cover range P*Fall in the history
Query context PkHistory cover rangeThe level at place is the band of position D of r*In；
To obtain position enquiring relevance constraint condition: user's current queries range P respective queries cover range P*For
Central point isQuery context or in level be r band of position D*In；
(3) obtain candidate query range set: obtain it is all meet in step (2) or position enquiring relevance constraint item
Part, the set for covering range accuracy, covering range high efficiency and covering the query context of wide securityEven if
:
(4) it obtains inquiry and covers range: the candidate query range set that step (3) are obtained, preferential according to safety,
The search strategy that high efficiency is preferential or harmony is preferential, search user's current queries range P respective queries cover range P*；
As the search strategy search user current queries range P respective queries cover range P preferential according to safety*When,
User's current queries range P respective queries cover range P*User location in the candidate query range set obtained for step (3)
Safety coefficient highest candidate query range of the privacy in server end, it may be assumed that
When covering range P* according to the preferential search strategy search user's current queries range P respective queries of high efficiency,
User's current queries range P respective queries cover range P*Location privacy in the candidate query range set obtained for step (3)
The highest candidate query range of location-based service efficiency caused by protection, it may be assumed that
When according to harmonious preferential search strategy search user's current queries range P respective queries cover range P*When,
User's current queries range P respective queries cover range P*User location in the candidate query range set obtained for step (3)
Privacy is in the safety coefficient of server end and the maximum candidate query range of the product of location-based service efficiency, it may be assumed that
It preferably, in order to further improve the security, further include that query context is covered in step (5) stochastic transformation: for step
Suddenly the cover query context P obtained in (4)*=(P*@L,P*@R), the radius for covering query context is extended to 1.0 at random~
1.2 times and the radius as the cover query context after expansion, cover query context after obtaining random expanded scope, as with
The cover query context of family query context P construction.
It is provided by the invention based on range cover location-based service intimacy protection system, as shown in Figure 1, include setting with
Location privacy protection server between family terminal and location server；The location privacy protection server is credible client
End, for for given user query scale sequence Scale sequence is covered in construction inquiryInquiry cover scale sequence is submitted into location server, and obtains location server
Query result is returned, the query result is screened as the query result within the scope of user query, and return to user.
Scale sequence is covered in the inquiryMeet the following conditions simultaneously:
Condition 1, the inquiring position sequence of user query scale sequenceThe inquiring position sequence of scale sequence is covered with inquiryMeet the constraint of position enquiring relevance, it may be assumed that
For the inquiring position sequence of user query scale sequenceIts corresponding inquiry is covered
The inquiring position sequence of lid scale sequenceWhereinCorresponding Lk, one of constraint below:
Constraint 1, ifThere are LaAnd LbFor same position,Corresponding person isWithThenWithIt is same
Position, it may be assumed that
Or
Constraint 2, ifThere are LaAnd LbBelong to the band of position that level is rItsCorresponding person isWith
ThenWithBelong to the band of position that level is rThat is:
Wherein, the band of position, that is, position units set possesses a level for any position region D, is denoted as r；
The level in region is higher, and the position that it includes is also more.
Condition 2, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover range accuracy, i.e., arbitrarilyMeet
Condition 3, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover range high efficiency, i.e., arbitrarilyMeetWherein ρ is to cover
Lid range high efficiency threshold value；
WhereinFor location-based service efficiency caused by location privacy protection, calculate as follows:
Wherein: Pk@R is the arbitary inquiry P of user query scale sequencekQuery context circular scope radius,Corresponding subsequence in scale sequence is covered for inquiryQuery context circular scope radius.
Condition 4, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding sub- sequence in scale sequence
ColumnMeet and cover wide security, i.e., arbitrarilyMeetWherein μ is to cover
Lid wide security threshold value；
WhereinIt is user location privacy in the safety coefficient of server end, calculates as follows:
Wherein: Pk@L is the arbitary inquiry P of user query scale sequencekQuery context central point,For inquiry
Cover corresponding subsequence in scale sequenceQuery context central point, For user query range sequence
The arbitary inquiry P of columnkQuery context central point and inquiry cover scale sequence in corresponding subsequenceQuery context
The distance between central point, α are distance threshold, when cover range centerWith user query position PkDistance between@L is super
When crossing the threshold value, attacker can not know the true inquiring position of user or range substantially, and the safety of location privacy reaches at this time
Peak (i.e. 1.0).
Preferably, the location-based service intimacy protection system covered based on range, comprising:
Data acquisition module, for obtaining user's current queries range P, user's history query context sequenceAnd user's history query context sequenceScale sequence is covered in corresponding inquiry
Position enquiring relevance constraints module, the data for being obtained according to data acquisition module generate inquiry relevance about
Beam condition: user's current queries range P respective queries cover range P*Centered on point beQuery context or be in layer
The secondary band of position D for r*In；It is preferred that including the first submodule and second submodule；First submodule is used to look into when it
Ask the central point P of rangekWhen@L is identical as the central point P@L of user's current queries range, then the historical query scale sequence
In inquiry PkThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionAs user's current queries
Range P respective queries cover range P*Inquiring position, it may be assumed thatThe second submodule is for traversing position
The level r=1,2 in region is set ..., rm, the band of position D for being r for arbitrary levels, when it includes simultaneously present scope P and is gone through
History query context Pk, then user's current queries range P respective queries cover range P*Fall in the historical query range PkHistory
Cover rangeThe level at place is the band of position D of r*In；
Candidate query range set obtains module, for obtaining all satisfaction inquiry relevance constraint conditions, covering range
Accuracy, the set covered range high efficiency and cover the query context of wide securityI.e. so that:
Inquiry covers range and obtains module, for from candidate query range set, according to the search strategy that user selects,
It searches for user's current queries range P respective queries and covers range P*；It include: safety first search submodule, for according to peace
The preferential search strategy search user's current queries range P respective queries of full property cover range P*: by candidate query range set
Middle user location privacy is corresponding as user's current queries range P in the highest candidate query range of safety coefficient of server end
Range P is covered in inquiry*；High efficiency first search submodule, for current according to the preferential search strategy search user of high efficiency
Query context P respective queries cover range P*: by the highest candidate query model of location-based service efficiency in candidate query range set
It encloses and covers range P as user's current queries range P respective queries*；Harmonious first search submodule, for according to harmony
Preferential search strategy search user's current queries range P respective queries cover range P*: it will be used in candidate query range set
Family location privacy is worked as in the safety coefficient of server end and the highest candidate query range of the product of location-based service efficiency as user
Preceding query context P respective queries cover range P*。
It is preferred that the location-based service intimacy protection system covered based on range, further includes: stochastic transformation module, for pair
Inquiry covers range and obtains the cover query context P that module obtains*=(P*@L,P*@R), the radius for covering query context is random
It is extended to 1.0~1.2 times and the radius as the cover query context after expansion, the cover inquiry after obtaining random expanded scope
Range, the cover query context as user query range P construction.
The basic idea of the invention is that: client-based architecture passes through the location service request submitted for user
Construction generates a new location service request, and (wherein, the true query context of user is by well-designed " covering a range " institute
Substitution) so that insincere server end is difficult to know the true inquiring position of user.Finally, client is returned from server end
LBS result in filter out corresponding user's true request as a result, so that it is guaranteed that user can finally obtain accurate LBS inquiry
As a result.
Based on above-mentioned secret protection frame, introduce the user location privacy model towards LBS, its formal definitions privacy
Client is that user location services request constructs the constraint that the cover range generated need to meet in protect-ing frame structure, to ensure position
Set the safety of the high efficiency and location privacy of service.In addition, privacy model also contemplates inquiring position (i.e. in query context
The heart) between constraint, even if so that attacker has grasped the complete LBS request sequence that the rules of customer search Behavior and client are submitted
Column, are still difficult to analyze user location privacy, further ensure the safety of location privacy.
The following are embodiments:
Embodiment 1
A kind of location-based service method for secret protection covered based on range, specifically: for given user query range
SequenceScale sequence is covered in construction inquiry
For each current queries range P in given user query scale sequence, range is covered in corresponding inquiry
It can construct as follows:
(1) user's current queries range P, user's history query context sequence data acquisition: are obtained And user's history query context sequenceScale sequence is covered in corresponding inquiry
(2) position enquiring relevance constrains: for the user's history query context sequence obtained in step (1)In appoint
One inquiry Pk, k=1,2 ..., n:
As the central point P of its query contextkIt is when@L is identical as the central point P@L of user's current queries range, then described to go through
Inquiry P in history query context sequencekThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionMake
Range P is covered for user's current queries range P respective queries*Inquiring position, it may be assumed that
Or
The level r=1,2 of the band of position is traversed ..., rm, the band of position D for being r for arbitrary levels, when it is wrapped simultaneously
P containing present scope and historical query range Pk, then user's current queries range P respective queries cover range P*Fall in the history
Query context PkHistory cover rangeThe level at place is the band of position D of r*In；
To obtain position enquiring relevance constraint condition: user's current queries range P respective queries cover range P*For
Central point isQuery context or in level be r band of position D*In；
(3) obtain candidate query range set: obtain it is all meet in step (2) or position enquiring relevance constraint item
Part, the set for covering range accuracy, covering range high efficiency and covering the query context of wide securityEven if
:
(4) it obtains inquiry and covers range: the candidate query range set that step (3) are obtained, preferential according to safety,
The search strategy that high efficiency is preferential or harmony is preferential, search user's current queries range P respective queries cover range P*；
As the search strategy search user current queries range P respective queries cover range P preferential according to safety*When,
User's current queries range P respective queries cover range P*User location in the candidate query range set obtained for step (3)
Safety coefficient highest candidate query range of the privacy in server end, it may be assumed that
As the search strategy search user current queries range P respective queries cover range P preferential according to high efficiency*When,
User's current queries range P respective queries cover range P*Location privacy in the candidate query range set obtained for step (3)
The highest candidate query range of location-based service efficiency caused by protection, it may be assumed that
When according to harmonious preferential search strategy search user's current queries range P respective queries cover range P*When,
User's current queries range P respective queries cover range P*User location in the candidate query range set obtained for step (3)
Privacy is in the safety coefficient of server end and the maximum candidate query range of the product of location-based service efficiency, it may be assumed that
(5) query context is covered in stochastic transformation: for the cover query context P obtained in step (4)*=(P*@L,P*@
R), by the radius for covering query context be extended at random 1.0~1.2 times and as after expansion cover query context radius,
Cover query context after obtaining random expanded scope, the cover query context as user query range P construction.
Constructing an inquiry cover range specific steps can be used following pseudocode expression:
Based on above-mentioned location privacy protection frame and model, specific Optimization Solution algorithm is provided.It operates in credible client
End, the location service request sequence structure that can be submitted for user generate one group of new request sequence for meeting the constraint of privacy Model Condition
Column, meet LBS user location secret protection demand well.
By theory analysis and experimental evaluation, the validity of privacy model and privacy algorithm is verified:
The present embodiment method does not change the accuracy of location-based service, does not change existing location-based service algorithm, does not change yet
The existing platform architecture of location-based service.As shown in fig. 2, it can be seen that the present embodiment secret protection is to location-based service high efficiency
It influences to depend on covering range area, i.e., if ignoring the execution time of client privacy algorithm itself, introduces privacy and protect
After protection mechanism, the execution time needed for a location-based service about will be added to original m times, and wherein m is to cover range area
With the ratio of query context areaAnd cover range area and will affect the safety of location privacy, i.e. m value is got over
Greatly
Then the risk of privacy exposure is lower.So LBS performance loss caused by secret protection is linearly positively correlated with visitor
The cover range area of family end construction, thus performance loss is controllable, will not significantly reduce location-based service efficiency.Next this is analyzed
The safety of literary method.Below in conjunction with challenge model, point three kinds of situations consider.
(1) can attacker according to the cover range P of method construct*Itself deduce user query position P@L or inquiry
Range P? covering range P*In, user query range center has been replaced (range radius has also been extended), so that attack
Person is according to P*The probability value for deducing user query position P@L is equal to(wherein | P*| it is P*The position units quantity of covering),
I.e. probability value is extremely low.Since attacker does not know the radius P R of the true query context P of user, he deduces whole user in turn
The probability of query context P is also smaller.Certainly, if attacker has grasped algorithm copy and (grasped algorithm principle, and known
The road currently employed search strategy of algorithm and dependent thresholds parameter), it is known that the radius P@R of user query ranges, attacker
User query position P@L, which can be deduced, can probably fall in the outer ring for covering range P*, but determine the radius (sentence for covering range
4 and 10) when, algorithm joined a random value θ, so that the probability that attacker guesses user location P@L still minimum (is approximately equal to)。
(2) can attacker according to the cover scale sequence that client is submitted whithin a period of timeDeduce user's
Some inquiring position P@L or query context P? this is that attacker can grasp according to preparatory with afore-mentioned maximum difference
User query position relevance come reduce cover range area, improve the probability value for successfully deducing user location.Before such as
Example, attacker is according to priori knowledge it can be concluded that user query position P@L necessarily falls in two cover rangesWith
It is interior.At this point, cover range to the protecting effect of location privacy become forI.e. attacker deduces user query position
The probability value of P@L is equal toIfIt is much smaller thanOrExtreme influence imitates the cover of location privacy
Fruit.However, the cover range constructed also embodies this position well and closes since context of methods considers such case
Connection property (such as in front in example, covers rangeWithIt will meet), so that
OrI.e. attacker is difficult to reduce the protecting effect for covering range accordingly.
It (3), can be according to cover scale sequence after attacker's acquisition operates in the Privacy preserving algorithms copy of client
Deduce user query position P@L or query context P? at this point, attacker can input one by one to algorithm copy covers range
P*In each position units Lk∈P*(also assume that attacker has grasped currently employed search strategy and related threshold here
Value parameter), then can observation algorithm construct output and cover range P*.If it succeeds, showing LkIt is user's real user position
It sets.However, such trial can't succeed (and obtaining above-mentioned conclusion success), because our methods are covered in determination
Lid range P*Radius when, joined a random value θ (see sentence 4 and 10) so that twice it is identical input can also obtain not
Same output, or even if identical output, do not reach the identical conclusion of input yet.
Although in conclusion attacker knows background knowledge abundant, but be difficult to be recorded from server-side goes through
The inquiring position or range of user are identified in history inquiry, thus context of methods has preferable personal secrets.In addition, according to
The related work of chapters and sections 2, it will thus be seen that (1) assumed name method is subject to the threat of data mining, and hides user identity
Reduce the practicability of method；(2) fuzz method usually requires modification inquiry, this can reduce service accuracy to a certain degree, and
Performance bottleneck and privacy bottleneck are also easy to cause to the dependence of third party's anonymous server；(3) enciphered method has usually required that change
There is LBS algorithm, and need the support of additional hardware and complicated algorithm, reduces method practicability；(4) dummy argument method is prone to
Supposition attack based on data distribution characteristics, leads to poor safety.It is qualitative with existing methods that table 1 gives context of methods
Comparison result.As can be seen from Table 1: compared to existing method, context of methods is in safety, accuracy, high efficiency and availability
Possess better comprehensive performance, has effectively achieved LBS inquiry secret protection.
The qualitative comparison of 1 validity of table
| Comparative approach | Personal secrets | Service accuracy | Service high efficiency | Actual availability |
| Context of methods | It is good | It is good | Generally | It is good |
| Assumed name method | It is good | It is good | It is good | It is bad |
| Fuzz method | It is good | It is bad | It is good | It is good |
| Enciphered method | It is good | It is good | It is good | It is bad |
| Dummy argument method | Generally | It is good | Generally | It is good |
Embodiment 2
A kind of location-based service intimacy protection system covered based on range, as shown in Figure 1, include setting in user terminal and
Location privacy protection server between location server；The location privacy protection server be trusted client, for pair
In given user query scale sequenceScale sequence is covered in construction inquiryInquiry cover scale sequence is submitted into location server, and obtains location server
Query result is returned, the query result is screened as the query result within the scope of user query, and return to user；
The location-based service intimacy protection system covered based on range, comprising:
Data acquisition module, for obtaining user's current queries range P, user's history query context sequenceAnd user's history query context sequenceScale sequence is covered in corresponding inquiry
Position enquiring relevance constraints module, the data for being obtained according to data acquisition module generate inquiry relevance about
Beam condition: user's current queries range P respective queries cover range P*Centered on point beQuery context or be in layer
The secondary band of position D for r*In；Including the first submodule and second submodule；First submodule is used to work as its query context
Central point PkWhen@l is identical as the central point P@L of user's current queries range, then looking into the historical query scale sequence
Ask PkThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionAs user's current queries range P
Respective queries cover range P*Inquiring position, it may be assumed thatThe second submodule is for traversing the band of position
Level r=1,2 ..., rm, the band of position D for being r for arbitrary levels, when it includes simultaneously present scope P and historical query
Range Pk, then user's current queries range P respective queries cover range P*Fall in the historical query range PkHistory cover model
It enclosesThe level at place is the band of position D of r*In；
Candidate query range set obtains module, for obtaining all satisfaction inquiry relevance constraint conditions, covering range
Accuracy, the set covered range high efficiency and cover the query context of wide securityI.e. so that:
Inquiry covers range and obtains module, for from candidate query range set, according to the search strategy that user selects,
It searches for user's current queries range P respective queries and covers range P*；It include: safety first search submodule, for according to peace
The preferential search strategy search user's current queries range P respective queries of full property cover range P*: by candidate query range set
Middle user location privacy is corresponding as user's current queries range P in the highest candidate query range of safety coefficient of server end
Range P is covered in inquiry*；High efficiency first search submodule, for current according to the preferential search strategy search user of high efficiency
Query context P respective queries cover range P*: by the highest candidate query model of location-based service efficiency in candidate query range set
It encloses and covers range P as user's current queries range P respective queries*；Harmonious first search submodule, for according to harmony
Preferential search strategy search user's current queries range P respective queries cover range P*: it will be used in candidate query range set
Family location privacy is worked as in the safety coefficient of server end and the highest candidate query range of the product of location-based service efficiency as user
Preceding query context P respective queries cover range P*。
Stochastic transformation module obtains the cover query context P that module obtains for covering range to inquiry*=(P*@L,
P*@R), the radius for covering query context is extended to 1.0~1.2 times at random and as cover query context half after expansion
Diameter, the cover query context after obtaining random expanded scope, the cover query context as user query range P construction.
Be considered as at the present embodiment LBS server end it is incredible, it is the maximum target of attacker.It is assumed that attacking
The control that the person of hitting has been obtained for server end (assumes that attacker is hacker or the server admin for breaking through server
Member).The system architecture provided from Fig. 1, it will thus be seen that attacker can know that client submits all position enquiring sequences
(i.e. historical query sequence), but they are new search sequence (and the non-user covering construction by the privacy algorithm of client and generating
True search sequence).So location privacy protection method needs to prevent cover query context recognition sequence of the attacker from grasp
The true inquiring position (or query context) of mobile subscriber out.In addition, the attacker for obtaining LBS server end control possesses
Powerful ability, it possesses complete cartographic information, and is responsible for executing LBS algorithm, therefore attacker may grasp use
Many position enquirings rule at family, for example, user, which often likes, initiates service request etc. around the position which is fixed or region.
At this point, attacker can reduce according to this relevance between this user query position covers range.The ability of attacker
More than that, he may also be aware of the presence for operating in the LBS Privacy preserving algorithms of client, so he is also possible to obtain
The copy of Privacy preserving algorithms, then, the LBS search sequence that oneself will be grasped input Privacy preserving algorithms, and observe algorithm
Output covers range area as a result, reducing accordingly.
As it will be easily appreciated by one skilled in the art that the foregoing is merely illustrative of the preferred embodiments of the present invention, not to
The limitation present invention, any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should all include
Within protection scope of the present invention.
Claims (10)
1. a kind of location-based service method for secret protection covered based on range, which is characterized in that for given user query model
Enclose sequenceScale sequence is covered in construction inquiry So that the inquiry
It covers scale sequence and meets the following conditions simultaneously:
Condition 1, the inquiring position sequence of user query scale sequenceThe inquiring position sequence of scale sequence is covered with inquiry
Meet the constraint of position enquiring relevance, it may be assumed that
For the inquiring position sequence of user query scale sequenceModel is covered in its corresponding inquiry
Enclose the inquiring position sequence of sequenceWhereinCorresponding Lk, one of constraint below:
Constraint 1, ifThere are LaAnd LbFor same position,Corresponding person isWithThenWithFor same position
It sets, it may be assumed that
Or
Constraint 2, ifThere are LaAnd LbBelong to the band of position that level is rItsCorresponding person isWithThenWithBelong to the band of position that level is rThat is:
Wherein, the band of position, that is, position units set possesses a level for any position region D, is denoted as r；
Condition 2, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding subsequence in scale sequence
Meet and cover range accuracy, i.e., arbitrarilyMeet
Condition 3, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding subsequence in scale sequence
Meet and covers range high efficiency；
Condition 4, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding subsequence in scale sequence
Meet and covers wide security.
2. the location-based service method for secret protection covered as described in claim 1 based on range, which is characterized in that the condition
3 is i.e. anyMeetWherein ρ is to cover range high efficiency threshold value；
WhereinFor location-based service efficiency caused by location privacy protection, calculate as follows:
Wherein: Pk@R is the arbitary inquiry P of user query scale sequencekQuery context circular scope radius,For
Corresponding subsequence in scale sequence is covered in inquiryQuery context circular scope radius.
3. the location-based service method for secret protection covered as described in claim 1 based on range, which is characterized in that the condition
4 is i.e. anyMeetWherein μ is to cover wide security threshold value；
WhereinIt is user location privacy in the safety coefficient of server end, calculates as follows:
Wherein: Pk@L is the arbitary inquiry P of user query scale sequencekQuery context central point,It is covered for inquiry
Corresponding subsequence in scale sequenceQuery context central point, For user query scale sequence
Arbitary inquiry PkQuery context central point and inquiry cover scale sequence in corresponding subsequenceQuery context center
The distance between point, α is distance threshold；Pk@R is the arbitary inquiry P of user query scale sequencekQuery context round model
The radius enclosed,Corresponding subsequence in scale sequence is covered for inquiryQuery context circular scope radius.
4. the location-based service method for secret protection covered based on range as described in claims 1 to 3 any one, feature are existed
In the inquiry is covered range and constructed as follows:
(1) user's current queries range P, user's history query context sequence data acquisition: are obtained
And user's history query context sequenceScale sequence is covered in corresponding inquiry
(2) position enquiring relevance constrains: for the user's history query context sequence obtained in step (1)In any look into
Ask Pk, k=1,2 ..., n:
As the central point P of its query contextkWhen@L is identical as the central point P@L of user's current queries range, then the historical query
Inquiry P in scale sequencekThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionAs user
Current queries range P respective queries cover range P*Inquiring position, it may be assumed that
Or
The level r=1,2 of the band of position is traversed ..., rm, the band of position D for being r for arbitrary levels, when it includes simultaneously current
Range P and historical query range Pk, then user's current queries range P respective queries cover range P*Fall in the historical query model
Enclose PkHistory cover rangeThe level at place is the band of position D of r*In；
To obtain position enquiring relevance constraint condition: user's current queries range P respective queries cover range P*Centered on point
ForQuery context or in level be r band of position D*In；
(3) obtain candidate query range set: obtain it is all meet in step (2) or position enquiring relevance constraint condition,
The set for covering range accuracy, covering range high efficiency and covering the query context of wide securityI.e. so that:
Wherein, PR (P, P#) it is safety coefficient of the user location privacy in server end；μ is to cover wide security threshold value；EF
(P,P#) it is location-based service efficiency caused by location privacy protection；ρ is to cover range high efficiency threshold value；
(4) it obtains inquiry and covers range: the candidate query range set that step (3) are obtained, preferentially, efficiently according to safety
Property preferential or harmonious preferential search strategy, search user's current queries range P respective queries cover range P*；
As the search strategy search user current queries range P respective queries cover range P preferential according to safety*When, user works as
Preceding query context P respective queries cover range P*User location privacy exists in the candidate query range set obtained for step (3)
The highest candidate query range of the safety coefficient of server end, it may be assumed that
As the search strategy search user current queries range P respective queries cover range P preferential according to high efficiency*When, user works as
Preceding query context P respective queries cover range P*Location privacy protection institute in the candidate query range set obtained for step (3)
Caused by the highest candidate query range of location-based service efficiency, it may be assumed that
When according to harmonious preferential search strategy search user's current queries range P respective queries cover range P*When, user works as
Preceding query context P respective queries cover range P*User location privacy exists in the candidate query range set obtained for step (3)
The safety coefficient of server end and the maximum candidate query range of the product of location-based service efficiency, it may be assumed that
5. the location-based service method for secret protection covered as claimed in claim 4 based on range, which is characterized in that the inquiry
The building method for covering range further comprises the steps of:
(5) query context is covered in stochastic transformation: for the cover query context P obtained in step (4)*=(P*@L,P*@R), it will
Cover query context radius be extended at random 1.0~1.2 times and as after expansion cover query context radius, obtain with
Cover query context after machine expanded scope, the cover query context as user query range P construction.
6. a kind of location-based service intimacy protection system covered based on range, which is characterized in that including setting in user terminal and
Location privacy protection server between location server；The location privacy protection server be trusted client, for pair
In given user query scale sequence Scale sequence is covered in construction inquiryInquiry cover scale sequence is submitted into location server, and obtains location server
Query result is returned, the query result is screened as the query result within the scope of user query, and return to user.
Scale sequence is covered in the inquiryMeet the following conditions simultaneously:
Condition 1, the inquiring position sequence of user query scale sequenceThe inquiring position sequence of scale sequence is covered with inquiry
Meet the constraint of position enquiring relevance, it may be assumed that
For the inquiring position sequence of user query scale sequenceModel is covered in its corresponding inquiry
Enclose the inquiring position sequence of sequenceWhereinCorresponding Lk, one of constraint below:
Constraint 1, ifThere are LaAnd LbFor same position,Corresponding person isWithThenWithFor same position
It sets, it may be assumed that
Or
Constraint 2, ifThere are LaAnd LbBelong to the band of position that level is rItsCorresponding person isWithThenWithBelong to the band of position that level is rThat is:
Wherein, the band of position, that is, position units set possesses a level for any position region D, is denoted as r；Region
Level it is higher, the position that it includes is also more.
Condition 2, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding subsequence in scale sequence
Meet and cover range accuracy, i.e., arbitrarilyMeet
Condition 3, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding subsequence in scale sequence
Meet and covers range high efficiency；
Condition 4, for the arbitary inquiry P of user query scale sequencek, the inquiry covers corresponding subsequence in scale sequence
Meet and covers wide security.
7. the location-based service intimacy protection system covered as claimed in claim 6 based on range, which is characterized in that the condition
3 is i.e. anyMeetWherein ρ is to cover range high efficiency threshold value；
WhereinFor location-based service efficiency caused by location privacy protection, calculate as follows:
Wherein: Pk@R is the arbitary inquiry P of user query scale sequencekQuery context circular scope radius,For
Corresponding subsequence in scale sequence is covered in inquiryQuery context circular scope radius.
8. the location-based service intimacy protection system covered as claimed in claim 6 based on range, which is characterized in that the condition
4 is i.e. anyMeetWherein μ is to cover wide security threshold value；
WhereinIt is user location privacy in the safety coefficient of server end, calculates as follows:
Wherein: Pk@L is the arbitary inquiry P of user query scale sequencekQuery context central point,It is covered for inquiry
Corresponding subsequence in scale sequenceQuery context central point, For user query scale sequence
Arbitary inquiry PkQuery context central point and inquiry cover scale sequence in corresponding subsequenceQuery context center
The distance between point, α is distance threshold；Pk@R is the arbitary inquiry P of user query scale sequencekQuery context round model
The radius enclosed,Corresponding subsequence in scale sequence is covered for inquiryQuery context circular scope radius.
9. the location-based service intimacy protection system covered based on range as described in claim 6 to 8 any one, feature are existed
In the location-based service intimacy protection system covered based on range, comprising:
Data acquisition module, for obtaining user's current queries range P, user's history query context sequenceAnd user's history query context sequenceScale sequence is covered in corresponding inquiry
Position enquiring relevance constraints module, the data for being obtained according to data acquisition module generate inquiry relevance and constrain item
Part: user's current queries range P respective queries cover range P*Centered on point beQuery context or in level be r
Band of position D*In；It is preferred that including the first submodule and second submodule；First submodule is used to work as its query context
Central point PkWhen@L is identical as the central point P@L of user's current queries range, then looking into the historical query scale sequence
Ask PkThe inquiry in scale sequence is covered in corresponding inquiryBy its inquiring positionAs user's current queries range P
Respective queries cover range P*Inquiring position, it may be assumed thatThe second submodule is for traversing the band of position
Level r=1,2 ..., rm, the band of position D for being r for arbitrary levels, when it includes simultaneously present scope P and historical query
Range Pk, then user's current queries range P respective queries cover range P*Fall in the historical query range PkHistory cover model
It enclosesThe level at place is the band of position D of r*In；
Candidate query range set obtains module, accurate for obtaining all satisfaction inquiry relevance constraint conditions, cover range
Property, cover range high efficiency and cover wide security query context setI.e. so that:
Wherein, PR (P, P#) it is safety coefficient of the user location privacy in server end；μ is to cover wide security threshold value；EF
(P,P#) it is location-based service efficiency caused by location privacy protection；ρ is to cover range high efficiency threshold value；
Inquiry covers range and obtains module, is used for from candidate query range set, according to the search strategy that user selects, search
User's current queries range P respective queries cover range P*；It include: safety first search submodule, for according to safety
Preferential search strategy search user's current queries range P respective queries cover range P*: it will be used in candidate query range set
Family location privacy server end the highest candidate query range of safety coefficient as user's current queries range P respective queries
Cover range P*；High efficiency first search submodule, for searching for user's current queries according to the preferential search strategy of high efficiency
Range P respective queries cover range P*: the highest candidate query range of location-based service efficiency in candidate query range set is made
Range P is covered for user's current queries range P respective queries*；Harmonious first search submodule, for according to harmonious preferential
Search strategy search user's current queries range P respective queries cover range P*: by user position in candidate query range set
Privacy is set currently to look into the safety coefficient of server end and the highest candidate query range of the product of location-based service efficiency as user
It askes range P respective queries and covers range P*。
10. the location-based service intimacy protection system covered as claimed in claim 9 based on range, which is characterized in that the base
In the location-based service intimacy protection system that range is covered, further includes: stochastic transformation module obtains mould for covering range to inquiry
The cover query context P that block obtains*=(P*@L,P*@R), the radius for covering query context is extended to 1.0~1.2 times simultaneously at random
As the radius of the cover query context after expansion, cover query context after obtaining random expanded scope, as user query
The cover query context of range P construction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810212081.XA CN108449335B (en) | 2018-03-15 | 2018-03-15 | A kind of location-based service method for secret protection and system based on range cover |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810212081.XA CN108449335B (en) | 2018-03-15 | 2018-03-15 | A kind of location-based service method for secret protection and system based on range cover |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108449335A CN108449335A (en) | 2018-08-24 |
| CN108449335B true CN108449335B (en) | 2019-03-08 |
Family
ID=63195277
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810212081.XA Expired - Fee Related CN108449335B (en) | 2018-03-15 | 2018-03-15 | A kind of location-based service method for secret protection and system based on range cover |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108449335B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111414644B (en) * | 2020-03-18 | 2023-01-17 | 支付宝(杭州)信息技术有限公司 | Privacy protection query method based on block chain and block chain system |
| CN112084411B (en) * | 2020-09-10 | 2021-04-20 | 绍兴文理学院 | User privacy protection method for personalized information retrieval |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101834861A (en) * | 2010-04-16 | 2010-09-15 | 华中师范大学 | Method for protecting track privacy by forwarding inquiries based on neighboring nodes in location service |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4400200B2 (en) * | 2003-12-10 | 2010-01-20 | セイコーエプソン株式会社 | Image display method, image display apparatus, and image display program |
| JP4671133B2 (en) * | 2007-02-09 | 2011-04-13 | 富士フイルム株式会社 | Image processing device |
| US20100287189A1 (en) * | 2009-05-05 | 2010-11-11 | Pioneer Hi-Bred International, Inc. | Acceleration of tag placement using custom hardware |
| CN102665207A (en) * | 2012-05-08 | 2012-09-12 | 杭州电子科技大学 | Method used for continuously inquiring hiding user position based on mobile terminal in LBS (location based service) |
| US20150032711A1 (en) * | 2013-07-06 | 2015-01-29 | Victor Kunin | Methods for identification of organisms, assigning reads to organisms, and identification of genes in metagenomic sequences |
| CN106803825B (en) * | 2017-01-10 | 2019-12-10 | 西安电子科技大学 | anonymous area construction method based on query range |
-
2018
- 2018-03-15 CN CN201810212081.XA patent/CN108449335B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101834861A (en) * | 2010-04-16 | 2010-09-15 | 华中师范大学 | Method for protecting track privacy by forwarding inquiries based on neighboring nodes in location service |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108449335A (en) | 2018-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhao et al. | ILLIA: Enabling $ k $-anonymity-based privacy preserving against location injection attacks in continuous LBS queries | |
| Dong et al. | Novel privacy-preserving algorithm based on frequent path for trajectory data publishing | |
| Liu et al. | Spatiotemporal correlation-aware dummy-based privacy protection scheme for location-based services | |
| Wang et al. | Privacy preservation in location-based services | |
| CN105491519B (en) | Based on the method for secret protection under real-time query scene continuous in location-based service | |
| Mouratidis et al. | Shortest path computation with no information leakage | |
| US10078743B1 (en) | Cross identification of users in cyber space and physical world | |
| CN103826237B (en) | A kind of method for building up of the continuously location privacy protection model based on location-based service | |
| Chen et al. | Measuring query privacy in location-based services | |
| CN106254314B (en) | A kind of position enquiring information on services guard method and system | |
| US10440092B2 (en) | Alert generation based on proximate events identified by source data analytics | |
| Ghinita | Private queries and trajectory anonymization: a dual perspective on location privacy | |
| Li et al. | DALP: A demand‐aware location privacy protection scheme in continuous location‐based services | |
| CN108449335B (en) | A kind of location-based service method for secret protection and system based on range cover | |
| CN104080081A (en) | Space anonymization method suitable for mobile terminal position privacy protection | |
| Kim et al. | Hilbert‐order based spatial cloaking algorithm in road network | |
| CN107770722A (en) | The method for secret protection of location-based service based on the information constrained double stealthy regions in side | |
| Zhang et al. | Privacy quantification model based on the Bayes conditional risk in Location-based services | |
| Nosouhi et al. | A hybrid location privacy protection scheme in big data environment | |
| Yan et al. | Privacy protection in 5G positioning and location-based services based on SGX | |
| Zhang et al. | Protecting the moving user’s locations by combining differential privacy and k-anonymity under temporal correlations in wireless networks | |
| Ju et al. | Location privacy protection for smartphone users using quadtree entropy maps | |
| Manju et al. | Dispersed dummy selection approach for location‐based services to preempt user‐profiling | |
| Wightman et al. | MaPIR: Mapping-based private information retrieval for location privacy in LBISs | |
| Lu et al. | A novel method for location privacy protection in LBS applications |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190308 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |