CN108900521A - A kind of mobile network geographical location method for secret protection based on secure network coding - Google Patents
A kind of mobile network geographical location method for secret protection based on secure network coding Download PDFInfo
- Publication number
- CN108900521A CN108900521A CN201810758827.7A CN201810758827A CN108900521A CN 108900521 A CN108900521 A CN 108900521A CN 201810758827 A CN201810758827 A CN 201810758827A CN 108900521 A CN108900521 A CN 108900521A
- Authority
- CN
- China
- Prior art keywords
- data
- user
- node
- serial number
- server
- 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
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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
-
- 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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
- H04L63/0414—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden during transmission, i.e. party's identity is protected against eavesdropping, e.g. by using temporary identifiers, but is known to the other party or parties involved in the communication
-
- 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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/029—Location-based management or tracking services
Abstract
The present invention provides a kind of geographical location method for secret protection based on secure network coding, specifically includes and generates information forwarding tree according to the close relationship between social network user；Give user's Allotment Serial Number；Data are encoded in user node；After server receives sufficient amount of data, data are decoded using the Gauss Jordan elimination；Service response returns.Present invention combination secure network encodes the characteristics of all-or-nothing, when intercepting partial data in network, can not decode any useful data, effectively increase the safety of data in a network；It is directly interacted using agency (forwarding root vertex user) with location server, remaining user does not have to directly interact with server, reduces the possibility that server learns each user's more specific location information；Root node is sent to the multiple latitude and longitude informations of server, and server can not confirm the latitude and longitude information of root node, and similarly, the father node in forwarding tree can not also be accurately obtained request and the response message of child node.
Description
Technical field：
The invention belongs to field of communication service, specifically design a kind of mobile network geographical location based on secure network coding
Method for secret protection.
Background technique：
The development of mobile Internet, so that the service (Location-based service, LBS) based on geographical location becomes
It obtains more and more important.The technology is widely used to social activity, navigation, the fields such as cuisines.However, it is more and more facts proved that,
LBS also brings great threat to the personal secrets of user while bringing convenient.Therefore, Recent study people
Member always searches for one kind can but enjoy LBS convenient method under the premise of minimum exposure personal information.
Researcher both domestic and external proposes many solutions for this problem, based on different secret protection technological system structures
Certainly scheme, currently, the mobile LBS service privacy information protection technology of mainstream can be greatly classified into three kinds：Geographical location information
Hiding algorithm, identity hide protection algorism and Encryption Algorithm.From the perspective of from another angle, for the provider of LBS, if energy
The location-based service of itself is improved from architectural framework, is also beneficial to promote the technical advantage of itself.
Secure network coding techniques is an important branch of network code, and researcher mentions in research classic network coding
It is found when rising handling capacity：When carrying out linear hybrid operation with network code, the safety of data can be increased, so as to keep out
Listener-in's eavesdrops, this thought can be applied in intimacy protection system.
The present invention establishes an experiment porch in true network, which includes the hand of 10 android systems
Machine and a server, and the performance of scheme is had evaluated on the experiment porch, it mainly include complexity, safety and network are compiled
Three aspects of code efficiency, are found, the practical computing cost of network-encoding operation bring is can to receive completely by experimental evaluation
's.
Summary of the invention：
The purpose of the present invention is to provide a kind of mobile network geographical location secret protection sides based on secure network coding
Method, to ensure the personal secrets of user.
In order to achieve the above object, the present invention provides the mobile network geographical location privacies that kind is encoded based on secure network
Guard method, it is characterised in that：The method includes following operative steps：
S1 generates information forwarding tree, the mutual higher use of cohesion by means of the close relationship between social network user
Information conversion link is formed between family；
S2, first root node (being assumed to be i) randomly choose a number into N from 1, as the serial number of oneself, then to it
Subtree (being assumed to be j) is randomly assigned countijA serial number, wherein countijValue be this subtree in user number；
The latitude and longitude information of itself and descendant nodes is carried out hybrid manipulation using secure network encoding scheme by S3, user,
Then coded data piece being successively sent to its Parent node User, the solicited message of final all users is collected in root node, then
By root node, user is sent to server；
S4, after server gets all coded data pieces, after decoding all latitude and longitude informations, to Map Services quotient
Initiate inverse geographical location decoding request；After server gets all position responses of Map Services quotient, to all location informations into
Row coding mixes and returns to root node user.
S5 is sent to it after root node user decodes the location information of oneself, then after other positions data are re-encoded
Children User, user j is executed and its father node (root node) similarly operates；Recursive call process steps S5, until all
Node all parse oneself location information.
The technical solution that the present invention further limits is：
Preferably, in above-mentioned technical proposal, in step S1, weight of the cohesion as side, weight is bigger, represents two use
Family relationship is more intimate.Therefrom the maximum node of selectance (spend identical node if it exists and then therefrom randomly choose a node) is made
For root node.
Preferably, in above-mentioned technical proposal, in step S2, if the subtree one of root node shares n node, then from remaining
N serial number is randomly selected in N-1 serial number distributes to it, father node needs to record which serial number has given which children tree nodes,
Root node can only know that the serial number of the children tree nodes is one in this n serial number in this way, and not knowing is which.
Preferably, in above-mentioned technical proposal, in step S3, when a node does not have descendant nodes, if a node point
Serial number i, its data are just denoted as qi, with a non-zero random number aiCoded data q ' is generated multiplied by LBS request datai.?
Coded data is previously written code coefficient, and code coefficient is：
gi=(0 0 ... ai ... 0)
In above formula, giFor a row vector, in addition to i-th of column component is aiOutside, remaining component is all 0.
Code coefficient combination after transmission file be：
q″i=(1 00 ... ai ... 0 q′i)
The total m descendant nodes of one node add data, with (a m+ after it receives whole m datas
1) × (m+1) random matrix carries out linear combination to this m+1 data, then m+1 number newly-generated after linear combination
According to being sent to its father node.
Preferably, it in above-mentioned technical proposal, in step S4, after server decodes data, can be obtained according to decoding result
To the serial number of these demand files, but server is not aware which user is this serial number belong to.Then, using with it is preceding
Face same procedure is handled service response file, is not had documentary forwarding and linear hybrid layer by layer specifically, is directly being taken
Business device end is encoded.
Each service response file after coding is：
Ci'=(N mi1 mi2 ... miN ri′)
Wherein, C is the file generated after encoding, and M is the random matrix of N × N, mijFor an element of Metzler matrix, riFor qi
Service response file, ri' it is respectively riCoded data, data are issued root node user in forwarding tree after having mixed.
Preferably, available according to decoding result after user decodes data in step S5 in above-mentioned technical proposal
The serial number of these answer files.The answer file decoded is:
According to the serial number information of these father node storages layer by layer, service response file riIt can accurately reach and initiate the request
User i.
It is an advantage of the invention that：The location information that user is not only concealed to server end makes not knowing each user
Be located at where, while increasing the safety of transmission again to a certain extent, the data after network code are multiple and different
The linear mixing of position data, because increasing the difficulty that listener-in obtains data.
Detailed description of the invention：
Fig. 1 is the forwarding spanning tree based on cohesion model；
Fig. 2 is the invention safety evaluation；
Fig. 3 is that the invention network data redundancy and server efficiency are assessed；
Fig. 4 is the network code efficiency in the common smart machine of the invention.
Specific embodiment：
To become apparent from technical solution of the present invention, the present invention is described in further detail with reference to the accompanying drawing.This
Invention specific implementation details are as follows：
S1 generates information forwarding tree, the mutual higher use of cohesion by means of the close relationship between social network user
Information conversion link is formed between family；
In this method, weight of the intimate angle value as side, for intimate angle value within the scope of 0-100, numerical value is bigger, represents two
Customer relationship is more intimate.Assuming that there is the social networks of Fig. 1, each node indicates user, and the weight on side indicates cohesion, uses warp
The Kruskal algorithm of allusion quotation generates maximum spanning tree (selecting very big weight side that tree is added), in the process and records the degree of each node.
S2, first root node (being assumed to be i) randomly choose a number into N from 1, as the serial number of oneself, then to it
Subtree (being assumed to be j) is randomly assigned countijA serial number, wherein countijValue be this subtree in user number.
The latitude and longitude information of itself and descendant nodes is carried out hybrid manipulation using secure network encoding scheme by S3, user,
Then coded data piece being successively sent to its Parent node User, the solicited message of final all users is collected in root node, then
By root node, user is sent to server.
When a node does not have descendant nodes, if as soon as the serial number i of node point, its data are denoted as qi, with one
A non-zero random number aiCoded data q ' is generated multiplied by LBS request datai.Code coefficient, coding system are previously written in coded data
Number is：
gi=(0 0 ... ai ... 0)
In above formula, giFor a row vector, in addition to i-th of column component is aiOutside, remaining component is all 0.
Code coefficient combination after transmission file be：
q″i=(1 00 ... ai ... 0 q′i)
The total m descendant nodes of one node add data, with (a m+ after it receives whole m datas
1) × (m+1) random matrix carries out linear combination to this m+1 data, then m+1 number newly-generated after linear combination
According to being sent to its father node.
S4, after server gets all coded data pieces, after decoding all latitude and longitude informations, to Map Services quotient
Initiate inverse geographical location decoding request；After server gets all position responses of Map Services quotient, to all location informations into
Row coding mixes and returns to root node user.
After server decodes data, according to the serial number of these available demand files of decoding result, but server
It is not aware which user is this serial number belong to.Then, using the progress with method as before to service response file
Processing does not have documentary forwarding and linear hybrid layer by layer specifically, is directly encoded in server end.
Each service response file after coding is：
Ci'=(N mi1 mi2 ... miN ri′)
Wherein, C is the file generated after encoding, and M is the random matrix of N × N, mijFor an element of Metzler matrix, riFor qi
Service response file, ri' it is respectively riCoded data, data are issued root node user in forwarding tree after having mixed.
S5 is sent to it after root node user decodes the location information of oneself, then after other positions data are re-encoded
Children User j, user j are executed and its father node (root node) similarly operates.
After user decodes data, according to the serial number of these available answer files of decoding result.The response decoded
File is:
According to the serial number information of these father node storages layer by layer, service response file riIt can accurately reach and initiate the request
User i.
Based on this, the complexity, safety and the performance evaluation of network code efficiency of this method are carried out.
1, algorithm complexity is assessed
In table 1, the time complexity of entire algorithm is O (n3), space complexity is O (n2).It can be seen that the time of algorithm is multiple
Miscellaneous degree and space complexity are lower, and therefore, entire scheme is theoretically feasible.
Table 1：The analysis of complexity of algorithm
2, safety evaluation
Data transmission scheme based on network code needs the record in the data segment of transmission to obtain used in the data
Global coding vector.As a listener-in, the method that he eavesdrops is exactly the data received by eavesdropping accumulation, then using upper
The method in face goes decoding to attempt to obtain significant data, once its position for obtaining anyone, then it is assumed that it eavesdrops successfully.
In Fig. 3, traditional scheme is directly communicated with server, does not carry out any protection, and listener-in often intercepts
One link just successfully obtains the position of a user, therefore the number of positions obtained is linear with the data block number intercepted
Relationship.And after using secure network encoding scheme, listener-in needs to carry out parsing operation to the data stolen, to the maximum extent
Decode valuable information.It is shown on experiment porch in Fig. 3, according to the topological structure building network that Fig. 1 is generated, in network
While operation, it is assumed that listener-in can randomly obtain a part of data therein, then listener-in to the data of acquisition into
Row decoding operate.It is can be found that by experiment after carrying out linear hybrid to data using network code, listener-in obtains significant
The quantity of location information to be obviously less than traditional scheme.
3, network code efficiency
After this programme, network-encoding operation can be introduced during transmission, this can additionally increase some calculating and hold
Pin.And this method is to run in a mobile device, and the computing capability of mobile terminal will be much smaller than server, therefore, network
The computing cost of coding becomes very crucial, if expense is big, the performance gain that can weaken, or even will appear more harm than good.
We have carried out actual assessment to the performance of network code on the common mobile intelligent terminal of several moneys.
In Fig. 4, we have calculated separately two groups with every money mobile phone, and the network write based on JAVA is respectively adopted in calculating process
Encoding operation library and operation library based on basis C++, each data in every group are that 10 tests are averaged.Due to
JAVA is explanatory language, and code efficiency is lower.After being encoded using C++, performance is significantly improved.From Fig. 4, Wo Menfa
Existing, when offspring data packet number is fewer, the efficiency of encoding and decoding is higher, and as K becomes larger, the handling capacity of coding is gradually decreased, this
Be because the dimension of encoding and decoding gets higher after, the complexity of coding increases.In general, for the intelligent movable equipment of mainstream and
Speech, the negative expense of network code bring is very small.The request data quantity of LBS service is usually smaller, therefore its generation
Time delay almost can be ignored, and it can bring being obviously improved for safety.
The present invention not only conceals the location information of user to server end, makes not knowing which each user is located at
In, while increasing the safety of transmission again to a certain extent, the data after network code are multiple and different position datas
Linear mixing, because increasing the difficulty that listener-in obtains data.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, without departing from the technical principles of the invention, several improvement and deformations can also be made, these improvement and deformations
Also it should be regarded as protection scope of the present invention.
Claims (7)
1. a kind of geographical location method for secret protection based on secure network coding, it is characterised in that include the following steps：
S1 forms the information forwarding tree between multiple users：Including being calculated between them according to the number contacted between good friend
Intimate angle value, and between users generate information conversion link；
S2, root node i randomly choose a number as the serial number of oneself into N from 1, are then randomly assigned to its subtree j
countijA serial number, wherein countijValue be this subtree in user number；
The latitude and longitude information of itself and its descendant nodes is used secure network coding staff by S3, each user in addition to root node
Case carries out hybrid manipulation, and coded data piece is successively then sent to its Parent node User, the solicited message of final all users
Collect in root node, then server is sent to by root node user；
S4 after server gets all coded data pieces, after decoding all latitude and longitude informations, is initiated to Map Services quotient
Inverse geographical location decoding request；After server gets all position responses of Map Services quotient, all location informations are compiled
Code mixes and returns to root node user；
S5 is sent to its sub- section after root node user decodes the location information of oneself, then after other positions data are re-encoded
Point user j；Recursive call process steps S5, until all nodes all parse the location information of oneself.
2. the geographical location method for secret protection according to claim 1 based on secure network coding, it is characterised in that：
In step S1, weight of the intimate angle value as side, weight is bigger, and it is more intimate to represent two customer relationships；Therefrom selectance
Maximum tree node spends identical node if it exists and then therefrom randomly chooses a node as root node.
3. the geographical location method for secret protection according to claim 1 based on secure network coding, it is characterised in that：
In step S2, if the subtree one of root node shares n node, then n serial number is randomly selected from remaining N-1 serial number
Each children tree nodes are distributed to, father node records the serial number for having given children tree nodes.
4. the geographical location method for secret protection according to claim 1 based on secure network coding, it is characterised in that：Step
It include when a node does not have descendant nodes, setting the serial number i of the node, its LBS request data is denoted as q in rapid S3i,
With a non-zero random number aiCoded data q ' is generated multiplied by LBS request datai；It is previously written code coefficient in coded data, is compiled
Code coefficient be：
gi=(0 0 ... ai … 0)
In above formula, giFor a row vector, in addition to i-th of column component is aiOutside, remaining component is all 0；
Code coefficient combination after transmission file be：
q″i=(1 00 ... ai … 0 q′i)
The total m descendant nodes of one node, after it receives whole m datas, add data, with one (m+1) ×
(m+1) random matrix carries out linear combination to this m+1 data, and then m+1 data newly-generated after linear combination are sent out
Give its father node.
5. the geographical location method for secret protection according to claim 4 based on secure network coding, it is characterised in that institute
Stating LBS request data includes latitude and longitude information and position requests content.
6. the geographical location method for secret protection according to claim 1 based on secure network coding, it is characterised in that：
In step S4, after server decodes data, according to the serial number of these available demand files of decoding result, but take
Business device is not aware which user is this serial number belong to；
Then, using the handling to service response file with method as before, do not have specifically documentary forwarding layer by layer with
Linear hybrid is directly encoded in server end；
Each service response file after coding is：
C′i=(N mi1 mi2 … miN r′i)
Wherein, C is the file generated after encoding, and M is the random matrix of N × N, mijFor an element of Metzler matrix, riFor qiService
Answer file, r 'iRespectively riCoded data, data are issued root node user in forwarding tree after having mixed.
7. the geographical location method for secret protection according to claim 1 based on secure network coding, it is characterised in that：
In step S5, after user decodes data, according to the serial number of these available answer files of decoding result；It decodes
Answer file is:
According to the serial number information of these father node storages layer by layer, service response file riThe use for initiating the request can accurately be reached
Family i.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810758827.7A CN108900521A (en) | 2018-07-11 | 2018-07-11 | A kind of mobile network geographical location method for secret protection based on secure network coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810758827.7A CN108900521A (en) | 2018-07-11 | 2018-07-11 | A kind of mobile network geographical location method for secret protection based on secure network coding |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108900521A true CN108900521A (en) | 2018-11-27 |
Family
ID=64348629
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810758827.7A Pending CN108900521A (en) | 2018-07-11 | 2018-07-11 | A kind of mobile network geographical location method for secret protection based on secure network coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108900521A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110636065A (en) * | 2019-09-23 | 2019-12-31 | 哈尔滨工程大学 | Location point privacy protection method based on location service |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101009943A (en) * | 2007-01-29 | 2007-08-01 | 中兴通讯股份有限公司 | A switching method for the mobile positioning center in the continuous positioning and its device |
| CN101018393A (en) * | 2006-02-10 | 2007-08-15 | 中兴通讯股份有限公司 | A method for switching location information in the mobile positioning service system |
| CN106779641A (en) * | 2016-12-29 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Information processing method and information processor |
-
2018
- 2018-07-11 CN CN201810758827.7A patent/CN108900521A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101018393A (en) * | 2006-02-10 | 2007-08-15 | 中兴通讯股份有限公司 | A method for switching location information in the mobile positioning service system |
| CN101009943A (en) * | 2007-01-29 | 2007-08-01 | 中兴通讯股份有限公司 | A switching method for the mobile positioning center in the continuous positioning and its device |
| CN106779641A (en) * | 2016-12-29 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Information processing method and information processor |
Non-Patent Citations (1)
| Title |
|---|
| 王磊，孙中伟: "基于安全网络编码的移动网络地理位置隐私保护技术", 《南京理工大学学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110636065A (en) * | 2019-09-23 | 2019-12-31 | 哈尔滨工程大学 | Location point privacy protection method based on location service |
| CN110636065B (en) * | 2019-09-23 | 2021-12-07 | 哈尔滨工程大学 | Location point privacy protection method based on location service |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104954322B (en) | A kind of binding processing method of account, apparatus and system | |
| Jayasekara | Role of Facebook as a disaster communication media | |
| US10313482B2 (en) | Method, device and system for providing services based on location information and terminal device thereon | |
| CN104936141B (en) | LBS method for protecting track privacy based on location tags | |
| CN106254314B (en) | A kind of position enquiring information on services guard method and system | |
| CN104462285B (en) | A kind of method for secret protection of Information Mobile Service inquiry system | |
| CN104507048A (en) | Location privacy protection method based on l-inquiry | |
| CN107770722A (en) | The method for secret protection of location-based service based on the information constrained double stealthy regions in side | |
| CN104750718B (en) | The searching method and equipment of a kind of data information | |
| Attary et al. | Hindcasting community-level damage to the interdependent buildings and electric power network after the 2011 Joplin, Missouri, Tornado | |
| CN105162695B (en) | A kind of novel neighbour's mobile social networking friend-making method for secret protection | |
| CN105578412A (en) | Position anonymization method based on position service and system | |
| CN112039945A (en) | Third-party application docking method and system based on fire-fighting Internet of things platform | |
| Ashraf et al. | IDP: A privacy provisioning framework for TIP attributes in trusted third party-based location-based services systems | |
| CN108040321B (en) | Position anonymization method for resisting replay attack in road network environment | |
| CN108900521A (en) | A kind of mobile network geographical location method for secret protection based on secure network coding | |
| CN111182465A (en) | Method and device for determining terminal affiliation | |
| Lu et al. | A novel method for location privacy protection in LBS applications | |
| CN107733767B (en) | Method, device and system for establishing social relationship network | |
| Parmar et al. | Dummy generation-based privacy preservation for location-based services | |
| Wang et al. | Network-coding-based energy-efficient data fusion and transmission for wireless sensor networks with heterogeneous receivers | |
| Ruppel et al. | Geocookie: A space-efficient representation of geographic location sets | |
| Picco-Schwendener et al. | Being smart with data: Automatic classification of users of a free municipal Wi-Fi network (MWN) using a two-tiered classification tree | |
| CN104318084A (en) | Mobile phone virus transmitting ability analysis method based on influence maximization algorithm | |
| Costa et al. | Rayzit: An anonymous and dynamic crowd messaging architecture |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181127 |