CN113051357B - Vector map optimization local desensitization method based on game theory - Google Patents
Vector map optimization local desensitization method based on game theory Download PDFInfo
- Publication number
- CN113051357B CN113051357B CN202110249302.2A CN202110249302A CN113051357B CN 113051357 B CN113051357 B CN 113051357B CN 202110249302 A CN202110249302 A CN 202110249302A CN 113051357 B CN113051357 B CN 113051357B
- Authority
- CN
- China
- Prior art keywords
- data
- vector map
- desensitization
- sensitive information
- map
- 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.)
- Active
Links
- 238000000586 desensitisation Methods 0.000 title claims abstract description 88
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000005457 optimization Methods 0.000 title claims description 6
- 230000000739 chaotic effect Effects 0.000 claims abstract description 15
- 230000006399 behavior Effects 0.000 claims abstract description 5
- 230000008901 benefit Effects 0.000 claims description 5
- 239000011541 reaction mixture Substances 0.000 claims description 4
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 230000004807 localization Effects 0.000 claims description 2
- 239000000203 mixture Substances 0.000 claims description 2
- 238000006386 neutralization reaction Methods 0.000 claims description 2
- 230000035945 sensitivity Effects 0.000 claims description 2
- 230000000694 effects Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000009467 reduction Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007123 defense Effects 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 238000013210 evaluation model Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 239000010151 yanghe Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/56—Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Data Mining & Analysis (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Remote Sensing (AREA)
- Medical Informatics (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a vector map optimized local desensitization method based on a game theory, which comprises the following steps: acquiring vector map data to be desensitized, extracting sensitive information of the vector map data and analyzing the content of the sensitive information; constructing a sensitive information protection model based on a game theory, evaluating the behaviors of all participants in a sensitive information protection scene of a vector map, calculating the profits of the participants and carrying out strategy analysis; aiming at given data of different participants, giving consideration to the requirements of data security protection and availability, and making an optimal decision; selecting desensitization geographic elements, and completing local desensitization of the vector map by using the generated chaotic sequence in combination with a sensitive information protection model and an optimal desensitization algorithm; and outputting the map data result after local desensitization is completed.
Description
Technical Field
The invention relates to the field of vector map desensitization, in particular to a vector map optimized local desensitization method based on a game theory.
Background
The vector digital map is a carrier of geographic information, is a basic information resource for implementing ecological environment protection, disaster prediction and early warning, geographic space information sharing and natural resource information integration, and is also an indispensable strategic resource in national economy and national defense construction. As an important part of geographic information sharing, the information security and open sharing problem of vector digital maps has become a key problem in the research challenge of current geographic information services. In order to better deal with the threat of malicious behaviors such as stealing, tampering, counterfeiting, infringement, disclosure and the like to the safety of the vector map data, the sensitive data protection method proposed by the existing research can better guarantee the safety of the vector map data in storage, transmission, display and output, but the open sharing and the high-efficiency availability of the vector map data are not fully considered.
In the process of implementing the present invention, the inventor has collected related patents known at present, and finds that the common methods for protecting vector map data at present can be mainly divided into a digital watermarking method and a data scrambling method. A digital vector map integrity protection method (CN 201210189469.5) proposed by Harbin engineering university relates to a method for completely protecting and authenticating a digital vector map, which can resist various attacks and improve the data writing speed; an asymmetric watermark method [ CN201410241263.1 ] for protecting vector map data copyright proposed by Yanghe et al solves the problem of embedding and detecting asymmetric watermark and eliminating secret key channel distribution key; the vector space data encryption method using Haar transform and gaussian distribution [ CN202010328668.4 ] proposed by Yan Haonwien et al relates to a vector space data encryption method using tree-shaped Haar transform and gaussian distribution. The method only considers how to protect the vector map data to the maximum extent, and the availability, the shared service requirement and the desensitization controllability of the vector map data are not considered enough.
Disclosure of Invention
Aiming at the defects, the invention provides a vector map optimization local desensitization method based on the game theory, which can effectively protect sensitive information in the vector map and is also suitable for other fields of geological and geographic information sharing protection.
The invention provides a vector map optimized local desensitization method based on a game theory, which specifically comprises the following steps:
s101, obtaining vector map data to be desensitized, extracting sensitive information of the vector map data and analyzing the content of the sensitive information;
s102, constructing a sensitive information protection model based on a game theory, evaluating the behaviors of all participants in a sensitive information protection scene of a vector map, calculating the profits of the participants and carrying out strategy analysis;
s103, aiming at given data of different participants, giving consideration to data security protection and usability requirements, and making an optimal decision;
s104, selecting desensitization geographic elements, and completing local desensitization of the vector map by using the generated chaotic sequence in combination with a sensitive information protection model and an optimal desensitization algorithm;
and S105, outputting the map data result after the local desensitization is finished.
Further, step S101 specifically includes:
the vector map data to be desensitized is composed of a plurality of map layers, and specifically comprises the use condition of the sensitive geographic element, the relevance with other surrounding sensitive geographic elements and the weight occupied by the sensitive geographic element.
Further, the total content of sensitive information of the vector map is shown as formula (1):
infr in formula (1) map Representing the total content of sensitive information of the vector map; i is the number of the geographic elements in the map layer; j is the number of the layer; n is the total number of layers; m is the total number of geographic elements in one map layer; weight ji Weight occupied by sensitive geographic elements; state ji A usage status for a sensitive geographic element; localization ji As a degree of closeness of correlation with other surrounding sensitive geographic elements.
Further, in step S102, the participants include: data defender D p And data attacker D a 。
Further, data defender D p The policy space of (a) is expressed as: s. the p =(s p1 ,s p2 …s pm );
Data attacker D a Is represented as: s a =(s a1 ,s a2 …s an );
Data defender D p Is expressed by formula (2):
in the formula (2), the reaction mixture is,is a data defender D p The benefit of sensitive information resulting from implementing a desensitization strategy,is data defender D p Loss of shared data in the vector map caused by implementation of a desensitization policy; for sec Representing the total amount of sensitivity important information; for unsec Representing the total amount of sharing importance information; r represents a weighting factor; s ai As a policy space S a Any one of the above; s pi As a policy space S p Any one of the above;
data attacker D a The yield of (a) is expressed by the formula (3):
in the formula (3), the reaction mixture is,representing data aggressors D a Sensitive information revenue obtained by executing the corresponding neutralization strategy;representing data aggressors D a Data defender D when executing certain sensitive information attack method p To data attacker D a The resulting loss of trust;
the participants, the strategy space and the gain function together form a quadruplet model G ═ Sp, Sa, up, ua.
Step S104 specifically includes:
s201: combining the composition characteristics of vector map elements, and generating a random noise set sequence by adopting a Henon two-dimensional chaotic system;
s202: and selecting the geographic elements needing to perform desensitization operation, and performing element-oriented deletion, offset, replacement, scrambling desensitization operation according to interference data in the random noise set sequence to complete local desensitization of the vector map.
The beneficial effects provided by the invention are as follows: the safety and sharing requirements of different vector maps are better considered, and the local desensitization of the vector maps is effectively realized; the method can be suitable for the vector map data desensitization requirements in the aspects of data sharing, safe transmission, encapsulation storage and the like, can support the sensitive information protection of important data such as geology, geography, hydrology and the like, and effectively solves the contradiction problem between the map information security and confidentiality and the open sharing.
Drawings
FIG. 1 is a flow chart of a vector map optimized partial desensitization scheme based on game theory;
FIG. 2 is a schematic diagram of a vector map desensitization scheme;
FIG. 3 is raw vector map data;
FIG. 4 shows a data publisher selecting geographic elements requiring local desensitization from a vector map according to a revenue calculation result;
FIG. 5 is a schematic diagram of the change in geographic elements before and after performing linear local desensitization based on chaotic sequences;
FIG. 6 is a comparison of the effect of a vector map before and after desensitization;
FIG. 7 is the effect of vector maps after desensitization;
FIG. 8 is a depiction of the associated graphical symbol of FIGS. 3-7;
FIG. 9 is a schematic diagram of the desensitization effect of the vector map-based geographic elements when the perturbation factor θ takes a value of 0.0001;
FIG. 10 is a schematic diagram of the desensitization effect of the vector map surface-type geographic elements when the perturbation factor θ takes a value of 0.00005;
FIG. 11 is a schematic diagram showing significant distortion and misalignment of the spatial positions of geographic elements in a vector map.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be further described with reference to the accompanying drawings.
Referring to fig. 1, fig. 1 is a flowchart of a vector map optimization local desensitization method based on game theory according to the present invention; a vector map optimization local desensitization method based on game theory comprises the following steps:
s101, obtaining vector map data to be desensitized, extracting sensitive information of the vector map data and analyzing the content of the sensitive information;
the vector map data to be desensitized is composed of a plurality of map layers, and specifically comprises the use condition of the sensitive geographic element, the relevance with other surrounding sensitive geographic elements and the weight occupied by the sensitive geographic element.
Vector maps are generally organized in multiple levels, such as geographic elements, geographic layers, and vector maps. For a particular map Layer { l1, l2 … lm } (1< i < ═ m), where li represents a geographic element in the Layer and m is the number of geographic elements contained in this map Layer. For example, one copper ore information map layer may be represented by m points. In practical applications, the sensitive information content of the map layer varies according to the time, space, weight and number of geographic elements li.
Thus, the sensitive information content defining a geographical layer is shown as follows:
wherein, statei represents the use state of the sensitive geographic element, such as in use, standby, abandonment, etc.; here, the value range of statei is set to be [0-100], and the value of statei is in direct proportion to the sensitive information content Inforlayer of the geographical layer; the localyi represents the closeness degree of the relevance with other surrounding sensitive geographic elements, the value range is [0-100], and the localyi is in direct proportion to Inforiayer; weight i represents the weight taken up by the sensitive geographic element.
Then, for multiple map layers, the total content of sensitive information of the vector map is as shown in formula (1):
in formula (1), Informap represents the total content of sensitive information of the vector map; i is the number of the geographic elements in the map layer; j is the number of the layer; n is the total number of layers; m is the total number of geographic elements in one map layer;
s102, constructing a sensitive information protection model based on a game theory, evaluating the behaviors of all participants in a sensitive information protection scene of a vector map, calculating the profits of the participants and carrying out strategy analysis;
s103, aiming at given data of different participants, giving consideration to data security protection and usability requirements, and making an optimal decision;
referring to fig. 3, fig. 3 is a block diagram of a vector map sensitive information protection scheme.
The sensitive information protection scheme mainly comprises three processes, which are respectively as follows: based on the selection of game theory desensitization geographic elements, the local desensitization of the vector map and the desensitization reduction of the vector map.
The protection scheme involves two participants: data defender Dp, i.e. data publisher; data attacker Da, i.e. data consumer. Revenue u for participant Dp p (s pi ,s ai ) Can be expressed as:
wherein,is participant D p The benefit of sensitive information resulting from implementing a desensitization strategy,is participant D p Loss of shared data in the vector map caused by implementing a desensitization strategy.
Combining the participants, the strategy space and the gain function to form a four-tuple model G ═ (Sp, Sa, u) p ,u a ) The Best Response policy for participant i is defined as follows:
a strategy is provided by each participant, and the strategies form a strategy set (S) p ,S a ). For one pair of strategy combinationPolicy for any participant { i | i \ in { p, a }All for other participant policy combinationsThe best countermeasure of (1). If it is notFor arbitrary s t ∈S i Are all established, thenIs a "Nash Equilibrium" (Nash Equilibrium) of the sensitive information protection model G;
data publisher D p Capable of using a given data set D a Strategy s of ai And respectively obtaining the optimal data desensitization scheme of the vector map. Thus, data consumer D a Can be expressed asWhen data publisher D p And data user D a When the optimal strategy is selected simultaneously, the vector digital sensitive information protection model gradually approaches a stable state, and the nano meterThe state of equilibrium can be expressed as follows:
s104, selecting geographical elements needing desensitization, and completing local desensitization of the vector map by using the generated chaotic sequence in combination with a sensitive information protection model and an optimal desensitization algorithm;
referring to FIG. 2, in order to provide effective desensitization noise, the five-tuple [ a, b, x ] of Henon two-dimensional chaotic parameters is used in combination with the structural features of vector map elements 0 ,y 0 ,T 0 ]Generating random noise set sequence, wherein a and b are control parameters, x 0 ,y 0 Is an initial value of a random noise generator, T 0 Is the initial number of iterations. For the initial value x 0 ,y 0 Iteration T 0 Then, x can be obtained n ,y n . Subsequent iterations m-1 more times can produce a random noise sequence of length m:
the parameter quintuple is a reconstructed chaotic sequence generator and is also a necessary condition for realizing the desensitization data of the vector map to be restored to an original state. In the present invention, the corresponding parameter five-tuple { a, b, x 0 ,y 0 ,T 0 Will be used as the restoration key for the vector map desensitization data. According to the Kerkhoffs criterion, even if a chaotic sequence generation algorithm is disclosed, if a secret key is unknown, the desensitized vector map cannot be restored to the original map state.
Based on the game income, selecting the geographic elements which need to execute desensitization operation in the given vector map, generating interference data according to the two-dimensional chaotic sequence, and executing desensitization operation on the selected geographic elements. Given a data disturber D for any vector map containing sensitive information p Selected policy space S p The digital map local desensitization scheme should satisfy the following formula (0, 10%, 20%, …, 100%):
wherein,andexpressed as max and s, respectively pi And n is the content of sensitive information of the geographic elements. And finally, local desensitization of the vector map is completed by combining the sensitive information protection model and the chaotic sequence generation method.
While the second step of fig. 2 also illustrates several different methods of local desensitization of data used by the present invention, including scrambling, shifting, replacing, and deleting certain map elements.
Finally, the desensitization reduction algorithm of the vector map data is the inverse process of the desensitization algorithm. Namely, given a desensitized vector map, the original vector map can be obtained through desensitization reduction operation. It should be noted that, as can be seen from the sensitive information content calculation method, the sensitive information content of each geographic element does not change due to the desensitization operation.
And S105, outputting the map data result after the local desensitization is finished.
Referring to fig. 3-7, in order to better embody the local desensitization effect of the vector map data in the present embodiment, an application scenario is selected for experimental verification and analysis. Wherein, data user D is set p Selection of s a 40% r 0.6(1-r 0.4), data distributor D p The desensitization strategy chosen is s p 17.5%, the original vector map in fig. 3 and 7 is subjected to linear perturbation based on a chaotic sequence, and the vector map effects before and after local desensitization are shown in fig. 3-7.
As shown in fig. 3-7, fig. 3 is raw vector map data; FIG. 4 shows that the data publisher selects the geographic elements that need local desensitization from the vector map according to the revenue calculation result; FIG. 5 illustrates the change in geographic elements before and after performing linear local desensitization based on chaotic sequences; fig. 6 shows the effect of comparing the vector maps before and after desensitization, and fig. 7 shows the effect of the vector map after desensitization. As can be seen from fig. 3 to fig. 7, the vector map partial desensitization scheme based on the game theory proposed in the present invention can pick the optimal geographic element data set based on the profits of game participants, as shown in fig. 5 and fig. 6. And further performing local coordinate linear disturbance based on the chaotic sequence on the geographic elements in the selected vector map, thereby achieving the desensitization purpose of reducing the geometric precision of the geographic elements, as shown in fig. 4 and 7.
As shown in fig. 3-7, the overall effect of local desensitization of the vector map execution point, line, and surface geographic elements is shown. According to the scheme, the point, line and surface local sensitive map elements in the vector map can be effectively selected, and overall linear offset is carried out according to the algorithm, so that the purposes of reducing the geometric precision and maintaining the stability of the geometric shape of the map elements can be achieved. This further illustrates the better topological conformality of the proposed solution. FIG. 8 is a depiction of the relevant graphical symbol of FIGS. 3-7; special points are characteristic points; buildings are Buildings; highways is a road; grassland is Grassland; naturals is the greenbelt; railways is a railroad;
as shown in fig. 9-11, the adjustment of the coordinate interference degree in the corresponding geographic element can be realized by different settings of the perturbation factor θ, and the results of the desensitization experiments based on different perturbation factors are shown in fig. 9-11.
Fig. 9 and 10 show the desensitization effect of the vector map surface-type geographic element when the perturbation factor theta takes values of 0.0001 and 0.00005 respectively. From the experimental result, when the value of the disturbance factor theta is large, the position coordinate change of the geographic element is also large, so that the sensitive geographic data can be more effectively protected. However, as the value of the perturbation factor θ is increased, it can be seen from fig. 11 that the spatial position of the geographic element in the vector map will exhibit obvious distortion and misalignment (i.e. the distortion and misalignment cause overlap), and the spatial relationship causes serious damage. Therefore, in the process of implementing local desensitization of the vector map, a data publisher should consider fully combining with an actual application scenario to select a disturbance factor with a proper size.
The beneficial effects provided by the invention are as follows: the invention provides a novel vector map optimized local desensitization scheme based on a game theory aiming at the problems of safety protection and open sharing of sensitive information of a vector map. Establishing a sensitive information protection model and an optimal data desensitization model by introducing a game theory, wherein a defender sets and executes a sensitive data protection strategy; and the attacker has the ability to recover and acquire sensitive data information in the vector map. On the basis, by designing a sensitive data protection mechanism and a participant profit and cost evaluation model, comprehensively considering profits and costs of competing parties under different game decisions, and taking the paid cost and the obtained benefit for executing sensitive information protection as key factors to be considered and balanced when a map defender makes a decision, the rational selection process of each participant is simulated. And finally, constructing a vector map optimized local desensitization scheme applicable to different application scenes according to a reaction function and a Nash equilibrium principle. Meanwhile, the desensitization protection scheme provided by the invention can also be applied to other fields of geological and geographic information sharing protection. The vector map desensitization method is based on the OpenStreetMap real map scene, and the implementation efficiency of the vector map desensitization scheme and the controllability of data interference are analyzed and verified.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (5)
1. A vector map optimization local desensitization method based on game theory is characterized in that: the method specifically comprises the following steps:
s101, obtaining vector map data to be desensitized, extracting sensitive information of the vector map data and analyzing the content of the sensitive information;
s102, constructing an important information protection model based on a game theory, evaluating the behaviors of all participants in an important information protection scene of a vector map, calculating the profits of the participants and carrying out strategy analysis;
s103, aiming at given data of different participants, giving consideration to data security protection and usability requirements, and making an optimal decision;
s104, selecting geographical elements needing desensitization, and completing local desensitization of the vector map by using the generated chaotic sequence in combination with a sensitive information protection model and an optimal desensitization algorithm;
s105, outputting a map data result after local desensitization is completed;
the vector map data to be desensitized consists of a plurality of map layers, and specifically comprises the use condition of a sensitive geographic element, the relevance with other surrounding sensitive geographic elements and the weight occupied by the sensitive geographic element;
the total content of sensitive information of the vector map is shown as formula (1):
infr in formula (1) map Representing the total content of sensitive information of the vector map; i is the number of the geographic elements in the map layer; j is the layer number; n is the total number of layers; m is the total number of geographic elements in one map layer; weight ji Weight occupied by sensitive geographic elements; state ji A usage status for a sensitive geographic element; localization ji To a degree of closeness of association with other sensitive surrounding geographic elements.
2. A method of game theory based vector map optimized local desensitization according to claim 1, wherein: in step S102, the participants include: data defender D p And data attacker D a 。
3. A method of game theory based vector map optimized local desensitization according to claim 2, wherein:
data defending personD p The policy space of (a) is expressed as: s p =(s p1 ,s p2 …s pm );
Data attacker D a The policy space of (a) is expressed as: s a =(s a1 ,s a2 …s an );
Data defender D p The yield of (a) is expressed by formula (2):
in the formula (2), the reaction mixture is,is a data defender D p The benefit of sensitive information resulting from implementing a desensitization strategy,is a data defender D p Loss of shared data in the vector map caused by implementation of a desensitization policy; for sec Representing the total amount of sensitivity important information; for unsec Representing the total amount of sharing importance information; r represents a weighting factor; s ai As a policy space S a Any one of the above; s pi As a policy space S p Any one of the above;
data attacker D a Is expressed by formula (3):
in the formula (3), the reaction mixture is,representing data aggressors D a Sensitive information revenue obtained by executing the corresponding neutralization strategy;representing data aggressors D a Data defender D when executing certain sensitive information attack method p To data attacker D a The resulting loss of trust; the participants, the strategy space and the revenue function together form a four-tuple model G ═ (S) p ,S a ,u p ,u a )。
4. A method of game theory based vector map optimized local desensitization according to claim 3, wherein: step S103 specifically includes: while data defender D p And data attacker D a And when an optimal decision is made, the sensitive information protection model reaches a Nash equilibrium state, which is as the following formula (4):
wherein S pi and S ai are the optimal strategy for the data defender Dp and the optimal strategy for the data attacker Da, respectively.
5. A method of game theory based vector map optimized local desensitization according to claim 1, wherein: step S104 specifically includes:
s201: combining the composition characteristics of vector map elements, and generating a random noise set sequence by adopting a Henon two-dimensional chaotic system;
s202: and selecting the geographic elements needing to perform desensitization operation, and performing element-oriented deletion, offset, replacement, scrambling desensitization operation according to interference data in the random noise set sequence to complete local desensitization of the vector map.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110249302.2A CN113051357B (en) | 2021-03-08 | 2021-03-08 | Vector map optimization local desensitization method based on game theory |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110249302.2A CN113051357B (en) | 2021-03-08 | 2021-03-08 | Vector map optimization local desensitization method based on game theory |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113051357A CN113051357A (en) | 2021-06-29 |
CN113051357B true CN113051357B (en) | 2022-09-30 |
Family
ID=76510606
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110249302.2A Active CN113051357B (en) | 2021-03-08 | 2021-03-08 | Vector map optimization local desensitization method based on game theory |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113051357B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116757909B (en) * | 2023-08-21 | 2023-11-03 | 南京师范大学 | BIM data robust watermarking method, device and medium |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107862738A (en) * | 2017-11-28 | 2018-03-30 | 武汉大学 | One kind carries out doors structure three-dimensional rebuilding method based on mobile laser measurement point cloud |
CN108289095A (en) * | 2018-01-02 | 2018-07-17 | 诚壹泰合(北京)科技有限公司 | A kind of sensitive data storage method, apparatus and system |
CN108833402A (en) * | 2018-06-11 | 2018-11-16 | 中国人民解放军战略支援部队信息工程大学 | A kind of optimal defence policies choosing method of network based on game of bounded rationality theory and device |
CN110851463A (en) * | 2019-11-08 | 2020-02-28 | 南京国图信息产业有限公司 | Real estate registration data desensitization and spatialization method based on internet map geocoding engine |
CN111105338A (en) * | 2019-12-20 | 2020-05-05 | 长春理工大学 | Image encryption method based on GAN and chaotic system |
CN111163178A (en) * | 2020-01-10 | 2020-05-15 | 中国地质大学(武汉) | Game theory-based service deployment and task unloading method in edge computing |
CN111309831A (en) * | 2019-11-08 | 2020-06-19 | 南京国图信息产业有限公司 | Real estate geospatial data desensitization method based on bilinear interpolation model |
CN112035873A (en) * | 2020-08-18 | 2020-12-04 | 合肥市大数据资产运营有限公司 | Time-space trajectory data desensitization method |
CN112150339A (en) * | 2020-09-25 | 2020-12-29 | 南京师范大学 | Vector geographic data watermark encryption and decryption method and system |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7797341B2 (en) * | 2007-04-30 | 2010-09-14 | Hewlett-Packard Development Company, L.P. | Desensitizing database information |
CN101808020B (en) * | 2010-04-19 | 2012-05-30 | 吉林大学 | Intrusion response decision-making method based on incomplete information dynamic game |
US20140157415A1 (en) * | 2012-12-05 | 2014-06-05 | Ut-Battelle, Llc | Information security analysis using game theory and simulation |
CN103077211B (en) * | 2012-12-28 | 2016-05-04 | 南京师范大学 | A kind of scramble and method of reducing of GIS line of vector face figure layer data |
US10565595B2 (en) * | 2014-04-30 | 2020-02-18 | Visa International Service Association | Systems and methods for data desensitization |
CN105488434B (en) * | 2015-12-03 | 2018-11-02 | 江苏师范大学 | A kind of map vector completeness certification method based on label |
CN105825141A (en) * | 2016-02-02 | 2016-08-03 | 上海健晴信息技术有限公司 | Database Chinese name desensitization method based on complementary mapping |
CN106649532B (en) * | 2016-10-31 | 2020-12-11 | 电子科技大学 | Data desensitization method for address information |
CN107403110A (en) * | 2017-08-10 | 2017-11-28 | 中国民航信息网络股份有限公司 | HDFS data desensitization method and device |
CN110135184B (en) * | 2018-02-09 | 2023-12-22 | 中兴通讯股份有限公司 | Method, device, equipment and storage medium for desensitizing static data |
CN111048185B (en) * | 2019-12-25 | 2023-03-28 | 长春理工大学 | Interesting region parameter game analysis method based on machine learning |
-
2021
- 2021-03-08 CN CN202110249302.2A patent/CN113051357B/en active Active
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107862738A (en) * | 2017-11-28 | 2018-03-30 | 武汉大学 | One kind carries out doors structure three-dimensional rebuilding method based on mobile laser measurement point cloud |
CN108289095A (en) * | 2018-01-02 | 2018-07-17 | 诚壹泰合(北京)科技有限公司 | A kind of sensitive data storage method, apparatus and system |
CN108833402A (en) * | 2018-06-11 | 2018-11-16 | 中国人民解放军战略支援部队信息工程大学 | A kind of optimal defence policies choosing method of network based on game of bounded rationality theory and device |
CN110851463A (en) * | 2019-11-08 | 2020-02-28 | 南京国图信息产业有限公司 | Real estate registration data desensitization and spatialization method based on internet map geocoding engine |
CN111309831A (en) * | 2019-11-08 | 2020-06-19 | 南京国图信息产业有限公司 | Real estate geospatial data desensitization method based on bilinear interpolation model |
CN111105338A (en) * | 2019-12-20 | 2020-05-05 | 长春理工大学 | Image encryption method based on GAN and chaotic system |
CN111163178A (en) * | 2020-01-10 | 2020-05-15 | 中国地质大学(武汉) | Game theory-based service deployment and task unloading method in edge computing |
CN112035873A (en) * | 2020-08-18 | 2020-12-04 | 合肥市大数据资产运营有限公司 | Time-space trajectory data desensitization method |
CN112150339A (en) * | 2020-09-25 | 2020-12-29 | 南京师范大学 | Vector geographic data watermark encryption and decryption method and system |
Non-Patent Citations (2)
Title |
---|
"基于二维混沌***的矢量数字地图置乱加密";李安波;《中国矿业大学学报》;20150731;第747-753页 * |
"理性隐私度量方法研究及应用";张盼盼;《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》;20190515;第I138-73页 * |
Also Published As
Publication number | Publication date |
---|---|
CN113051357A (en) | 2021-06-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Bos et al. | Differential computation analysis: Hiding your white-box designs is not enough | |
Xue et al. | Intellectual property protection for deep learning models: Taxonomy, methods, attacks, and evaluations | |
Zhu et al. | Resilience analysis of power grids under the sequential attack | |
Makkar et al. | Secureiiot environment: Federated learning empowered approach for securing iiot from data breach | |
CN110096895B (en) | Service privacy disclosure detection method based on associated graph and Internet of things service platform | |
CN106790294A (en) | A kind of 5G network security risk evaluations method | |
CN112560059B (en) | Vertical federal model stealing defense method based on neural pathway feature extraction | |
CN111818102A (en) | Defense efficiency evaluation method applied to network target range | |
CN113051357B (en) | Vector map optimization local desensitization method based on game theory | |
Loukhaoukha | Image watermarking algorithm based on multiobjective ant colony optimization and singular value decomposition in wavelet domain | |
CN105447809B (en) | Encryption area image reversible water mark method based on weeds model | |
Hosseinzadeh et al. | Security and privacy in cloud computing via obfuscation and diversification: A survey | |
Wang et al. | Free fine-tuning: A plug-and-play watermarking scheme for deep neural networks | |
He et al. | A game theory-based incentive mechanism for collaborative security of federated learning in energy blockchain environment | |
Wang et al. | Rethinking the vulnerability of dnn watermarking: Are watermarks robust against naturalness-aware perturbations? | |
Zheng et al. | WMDefense: Using watermark to defense Byzantine attacks in federated learning | |
Chen et al. | Towards Reliable Utilization of AIGC: Blockchain-Empowered Ownership Verification Mechanism | |
CN102799837B (en) | Line and surface type global information system (GIS) vector data disguise and reduction method based on interpolation prediction | |
Lyu et al. | BCFDPS: A Blockchain‐Based Click Fraud Detection and Prevention Scheme for Online Advertising | |
Qu | Image encryption algorithm based on logistic chaotic scrambling system | |
Hua et al. | Big data security and privacy protection model based on image encryption algorithm | |
Huang et al. | Convolutional neural networks tamper detection and location based on fragile watermarking | |
Li et al. | Privacy-preserving DNN model authorization against model theft and feature leakage | |
Nwoke | Detection of pirated images on the internet using an algorithm | |
Degang et al. | A covert communication method based on gradient model |
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 |