CN110213279A - Dynamic network based on secret protection is averagely known together algorithm - Google Patents
Dynamic network based on secret protection is averagely known together algorithm Download PDFInfo
- Publication number
- CN110213279A CN110213279A CN201910496659.3A CN201910496659A CN110213279A CN 110213279 A CN110213279 A CN 110213279A CN 201910496659 A CN201910496659 A CN 201910496659A CN 110213279 A CN110213279 A CN 110213279A
- Authority
- CN
- China
- Prior art keywords
- state
- individual
- explicit
- implicit
- algorithm
- 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.)
- Granted
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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
It averagely knows together algorithm the present invention relates to a kind of dynamic network based on secret protection, communication security and data secret protection suitable for dynamic network.The algorithm is related to the decomposition of individual initial time state and the interaction of explicit state and implicit state.By decomposing scheme, guarantee individual time of day in interactive process always by stringent secret protection.Individual decomposes its initial time time of day, obtains explicit state and implicit state.In the algorithm, neighbours' individual in explicit state and network that individual generates interacts, and implicit state is only stored in individual itself, and only interacts with the explicit state of itself.Dynamic network proposed by the present invention is averagely known together Privacy preserving algorithms; under conditions of ensuring not revealing individual time of day in dynamic network and; accurately average common recognition can be reached; the problem of in dynamic network communication process easily privacy leakage occurs for effective solution individual state, ensure that communication security.
Description
Technical field
The invention belongs to electronic information communication technical fields, and in particular to mention in dynamic network to communicate individual sensitive information
For a kind of method of secret protection, including being decomposed based on individual time of day and based on the communication interaction side for reaching average common recognition
Method.
Background technique
With big data, the rapid development of the technologies such as Internet of Things and cloud computing, distributed optimization is more and more closed
Note, in wireless sensor network, machine learning, the fields such as smart grid are used widely.Compared to integrated system, distribution
Formula system has good fault-tolerance and robustness, and delay machine and local network communication failure for single individual, system is still
It is able to maintain that normal operation.In distributed network, all individuals in network how to be made to reach average common recognition, is one
Very important research direction.
In traditional average common recognition algorithm, in order to ensure all individuals in distributed network can finally be reached averagely
Unanimously, it is necessary to status information interactively with each other between individual.Information interchange between individual be often it is explicit, when by malicious attack
When, the privacy information of node is easy to happen leakage, this is a huge hidden danger safely for system.Such as in bank, medical treatment
In the systems such as health and smart grid, it is necessary to ensure that this information interchange is secret protection.Existing secret protection is average
Most of common recognition algorithm is all built upon in fixed network topology, in actual application, due to the fortune of communication failure and individual
Dynamic, network topology is frequently not fixed.
Summary of the invention
It averagely knows together algorithm the object of the present invention is to provide a kind of dynamic network based on secret protection, it is hidden in protection individual
On the basis of personal letter breath, reach accurate average common recognition.
In order to solve the above technical problems, the present invention adopts the following technical scheme that:
A kind of dynamic network based on secret protection is averagely known together algorithm, decomposition including initial time time of day and aobvious
The interaction of formula state and implicit state；It is characterized by: being decomposed according to the true initial state of individual to it, generate aobvious
Formula state and implicit state；Explicit state is normally communicated between individuals, and implicit state is hidden as privacy information；Dynamic
Implement the algorithm in state network, the parameter selection of related implicit state can reach accurately flat without the concern for network topology
Know together.Explicit state after decomposition is contacted with implicit state foundation, makes it that can carry out communication friendship constantly inside individual
Mutually, can not only receive information each other can also transmit information.
Further, the present invention provides a kind of decomposition of initial time time of day, and the time of day of initial time needs to divide
Solution is explicit state and implicit state, and is met: 2* initial time time of day=explicit state+implicit state；Arbitrarily not
The random combine of same explicit state and implicit state is only stored in individual itself for the implicit state of generation, in addition to itself
Explicit state can interact outer, other individuals are inaccessible.
Further, the present invention provides the exchange method of a kind of explicit state and implicit state, explicit state can with it is implicit
State establishes connection, and selection meets the related coefficient to impose a condition, the knot of the update of implicit state without the concern for network topology
Structure, with the increase of the number of iterations, the explicit state and implicit state of all individuals can converge to accurate average common recognition
Further, the present invention provides the algorithm implemented in a kind of dynamic network, and network topology changes at random, in dynamic
In network, for reaching the precondition of average common recognition, it is thus only necessary on non-empty, continuous, bounded time interval, Suo Youtuo
Flutter figure and figure be undirected strong continune.
Compared with prior art, the present invention its advantages are embodied in:
State decomposition may insure that in dynamic network, individual time of day is by stringent secret protection, explicit shape
State, implicit state communication interaction may insure that in dynamic network, individual can achieve accurate average common recognition, therefore by state
It decomposes and explicit state is combined with the communication interaction of implicit state, obtain having the dynamic network of secret protection averagely to know together calculation
Method.
Detailed description of the invention
Fig. 1 is the schematic diagram that individual state of the invention is decomposed.
Fig. 2 is that explicit state of the invention reaches the evolution accurately averagely known together.
Fig. 3 is that privacy state of the invention reaches the evolution accurately averagely known together.
Specific embodiment
The present invention carries out secret protection in dynamic network, to the information interchange of multiple bodies, it is ensured that individual time of day
It is not leaked.
Dynamic network with secret protection is averagely known together algorithm:
We are by the time of day x of individual i each in networki(t) it is decomposed intoWithWithFor
Random slave set of real numbers selection, meetsWhereinAs explicit state, it is responsible for and the neighbour in network
It occupies individual and carries out information exchange,As implicit state, only inside individual i andCarry out information exchange.hiIt (t) is individual
The random number that i is generated in moment t meets 0 < hi< 1, and only it is stored in individual i itself.
Below in conjunction with attached drawing, the present invention is further illustrated.
Fig. 1 is time of day decomposition diagram of the invention.Pass through the time of day x to individuali(t) it is decomposed, is obtained
To explicit stateAnd implicit stateWherein, individual explicit stateCommunication interaction is carried out between individuals,
The implicit state of individualInside individual i and explicit stateCarry out communication interaction.
Fig. 2 is explicit state of the inventionEvolution in dynamic network, communication interaction is explicit between individual
StateTime of day xi(t) it is not revealed to neighbours' individual, figure it is seen that all individual explicit states is flat
It knows together and accurately converges on numerical value 3.
Fig. 3 is implicit state of the inventionEvolution in dynamic network, implicit stateInside individual i
With explicit stateCommunication interaction ensure that implicit stateIt is invisible to other individuals.From figure 3, it can be seen that all
The average common recognition of individual implicit state accurately converges on numerical value 3.
It is obvious to a person skilled in the art that invention is not limited to the details of the above exemplary embodiments, Er Qie
In the case where without departing substantially from spirit or essential attributes of the invention, the present invention can be realized in other specific forms.Therefore, no matter
From the point of view of which point, the present embodiments are to be considered as illustrative and not restrictive, and the scope of the present invention is by appended power
Benefit requires rather than above description limits, it is intended that all by what is fallen within the meaning and scope of the equivalent elements of the claims
Variation is included within the present invention.Any reference signs in the claims should not be construed as limiting the involved claims.
In addition, it should be understood that although this specification is described in terms of embodiments, but not each embodiment is only wrapped
Containing an independent technical solution, this description of the specification is merely for the sake of clarity, and those skilled in the art should
It considers the specification as a whole, the technical solutions in the various embodiments may also be suitably combined, forms those skilled in the art
The other embodiments being understood that.
Claims (4)
- The algorithm 1. a kind of dynamic network based on secret protection is averagely known together, decomposition including initial time time of day and explicit The interaction of state and implicit state；It is characterized by: being decomposed according to the true initial state of individual to it, generate explicit State and implicit state；Explicit state is normally communicated between individuals, and implicit state is hidden as privacy information；In dynamic Implement the algorithm in network, the parameter selection of related implicit state can reach accurately average without the concern for network topology Common recognition.
- The algorithm 2. a kind of dynamic network based on secret protection according to claim 1 is averagely known together, it is characterised in that: just The time of day at moment beginning needs to be decomposed into explicit state and implicit state, and meets: 2* initial time time of day=aobvious Formula state+implicit state；The random combine of any different explicit state and implicit state, only deposits the implicit state of generation It is stored in individual itself, other than the explicit state of itself can interact, other individuals are inaccessible.
- The algorithm 3. a kind of dynamic network based on secret protection according to claim 1 is averagely known together, it is characterised in that: logical The rules of interaction of algorithm is crossed, explicit state can be established with implicit state and be contacted, and selection meets the related coefficient to impose a condition, hidden The update of formula state without the concern for network topology structure, with the increase of the number of iterations, the explicit state of all individuals and Implicit state can converge to accurate average common recognition, not will cause the loss of precision.
- The algorithm 4. a kind of dynamic network based on secret protection according to claim 1 is averagely known together, it is characterised in that: net Network topology changes at random, and in dynamic network, for reaching the precondition of average common recognition, not needing the network moment is all Undirected strong continune, it is thus only necessary on non-empty, continuous, bounded time interval, all topological diagrams and figure be undirected to connect by force Logical.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910496659.3A CN110213279B (en) | 2019-06-10 | 2019-06-10 | Privacy protection-based dynamic network average consensus method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910496659.3A CN110213279B (en) | 2019-06-10 | 2019-06-10 | Privacy protection-based dynamic network average consensus method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110213279A true CN110213279A (en) | 2019-09-06 |
| CN110213279B CN110213279B (en) | 2021-11-30 |
Family
ID=67791684
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910496659.3A Active CN110213279B (en) | 2019-06-10 | 2019-06-10 | Privacy protection-based dynamic network average consensus method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110213279B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110602129A (en) * | 2019-09-24 | 2019-12-20 | 苏州科技大学 | Privacy protection optimization method based on average consistency of utility mechanism |
| CN117675416A (en) * | 2024-02-01 | 2024-03-08 | 北京航空航天大学 | Privacy protection average consensus method for multi-agent networking system and multi-agent networking system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110022706A1 (en) * | 2009-07-21 | 2011-01-27 | International Business Machines Corporation | Method and System for Job Scheduling in Distributed Data Processing System with Identification of Optimal Network Topology |
| CN102970677A (en) * | 2012-11-27 | 2013-03-13 | 哈尔滨工业大学 | Wireless communication method based on monitoring Gossip average common view technology |
| CN103108382A (en) * | 2012-11-20 | 2013-05-15 | 南京邮电大学 | Heterogeneous network multi-attribute decision-making method based on network analytic hierarchy process |
| CN105245362A (en) * | 2015-09-14 | 2016-01-13 | 河南工业大学 | SDN (Software Defined Network) environment important node information acquisition method |
| CN109842115A (en) * | 2019-02-01 | 2019-06-04 | 南京理工大学 | A kind of improved average homogeneity algorithm |
-
2019
- 2019-06-10 CN CN201910496659.3A patent/CN110213279B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110022706A1 (en) * | 2009-07-21 | 2011-01-27 | International Business Machines Corporation | Method and System for Job Scheduling in Distributed Data Processing System with Identification of Optimal Network Topology |
| CN103108382A (en) * | 2012-11-20 | 2013-05-15 | 南京邮电大学 | Heterogeneous network multi-attribute decision-making method based on network analytic hierarchy process |
| CN102970677A (en) * | 2012-11-27 | 2013-03-13 | 哈尔滨工业大学 | Wireless communication method based on monitoring Gossip average common view technology |
| CN105245362A (en) * | 2015-09-14 | 2016-01-13 | 河南工业大学 | SDN (Software Defined Network) environment important node information acquisition method |
| CN109842115A (en) * | 2019-02-01 | 2019-06-04 | 南京理工大学 | A kind of improved average homogeneity algorithm |
Non-Patent Citations (1)
| Title |
|---|
| YONGQIANG WANG: "privacy-preserving Avereage Consensus via State Decomposition", 《IEEE》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110602129A (en) * | 2019-09-24 | 2019-12-20 | 苏州科技大学 | Privacy protection optimization method based on average consistency of utility mechanism |
| CN110602129B (en) * | 2019-09-24 | 2021-08-20 | 苏州科技大学 | Privacy protection optimization method based on average consistency of utility mechanism |
| CN117675416A (en) * | 2024-02-01 | 2024-03-08 | 北京航空航天大学 | Privacy protection average consensus method for multi-agent networking system and multi-agent networking system |
| CN117675416B (en) * | 2024-02-01 | 2024-04-09 | 北京航空航天大学 | Privacy protection average consensus method for multi-agent networking system and multi-agent networking system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110213279B (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Cheng et al. | Evolutionarily stable strategy of networked evolutionary games | |
| Zhang et al. | Epidemic dynamics on semi-directed complex networks | |
| CN106778011A (en) | A kind of scholar's influence power appraisal procedure based on academic heterogeneous network | |
| CN110213279A (en) | Dynamic network based on secret protection is averagely known together algorithm | |
| Yuan et al. | Interplay between structure and dynamics in adaptive complex networks: Emergence and amplification of modularity by adaptive dynamics | |
| Tan et al. | A Banzhaf function for a fuzzy game | |
| CN109002468A (en) | The cluster anonymous methods and system of diagram data publication secret protection | |
| CN117370804A (en) | Extensible personalized heterogeneous method for medical data analysis based on federal blockchain | |
| Chuang et al. | Simulating Opinion Dynamics with Networks of LLM-based Agents | |
| Sun et al. | An exploration and simulation of epidemic spread and its control in multiplex networks | |
| Dong et al. | A class of rumor spreading models with population dynamics | |
| Zhang et al. | Convergence properties analysis of gradient neural network for solving online linear equations | |
| Piraveenan et al. | On congruity of nodes and assortative information content in complex networks | |
| Zhou et al. | Using coalitional games to detect communities in social networks | |
| CN103200034B (en) | Network user structure disturbance method based on spectral constraint and sensitive area partition | |
| Liu et al. | Topology preservation and cooperative learning in identification of multiple model systems | |
| Rahimian et al. | (Non-) bayesian learning without recall | |
| Meng et al. | A study of rumor spreading with epidemic model based on network topology | |
| Wu et al. | Cluster synchronization in community network with nonidentical nodes via intermittent pinning control | |
| Bi et al. | A Group Fairness Lens for Large Language Models | |
| Fazli et al. | Dynamics of Rumor Spreading With a Controller Agent | |
| Suantai et al. | Swarming Computational Procedures for the Coronavirus-Based Mathematical SEIR-NDC Model | |
| CN103269342A (en) | High-dimensional large-scale packet matching method based on IPV6 | |
| Fan et al. | An individual-based mean-field model for fake-news spreading on PSO-based networks | |
| Amirjanov | The cooperative and competitive mechanisms of a leader’s opinion transmission |
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 |