CN104735654A - Private data fusing method capable of detecting data integrity - Google Patents

Private data fusing method capable of detecting data integrity Download PDF

Info

Publication number
CN104735654A
CN104735654A CN201510104390.1A CN201510104390A CN104735654A CN 104735654 A CN104735654 A CN 104735654A CN 201510104390 A CN201510104390 A CN 201510104390A CN 104735654 A CN104735654 A CN 104735654A
Authority
CN
China
Prior art keywords
data
node
bunch
nodes
mac
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
Application number
CN201510104390.1A
Other languages
Chinese (zh)
Inventor
徐光侠
胡杰
刘宴兵
常光辉
李娜
吴群
梁绍飞
李来军
高诗意
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201510104390.1A priority Critical patent/CN104735654A/en
Publication of CN104735654A publication Critical patent/CN104735654A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/04—Key management, e.g. using generic bootstrapping architecture [GBA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/10—Integrity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a private data fusing method capable of detecting data integrity. The invention provides a data fusing method capable of conducting data integrity and privacy protection, and relates to privacy protection and integrity detection of node data in wireless sensor network data fusion. In the process of data transmission between nodes of a wireless sensor network, an attacker easily infuses false data or tampers the data, so that the data are not coincident with original data collected by the nodes. The method is provided, homomorphism information verification codes are added in the process of data fusion of the nodes, real secret keys of the nodes and the correspondingly-generated information verification code are changed along with changes of the stored data, and the secret keys stored in the nodes are not changed. Even though the attacker captures the secret keys and the data of the nodes at the same time, the real secret keys of the nodes cannot be obtained, and the integrity and the privacy protection of the data are achieved.

Description

A kind of can the private data fusion method of check data integrity
Technical field
The present invention relates to technology of wireless sensing network and wireless communication technology field, specifically wireless sensor network data merges secret protection and the integrity detection of interior joint data.
Background technology
Wireless sensor network (Wireless Sensor Network, WSN) is the important component part of Internet of Things, and it collects information by the great deal of nodes of random distribution in network, and returns to region and carry out treatment and analysis for inquiring user.Due to the energy of node each in WSN and resource-constrained, be difficult to transmit a large amount of sensing datas, the method adopting each node to transfer data to separately QS in the process of information is inappropriate, namely can increase communication overhead, can reduce again the efficiency of Information Monitoring.Therefore, in order to the energy consumption in WSN effectively can be reduced, the effective Data fusion technique of general employing.Data fusion is a kind of data query processing scheme efficiently in sensor network, and many numbers according to processing, are combined into the data more effectively, more meeting user's request by it.Data fusion technique is widely used in daily life, such as, in the application of forest fire protection, needs the ambient temperature data to multiple temperature sensor detects to merge; In Motion parameters application, need to carry out fusion treatment to the view data of image monitoring transducer collection.In sensor application, be only concerned about monitoring result time most of, do not need to receive a large amount of initial data, data fusion is the important means realizing this object.
The basis that the information collected in sensor network is applied as Internet of Things is one of valuable source of Internet of Things, and because QS directly can not obtain the data that all nodes collect, its fail safe is a major challenge in this field always.Safety issue is not only confined to secret protection aspect, also comprises the integrality of information.In TAG algorithm, data are upwards transmitted along fusion tree and merge by wireless channel by node, and final QS obtains the fused data needed.But due to the characteristic of wireless transmission, the data of inter-node transmission are easily captured or eavesdrop.Trust father node and can obtain the data of child node, if father node or link monitored so that catch, the privacy of data can be destroyed.Therefore, in data fusion, carry out secret protection to data to be necessary.
The integrity detection of data is another importances of safety issue.Can be judged that by integrity detection whether the initial data that the data obtained are collected with node is consistent exactly, to prevent from injecting data that are false or that be tampered in transmitting procedure.Information after data fusion is used to for customer analysis and process, or formulates corresponding solution, and the correctness of data directly affects the judgement of user.If the destroy integrity of information, the information after fusion will be inconsistent with raw information, and user relies on the analysis that this information carries out will have deviation.So it is very important for carrying out integrity detection to data in data fusion.
At present, proposed the private data fusion method of some check data integrity, although polymerization result accuracy is high, computing cost and communication overhead are all too large, and integrity detection mechanism also imperfection, the scope of application has limitation.
Summary of the invention
For deficiency of the prior art, the object of the present invention is to provide that a kind of scope of application is wide, integrity detection comprehensively and all less method of communication overhead and computing cost, technical scheme of the present invention is as follows: a kind of can the private data fusion method of check data integrity, it comprises the following steps:
101, in wireless sensor network, described wireless sensor network has some nodes and querying server QS, querying server QS adopts random key distribution mechanism to carry out encryption key distribution end to end for each node, be specially and distribute to each node private cipher key k and disclose to the prime number C in whole wireless sensor network, QS stores ID and the private cipher key k of all nodes simultaneously; Querying server QS transmission includes the hello signal bag of shared key m to each node;
102, in certain region S of wireless sensor network, build a bunch of group, bunch group comprises a leader cluster node and some bunches of internal segments, and distribute an array J [N] for each leader cluster node, for storing the number of slices of all nodes in same bunch, the call number of array J [N] and the ID one_to_one corresponding of all nodes, if certain node does not belong to this bunch, then the value corresponding to array index number that this node ID is corresponding is always 0;
103, the cutting of data equivalent is carried out to all nodes comprising leader cluster node and some bunches of interior nodes in bunch group and obtain slice of data, be i.e. bunch C ithere is n iindividual member, size namely bunch is n i, then a node of this bunch will send n i-1 part of slice of data is to other nodes in this bunch, and each node self retains 1 part of slice of data, remaining n iother node in-1 part of slice of data sends to bunch, the data after wherein sending to the data of other node to be through encryption, the data after encryption comprise slice of data and Message Authentication Code MAC value;
104, as a bunch C iinterior n iindividual member node all accepts other nodes and forwards the data after encryption come, and to after the decrypt data after encryption, the data after the private data that self is retained and deciphering to carry out bunch in data isomorphism merge; Then node by through bunch in data isomorphism merge data through encryption be broadcast to leader cluster node again, then leader cluster node to bunch in fused data be decrypted, and by after self fused data and deciphering bunch in fused data carry out isomorphism fusion calculation and obtain fusion results, complete a bunch interior nodes data fusion;
105, leader cluster node is sent to querying server QS the routing tree that the fusion results calculated is set up along data anastomosing algorithm TAG; After bunch head data aggregate completes, now querying server QS obtains the final fusion results of network, and carries out the integrity detection of data;
If the integrality of 106 data is wrong, leader cluster node is no longer according to fusion tree uploading data, but directly by data upload to querying server QS, carry out data integrity detection separately, until find out the destroyed leader cluster node of all data integrities, the leader cluster node that this is destroyed feeds back to user.
Further, the Message Authentication Code MAC value described in step 103 is, supposes that only setting up one in WSN merges tree, for node i, wherein a is the initial data of node, and set three keys k, m, C, k is the private cipher key of each node, only has node self and QS node to know, N represents in a fusion tree have N number of node, will produce k 1~ k nn number of key altogether; M is the shared key that tree is merged in a network area, and same the shared key merging tree interior joint is identical; C is each node that a prime number is disclosed in network.
Further, as in step 103 bunch of C in iwhen being 3, namely bunch interior nodes respectively: X, Y and Z, and suppose that node Z is bunch head of this bunch, DATA x, DATA y, DATA zrepresent the private data of three nodes respectively, if it is three that the private data of nodes X is split, be expressed as DATA x=seed x+ seed xY+ seed xZ, wherein seed xfor the private data that node self retains, seed xYfor nodes X sends to the slice of data of Y, seed xZfor nodes X sends to the slice of data of Z, through encryption, the slice of data that nodes X finally issues node Y is ID x| seed xY| MAC (seed xY, k x), now DATA x=DATA x-seed xY.
Further, when comprising the following steps after the deciphering in step 104: the slice of data sent as node Y reception X, after the deciphering of link communication shared key, proceeds as follows: calculate REC y=REC y+ seed xY, MAC y=MAC y⊕ MAC (seed xY, k x), REC yrepresent the data that node Y receives, MAC yrepresent the Message Authentication Code of node Y data, represent and merge, when bunch in all nodes send and accept after slice of data completes, node carries out calculating for nodes X as follows: MAC x=MAC x⊕ MAC (DATA x, k a); DATA x=DATA x+ REC x; AGG x=AGG x+ DATA x; DMAC x=DMAC x⊕ MAC x.
Advantage of the present invention and beneficial effect as follows:
Due to the private data fusion method of more existing check data integrity, although polymerization result accuracy is high, in the process detected communication overhead and computing cost all larger, and integrity detection mechanism also imperfection, the scope of application has limitation.Meet the secret protection of data to overcome the defect existed in above-mentioned prior art simultaneously; the present invention proposes a kind of data fusion method of carrying out data integrity and secret protection; homomorphism Message Authentication Code is added by the process of carrying out data mixing at node; the MAC of the true key of node and corresponding generation is changed along with the change storing data, and the storage key of node self does not change.Even if assailant captures key and the data of node, but also cannot obtain node true key simultaneously, therefore can meet integrality and the secret protection of data simultaneously.If QS detects that the integrality of data is wrong, interdependent node can be traced back to and carry out integrity detection, and the true key calculated by QS judges the concrete node attacked.Therefore make integrity detection more comprehensive, the scope of application is wider.
Accompanying drawing explanation
Fig. 1 is data fusion model figure involved in the present invention;
Fig. 2 is the fusion general principle figure of homomorphism Message Authentication Code of the present invention;
Fig. 3 is network model figure of the present invention;
Fig. 4 is that of the present invention bunch of interior nodes slice of data merges schematic flow sheet;
Fig. 5 is of the present invention bunch of interior nodes data fusion schematic flow sheet;
Fig. 6 is leader cluster node data fusion schematic flow sheet of the present invention;
Fig. 7 is flow chart of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, clear, complete description is carried out to the technical scheme in the embodiment of the present invention.Obviously, described embodiment is only one embodiment of the present of invention, instead of whole embodiments.
Fig. 1 is Data-Fusion Model for Wireless Sensor Network figure of the present invention.Data fusion model defined herein is y (t)=f (d 1(t), d 2(t) ... d n(t)), d i(t) (i=1 ..., N) and represent the data that node i collects in t.Due to a lot of data fusion function, as count, average etc. can be reduced to sum function, therefore the present invention is with sum function for research object, remembers
Fig. 2 is the fusion general principle figure of homomorphism Message Authentication Code of the present invention.If the initial data of node is a, set three keys k, m, C.K is the private cipher key of each node, only has node self and QS node to know.Suppose there is N number of node in a fusion tree, will k be produced 1~ k nn number of key altogether; M is the shared key that tree is merged in a network area, and same the shared key merging tree interior joint is identical; C is each node that a larger prime number is disclosed in network.Suppose that only setting up one in WSN merges tree, for node i, its Message Authentication Code MAC value is
The process merging two MAC value according to isomorphism is as follows:
If the data of node collection are a 1, the data received are a 2, according to sum function, obtaining fusion results is A=a 1+ a 2.By MAC (a 1, k 1) and MAC (a 2, k 2) calculate AMAC (MAC value of data A): AMAC=MAC (a as follows 1, k 1) * MAC (a 2, k 2), this formula is calculated further: AMAC = MAC ( a 1 , k 1 ) * MAC ( a 2 , k 2 ) = ( m a 1 + k 1 mod C ) * ( m a 2 + k 2 mod C ) = m a 1 + k 1 * m a 2 + k 2 mod C = m ( a 1 + a 2 ) + ( k 1 + k 2 ) mod C = MAC ( a 1 + a 2 , k 1 + k 2 ) ;
Therefore obtain the MAC value of data A, true key is now k 1+ k 2instead of k 1.
Fig. 3 is network model figure of the present invention.Be divided into three layers: QS, leader cluster node layer, bunch in ordinary node layer.In bunch, all nodes all carry out the collection of data.First, the data collected are cut into slices, mutually mix between bunch interior nodes; Secondly, mixed data are all sent to leader cluster node by bunch interior nodes; Last leader cluster node is sent to QS the routing tree that the fusion results calculated is set up along TAG algorithm.QS is decrypted after receiving transmission data, according to the correlation properties of homomorphism Message Authentication Code, first calculate true key, then true key and fused data is utilized to calculate corresponding MAC, whether equal with the MAC value calculated by comparing the MAC value uploaded up, judge the integrality of data.But when data integrity is destroyed, will backtracking error correction be carried out.In this stage, leader cluster node no longer according to fusion tree uploading data, but directly by data upload to QS.
Fig. 4 is of the present invention bunch of interior nodes slice of data mixture length schematic diagram.This process will experience two stages: first stage is the data slicer stage, namely cuts into slices to bunch interior nodes data.Suppose a bunch of C ithere is n iindividual member, then a node in this bunch will send n i-1 data slice gives other node in this bunch, now node burst number J x=n i.Conveniently discuss, use in figure comprise three nodes bunch simple scheme, its bunch of interior nodes respectively: X, Y and Z, and suppose that node Z is bunch head of this bunch.DATA x, DATA y, DATA zrepresent the private data of three nodes respectively.If it is three that the private data of nodes X is split, be expressed as DATA x=seed x+ seed xY+ seed xZ, wherein seed xfor the private data that node self retains, seed xYfor nodes X sends to the slice of data of Y.Through data encryption, nodes X finally sends to the slice of data of node Y to be ID x| seed xY| MAC (seed xY, k x), now DATA x=DATA x-seed xY.Second stage accepts the slice of data stage.Node Y receives the slice of data that X sends, and after the deciphering of link communication shared key, proceeds as follows: calculate REC y=REC y+ seed xY, MAC y=MAC y⊕ MAC (seed xY, k x).When bunch in all nodes send and accept after slice of data completes, node calculates as follows (for nodes X): MAC x=MAC x⊕ MAC (DATA x, k a); DATA x=DATA x+ REC x; AGG x=AGG x+ DATA x; DMAC x=DMAC x⊕ MAC x.
Fig. 5 is of the present invention bunch of interior nodes data fusion schematic flow sheet.After bunch interior nodes slice of data mixed process, the data of X, Y, Z are respectively: J x| DMAC x| AGG x, J y| DMAC y| AGG y, J z| DMAC z| AGG z, nodes X, Y by data broadcast to leader cluster node Z, now J z[N]=0 ..., 0, J x, J y, J z, 0 ..., 0}, node Z receive data and calculate as follows: DMAC z=DMAC z⊕ DMAC x⊕ DMAC y; AGG z=AGG z+ AGG x+ AGG y.
Fig. 6 is leader cluster node data fusion schematic flow sheet of the present invention.Leader cluster node is sent to QS the routing tree that the result calculated is set up along TAG algorithm.Leader cluster node, except uploading data, also will upload all number of slices J collected i.The data uploaded as node are J x| J y| J z| DMAC z| AGG z.
Fig. 7 is flow chart of the present invention, the invention provides a kind of can the private data fusion method of check data integrity, comprise the steps:
S1: QS node and each node carry out encryption key distribution end to end in wireless sensor network, the present invention uses random key distribution mechanism, only distributes to node private cipher key in this link, and a larger prime number is disclosed each node in network;
S2: shared key m is to all nodes in tree when a fusion tree sends out hello signal bag, each node can select oneself as a bunch head, after leader cluster node produces, for each leader cluster node distributes an array J [N], for storing the number of slices of all nodes in same bunch, then carry out the use of data backtracking error correction stages.
S3:: to bunch in each node carry out data slicer, node self retains a data, all the other to send to bunch in other node; Data after sending to the data of other node to be through encryption, data comprise slice of data and MAC value.
The data of respective type to decrypt data, and are mixed by S4: in bunch, member accepts slice of data; Mixed data are broadcast to leader cluster node through encryption by node again, and then leader cluster node carries out correlation computations to data and merges.
S5: leader cluster node is sent to QS the routing tree that the fusion results calculated is set up along TAG algorithm;
S6: after a bunch head data aggregate completes, now QS obtains the final fusion results of network, and carries out the integrity detection of data;
S7: if the integrality of data is wrong, leader cluster node no longer according to fusion tree uploading data, but directly by data upload to QS, carry out data integrity detection separately, until find out the destroyed leader cluster node of all data integrities.
Random key distribution mechanism scheme is used to carry out the encryption and decryption of data in the present invention.Due to the characteristic of wireless transmission, the communication link between wireless sensor network interior joint is easily destroyed, and the data of transmission are easily monitored.In order to ensure internodal communication link safety, often need enciphered data.Use random key distribution mechanism herein.First generate the pool of keys that has K key, then give each node Random assignment k key, if neighbor node and the same key of this nodes sharing, so these two nodes will set up the communication link of a safety.The probability of the key that any two nodes sharing are same is p=1-((K-k)! ) 2/ (K! (K-2k)! ).If the 3rd node also obtains this key, then the safety of communication link will be destroyed, and destroyed probability is p overhead=k/K.Under normal conditions, p overheadit is a very little number.
These embodiments are interpreted as only being not used in for illustration of the present invention limiting the scope of the invention above.After the content of reading record of the present invention, technical staff can make various changes or modifications the present invention, and these equivalence changes and modification fall into the scope of the claims in the present invention equally.

Claims (4)

1. can the private data fusion method of check data integrity, it is characterized in that: comprise the following steps:
101, in wireless sensor network, described wireless sensor network has some nodes and querying server QS, querying server QS adopts random key distribution mechanism to carry out encryption key distribution end to end for each node, be specially and distribute to each node private cipher key k and disclose to the prime number C in whole wireless sensor network, QS stores ID and the private cipher key k of all nodes simultaneously; Querying server QS transmission includes the hello signal bag of shared key m to each node;
102, in certain region S of wireless sensor network, build a bunch of group, bunch group comprises a leader cluster node and some bunches of internal segments, and distribute an array J [N] for each leader cluster node, for storing the number of slices of all nodes in same bunch, the call number of array J [N] and the ID one_to_one corresponding of all nodes, if certain node does not belong to this bunch, then the value corresponding to array index number that this node ID is corresponding is always 0;
103, the cutting of data equivalent is carried out to all nodes comprising leader cluster node and some bunches of interior nodes in bunch group and obtain slice of data, be i.e. bunch C ithere is n iindividual member, size namely bunch is n i, then a node of this bunch will send n i-1 part of slice of data is to other nodes in this bunch, and each node self retains 1 part of slice of data, remaining n iother node in-1 part of slice of data sends to bunch, the data after wherein sending to the data of other node to be through encryption, the data after encryption comprise slice of data and Message Authentication Code MAC value;
104, as a bunch C iinterior n iindividual member node all accepts other nodes and forwards the data after encryption come, and to after the decrypt data after encryption, the data after the private data that self is retained and deciphering to carry out bunch in data isomorphism merge; Then node by through bunch in data isomorphism merge data through encryption be broadcast to leader cluster node again, then leader cluster node to bunch in fused data be decrypted, and by after self fused data and deciphering bunch in fused data carry out isomorphism fusion calculation and obtain fusion results, complete a bunch interior nodes data fusion;
105, leader cluster node is sent to querying server QS the routing tree that the fusion results calculated is set up along data anastomosing algorithm TAG; After bunch head data aggregate completes, now querying server QS obtains the final fusion results of network, and carries out the integrity detection of data;
If the integrality of 106 data is wrong, leader cluster node is no longer according to fusion tree uploading data, but directly by data upload to querying server QS, carry out data integrity detection separately, until find out the destroyed leader cluster node of all data integrities, the leader cluster node that this is destroyed feeds back to user.
2. according to claim 1 a kind of can the private data fusion method of check data integrity, it is characterized in that: the Message Authentication Code MAC value described in step 103 is, suppose that only setting up one in WSN merges tree, for node i, wherein a is the initial data of node, and set three keys k, m, C, k is the private cipher key of each node, only has node self and QS node to know, N represents in a fusion tree have N number of node, will produce k 1~ k nn number of key altogether; M is the shared key that tree is merged in a network area, and same the shared key merging tree interior joint is identical; C is each node that a prime number is disclosed in network.
3. according to claim 1 a kind of can the private data fusion method of check data integrity, it is characterized in that: as in step 103 bunch of C in iwhen being 3, namely bunch interior nodes respectively: X, Y and Z, and suppose that node Z is bunch head of this bunch, DATA x, DATA y, DATA zrepresent the private data of three nodes respectively, if it is three that the private data of nodes X is split, be expressed as DATA x=seed x+ seed xY+ seed xZ, wherein seed xfor the private data that node self retains, seed xYfor nodes X sends to the slice of data of Y, seed xZfor nodes X sends to the slice of data of Z, through encryption, the slice of data that nodes X finally issues node Y is ID x| seed xY| MAC (seed xY, k x), now DATA x=DATA x-seed xY.
4. according to claim 1 a kind of can the private data fusion method of check data integrity, it is characterized in that: when comprising the following steps after the deciphering in step 104: the slice of data sent as node Y reception X, after the deciphering of link communication shared key, proceed as follows: calculate REC y=REC y+ seed xY, MAC y=MAC y⊕ MAC (seed xY, k x), REC yrepresent the data that node Y receives, MAC yrepresent the Message Authentication Code of node Y data, ⊕ represents fusion, when bunch in all nodes send and accept after slice of data completes, node carries out calculating for nodes X as follows: MAC x=MAC x⊕ MAC (DATA x, k a); DATA x=DATA x+ REC x; AGG x=AGG x+ DATA x; DMAC x=DMAC x⊕ MAC x.
CN201510104390.1A 2015-03-10 2015-03-10 Private data fusing method capable of detecting data integrity Pending CN104735654A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510104390.1A CN104735654A (en) 2015-03-10 2015-03-10 Private data fusing method capable of detecting data integrity

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510104390.1A CN104735654A (en) 2015-03-10 2015-03-10 Private data fusing method capable of detecting data integrity

Publications (1)

Publication Number Publication Date
CN104735654A true CN104735654A (en) 2015-06-24

Family

ID=53458997

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510104390.1A Pending CN104735654A (en) 2015-03-10 2015-03-10 Private data fusing method capable of detecting data integrity

Country Status (1)

Country Link
CN (1) CN104735654A (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105657642A (en) * 2016-01-08 2016-06-08 重庆邮电大学 Clustering non-encrypted type privacy-preserving data aggregation method
CN106059774A (en) * 2016-05-31 2016-10-26 东南大学 Data slice mixture privacy protection method based on cluster
CN107231628A (en) * 2017-05-12 2017-10-03 南京邮电大学 A kind of secure data fusion method suitable for many application scenarios
CN108152577A (en) * 2017-10-18 2018-06-12 广东科学技术职业学院 A kind of point-to-point intelligent metering method
CN108347420A (en) * 2017-01-25 2018-07-31 华为技术有限公司 A kind of method, relevant device and the system of netkey processing
CN110135196A (en) * 2019-05-10 2019-08-16 内蒙古工业大学 A kind of data fusion tamper resistant method based on input data compression expression association analysis
CN111258295A (en) * 2020-01-15 2020-06-09 重庆长安汽车股份有限公司 System and method for verifying big data acquisition and uploading accuracy
CN111865989A (en) * 2020-07-23 2020-10-30 湘潭大学 Data security protection method for intelligent electric meter
CN112165693A (en) * 2020-09-28 2021-01-01 贵州大学 Safe and efficient privacy protection data fusion method
CN112584325A (en) * 2021-01-13 2021-03-30 海南大学 Underwater sensor safety data fusion method based on dynamic slicing technology
CN112911599A (en) * 2021-01-20 2021-06-04 沈阳化工大学 Low-energy-consumption data fusion recessive method supporting integrity verification of wireless sensor network
CN113423129A (en) * 2021-05-25 2021-09-21 沈阳化工大学 Internet of things IM-D-SMART method based on negative fraction
CN114866352A (en) * 2022-07-06 2022-08-05 山东省计算中心（国家超级计算济南中心） Method and program product for protecting industrial internet data privacy and integrity

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102638791A (en) * 2012-04-11 2012-08-15 南京邮电大学 Protection method for fusion integrity of sensor network data
CN103200185A (en) * 2013-03-14 2013-07-10 重庆邮电大学 Data safe transmission method in body area network system
CN103795529A (en) * 2014-02-26 2014-05-14 东南大学 Wireless sensor network data safety infusion method based secret key vectors

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102638791A (en) * 2012-04-11 2012-08-15 南京邮电大学 Protection method for fusion integrity of sensor network data
CN103200185A (en) * 2013-03-14 2013-07-10 重庆邮电大学 Data safe transmission method in body area network system
CN103795529A (en) * 2014-02-26 2014-05-14 东南大学 Wireless sensor network data safety infusion method based secret key vectors

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
ZHENGWEI GUO, XIAOJIAO DING: "Low energy-consuming cluster-based algorithm to enforce integrity and preserve privacy in data aggregation", 《2014 13TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING AND SCIENCE》 *
冯艳芬、刘宴兵: "基于分簇的低能耗数据融合隐私保护协议", 《计算机应用研究》 *
李玮、杨庚: "保护隐私性与完整性的低能耗数据融合算法", 《计算机应用》 *

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105657642A (en) * 2016-01-08 2016-06-08 重庆邮电大学 Clustering non-encrypted type privacy-preserving data aggregation method
CN105657642B (en) * 2016-01-08 2019-01-22 重庆邮电大学 A kind of non-encrypted formula secret protection data fusion method of sub-clustering
CN106059774A (en) * 2016-05-31 2016-10-26 东南大学 Data slice mixture privacy protection method based on cluster
CN106059774B (en) * 2016-05-31 2019-01-29 东南大学 Data slicer mixing method for secret protection based on sub-clustering
US11917054B2 (en) 2017-01-25 2024-02-27 Huawei Technologies Co., Ltd. Network key processing method and system and related device
US11431479B2 (en) 2017-01-25 2022-08-30 Huawei Technologies Co., Ltd. Network key processing method and system and related device
CN108347420A (en) * 2017-01-25 2018-07-31 华为技术有限公司 A kind of method, relevant device and the system of netkey processing
CN107231628B (en) * 2017-05-12 2020-04-14 南京邮电大学 Safety data fusion method suitable for multiple application scenes
CN107231628A (en) * 2017-05-12 2017-10-03 南京邮电大学 A kind of secure data fusion method suitable for many application scenarios
CN108152577A (en) * 2017-10-18 2018-06-12 广东科学技术职业学院 A kind of point-to-point intelligent metering method
CN110135196A (en) * 2019-05-10 2019-08-16 内蒙古工业大学 A kind of data fusion tamper resistant method based on input data compression expression association analysis
CN111258295A (en) * 2020-01-15 2020-06-09 重庆长安汽车股份有限公司 System and method for verifying big data acquisition and uploading accuracy
CN111865989A (en) * 2020-07-23 2020-10-30 湘潭大学 Data security protection method for intelligent electric meter
CN112165693A (en) * 2020-09-28 2021-01-01 贵州大学 Safe and efficient privacy protection data fusion method
CN112165693B (en) * 2020-09-28 2022-07-01 贵州大学 Safe and efficient privacy protection data fusion method
CN112584325A (en) * 2021-01-13 2021-03-30 海南大学 Underwater sensor safety data fusion method based on dynamic slicing technology
CN112911599A (en) * 2021-01-20 2021-06-04 沈阳化工大学 Low-energy-consumption data fusion recessive method supporting integrity verification of wireless sensor network
CN113423129A (en) * 2021-05-25 2021-09-21 沈阳化工大学 Internet of things IM-D-SMART method based on negative fraction
CN114866352A (en) * 2022-07-06 2022-08-05 山东省计算中心（国家超级计算济南中心） Method and program product for protecting industrial internet data privacy and integrity

Similar Documents

Publication Publication Date Title
CN104735654A (en) Private data fusing method capable of detecting data integrity
Castelluccia et al. Efficient aggregation of encrypted data in wireless sensor networks
Jung et al. Collusion-tolerable privacy-preserving sum and product calculation without secure channel
Li et al. Privacy-preserving distributed profile matching in proximity-based mobile social networks
CN106059774B (en) Data slicer mixing method for secret protection based on sub-clustering
CN103795529A (en) Wireless sensor network data safety infusion method based secret key vectors
He et al. A cluster-based protocol to enforce integrity and preserve privacy in data aggregation
Li et al. Secure and energy-efficient data aggregation with malicious aggregator identification in wireless sensor networks
CN103763702B (en) A kind of two layers sensor network range query system and method for secret protection
Zhang et al. Preserving privacy against external and internal threats in WSN data aggregation
CN106714088B (en) Continuous data aggregation method facing privacy protection in sensor network
CN104363593A (en) Two-tier sensor network oriented verifiable Top-k query processing method
CN104717644B (en) A kind of two layers of sensor network range query method that can verify that secret protection
Yu et al. Constrained function-based message authentication for sensor networks
CN101594271A (en) Wireless self-organization network establishment and method of work and network of relation and equipment
Bista et al. A new sensitive data aggregation scheme for protecting integrity in wireless sensor networks
Murugeshwari et al. Effective data aggregation in WSN for enhanced security and data privacy
Shu et al. Detection of malicious packet dropping in wireless ad hoc networks based on privacy-preserving public auditing
CN110166243B (en) Aggregation data privacy protection method based on elliptic curve in crowd sensing
Gaikwad et al. Survey on secure data aggregation in wireless sensor networks
Samanthula et al. A probabilistic encryption based MIN/MAX computation in wireless sensor networks
Jin et al. Secure data collection in constrained tree-based smart grid environments
Erfani et al. Privacy-preserving data aggregation in participatory sensing networks
Vinodha et al. Discrete Integrity Assuring Slice‐Based Secured Data Aggregation Scheme for Wireless Sensor Network (DIA‐SSDAS)
Kifayat et al. Group based secure communication for large-scale wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into 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: 20150624