CN113949575A - Block chain frame construction counting data storage method based on edge node calculation - Google Patents
Block chain frame construction counting data storage method based on edge node calculation Download PDFInfo
- Publication number
- CN113949575A CN113949575A CN202111213257.1A CN202111213257A CN113949575A CN 113949575 A CN113949575 A CN 113949575A CN 202111213257 A CN202111213257 A CN 202111213257A CN 113949575 A CN113949575 A CN 113949575A
- Authority
- CN
- China
- Prior art keywords
- data
- chain
- block
- storage
- information
- 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
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004364 calculation method Methods 0.000 title claims abstract description 31
- 238000013500 data storage Methods 0.000 title claims abstract description 11
- 238000010276 construction Methods 0.000 title claims abstract description 9
- 238000004891 communication Methods 0.000 claims abstract description 14
- 230000006870 function Effects 0.000 claims description 11
- 238000005259 measurement Methods 0.000 claims description 3
- 241001522296 Erithacus rubecula Species 0.000 claims description 2
- 238000009432 framing Methods 0.000 claims 4
- 238000013523 data management Methods 0.000 abstract description 4
- 238000005265 energy consumption Methods 0.000 abstract description 3
- 230000003993 interaction Effects 0.000 abstract description 3
- 238000012795 verification Methods 0.000 abstract description 2
- 239000002699 waste material Substances 0.000 abstract description 2
- 238000006243 chemical reaction Methods 0.000 abstract 1
- 238000001514 detection method Methods 0.000 description 8
- 238000013461 design Methods 0.000 description 5
- 240000007651 Rubus glaucus Species 0.000 description 3
- 235000011034 Rubus glaucus Nutrition 0.000 description 3
- 235000009122 Rubus idaeus Nutrition 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000035945 sensitivity Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000002567 autonomic effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/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
-
- 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/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0872—Generation of secret information including derivation or calculation of cryptographic keys or passwords using geo-location information, e.g. location data, time, relative position or proximity to other entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/08—Randomization, e.g. dummy operations or using noise
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
- H04L2463/121—Timestamp
-
- 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
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Storage Device Security (AREA)
Abstract
The invention provides a block chain frame construction counting data storage method based on edge node calculation, which comprises the steps of firstly reading data of each sensor through a sensing module and storing the data into edge equipment; secondly, the node identity is verified by using an intelligent contract, data is asymmetrically encrypted in edge equipment after the identity verification is passed, and a block chain of related data information is continuously created; and finally, after the intelligent contract on the sub-chain is executed, performing information communication on the whole sub-chain and the existing data storage main chain, so that the whole sub-chain is inserted into the main chain, and the distributed encryption storage of the data is realized. The method and the system enable the data management of the Internet of things to be more convenient and faster, have less direct interaction times with the main chain and lower delay, reduce the energy consumption of the main chain of the block chain in the data conversion and module construction, and reduce the waste of computing resources of the Internet of things layer.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain framework design of distributed node calculation, and aims to provide a storage method of related detection data for museum cultural relic storage protection.
Background
The encryption protection of various sensing data in a complex internet of things is one of key technologies in edge computing. At present, domestic protection of the sensing data is mainly realized through centralized storage of local encryption. As the number of cultural relics increases, this approach will result in over-stressing the local storage, thereby corrupting or losing data. The block chain technology is used for carrying out encryption decentralized protection on the sensing data, so that the data storage efficiency can be greatly improved, the data is prevented from being lost and tampered, and the data management level of museum cultural relic resources is improved. Dorri et al (Dorri A, Kanhere SS, Jurdak R, Gauravar P. "Block chain for IoT security and privacy: the case study of a smart home".2017IEEE International Conference on privacy Computing and Communications works, Kona, HI, USA, March 13-17,2017: 618) propose a method for encrypted storage of sensor data through a block chain, but this method is too computationally intensive for deployment devices and storage to be applied on a large scale. Moinet et al (Bendianb K, Kolokotronis N, Shiaeles S, Boucherkha S. "WiP: a novel block chain-based control model for closed identity management."2018IEEE 16th International Conference on depends, Autonomic and Secure Computing, adhens, Greece, aug.12-15,2018.) propose an identity recognition authentication method based on a block chain technique to ensure traceability of each data operation, but this technique is not suitable for distributed edge Computing networks. Therefore, most of the existing block chain frames have the problems of complex structure, excessive calculation amount and storage requirements, serious time delay and energy consumption, and the like, and are difficult to deploy on equipment with limited resources, and a common distributed storage architecture (Bremer J, Lehnhoff s. "centralized correlation information in Agent-based combined architecture". 14th International Conference practice of Agents and Multi-Agent Systems, Seville, spread, jun.1-3,2016) is difficult to solve the existing distributed node data security storage problem, and a block chain frame conforming to the characteristics of a sensing network needs to be provided aiming at the relevant characteristics of edge node calculation. Many practical scenes of using edge nodes and block chains are proposed in the block chain + edge computing technology white paper 2020, and collection of various data is realized by using convenience of collecting information by the nodes. The industrial data detection block chain network architecture and detection method [ P ],201811283738.8, chinese patent, 2018 ] based on edge computing are adopted by people with permission sensitivity and the like (permission sensitivity, Zhao Chenglin, Yanfan, lie bin) to acquire data by using edge nodes and encrypt the data by using the computing power of edge devices, so that the risk of information leakage is reduced when information is uploaded to a cloud. However, the two methods do not fully utilize the computing power of the edge node, so that frequent data interaction exists between the edge node and the cloud main chain, and the whole system is excessively communicated and has high delay. In addition, the existing block chain model realizes the updating and authentication of information through the timing information broadcast, and the method causes that the direct communication of each storage node is too close, and the load of a communication network is too large.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a block chain framework design based on edge node calculation, which realizes the deployment of a block chain framework model on a common edge calculation platform, and deploys the block chain framework model in distributed edge equipment so as to reduce the direct information communication and communication load of each edge node and the calculation amount of each storage node.
The technical scheme adopted by the invention for solving the technical problem comprises the following steps:
step S1: collecting the measurement data of various sensors on the same cultural relic, and transmitting the data to each edge device through a wireless communication module;
step S2: identity authentication is carried out on each edge node by using an intelligent contract, if the authentication is not passed, the data acquired from the node cannot be stored and is regarded as illegal data, and the storage process is finished; otherwise, go to step S3;
step S3: carrying out encryption operation on related sensor data stored in the edge device;
step S4: building a blockchain on an edge device;
step S5: judging whether the intelligent contract is completely effective, if not, continuing to S1 to read the sensing data for encrypted storage; if the product is completely effective, the next step is carried out;
step S6: the sub-chain is completely inserted into the existing block main chain of the cloud, so that data storage in the main chain is realized;
step S7: after the main chain data is stored, destroying the sub-chains in the edge device and releasing the storage space;
step S8: and the main chain broadcasts information, synchronizes the information of each distributed node, realizes the distributed storage of data, and completes the construction and storage process of the whole block chain.
The various sensors include, but are not limited to, temperature sensors, humidity sensors, and infrared sensors.
The encryption operation of step S3 is as follows:
step S31: the input information length M bit is complemented by 512 with the result M, if M is not equal to 448, 1 and n 0 s are padded after the input information, so that the result of the complemented input information length M bit by 512 is equal to 448, wherein,
the length of the filled information is 512N +448 bits;
step S32: adding 64 bits after the filled input information for recording the length M of the information before filling;
step S33: generating four standard magic numbers;
step S34: four rounds of round robin are performed to generate a 128-bit hash value as the final encrypted value.
The four criteria of step S33 are a ═ (01234567)16，b＝(89ABCDEF)16，c＝(FEDCBA98)16，d＝(76543210)16。
The loop operation of step S34 is as follows:
step S341: grouping the input information processed in step S32, and subdividing every 512 bits into 16 subgroups, each subgroup having 32 bits;
step S342: four linear encryption functions are set as follows:
(1)F(X,Y,Z)＝(X&Y)|((～X)&Z)
(2)G(X,Y,Z)＝(X&Z)|(Y&(～Z))
(3)H(X,Y,Z)＝X^Y^Z
(4)I(X,Y,Z)＝Y^(X|(～Z))
step S343: the four linear encryption functions in step S342 are used for each packet to perform the operation, and the specific encryption operation process is as follows:
FF (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + F (b, c, d) + Mj + ti) < < s)
GG (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + G (b, c, d) + Mj + ti) < < s)
HH (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + H (b, c, d) + Mj + ti) < < s)
II (a, b, c, d, Mj, s, ti) denotes a ═ b + ((a + I (b, c, d) + Mj + ti) < < s)
Wherein, Mj and ti are constants used in the loop calculation process, the constants used in each loop are different, s is a left shift amount, and s used in each loop is different;
the calculation result is transferred to S342 for iteration, four rounds of iteration are carried out in total, and the linear encryption functions are alternately used in four rounds of circulation;
step S344: the result of the iteration of S343 is four 32-bit packets, and a 128-bit hash value is generated after the four packets are concatenated, as the final encrypted value.
The step S4 of constructing the blockchain is as follows:
step S41: storing the block address of the last block node in the block subchain, so that the previous block address points to the new block address, and inserting new block information;
step S42: storing the read-write time stamp;
step S43: generating a random number using the timestamp as a seed;
step S44: the chunk subchain data chunk is constructed on the edge device using the encrypted value and the results of the above steps S41, S42, S43.
The invention has the beneficial effects that:
1) the present invention proposes a hybrid blockchain architecture that allows for decentralized data management by building blockchain at edge devices. Thus, the architecture has a computational distribution in the edge-computing paradigm, making it possible to optimize the connection between the internet of things and the blockchain. The hybrid architecture optimizes the current end-to-end architecture, so that the data management of the Internet of things is more convenient and less in direct interaction times with the main chain, and the delay is lower.
2) According to the method, an edge calculation layer is designed in front of the block chain, and the processes of extracting, converting and sorting the early-stage data are transferred to the edge calculation layer from the cloud block main chain by using edge nodes with certain calculation capacity, so that the energy consumption of the block chain main chain in the process of converting the data and constructing the module is greatly reduced, and the calculation resource waste of the Internet of things layer is reduced.
3) According to the invention, by using the parallel computing of the distributed edge devices, the application program, data and computing capability are pushed away from the block chain, and the communication between the WSN node (namely the sensor) and the main chain of the cloud block is reduced, so that the wireless data communication flow between the edge node and the block chain is reduced, and the flow pressure of the whole wireless communication network is relieved. By fully utilizing the computing power of the edge nodes, the sub-chains are constructed on the nodes, and the calculated amount is dispersed to each edge device from the cloud main chain, so that the pressure of the whole system on cloud centralized computing is eliminated, and the stability and the safety of the system are improved. By adopting the distributed structure, the expandability of the whole system is greatly improved, and excessive calculation burden can not be formed on the cloud.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a schematic view of a sub-chain structure of the block chain framework of the present invention;
FIG. 3 is an overall frame diagram of the block chain frame design based on edge calculation according to the present invention.
Detailed Description
The present invention will be further described with reference to the following drawings and examples, which include, but are not limited to, the following examples.
The invention provides a block chain framework design based on edge node calculation, which is used for safely storing daily detection data of cultural relics acquired by using different sensors. The method comprises the steps of firstly reading data of each sensor through a sensing module and storing the data into edge equipment. And then, the identity of the node is verified by using an intelligent contract, after the identity verification is passed, data is asymmetrically encrypted in the edge equipment, and a block chain of related data information is continuously created. And finally, after the intelligent contract on the sub-chain is executed, performing information communication on the whole sub-chain and the existing data storage main chain, so that the whole sub-chain is inserted into the main chain, and the distributed encryption storage of the data is realized.
As shown in fig. 1, the technical solution of the block chain framework design based on edge calculation of the present invention includes the following steps:
step S1: the method comprises the steps of collecting measurement data of various sensors such as a temperature sensor, a humidity sensor and an infrared sensor on the same cultural relic, and transmitting the data to each edge device through a wireless communication module.
Step S2: identity authentication is carried out on each edge node by using an intelligent contract, if the authentication is not passed, the data acquired from the node cannot be stored and is regarded as illegal data, and the storage process is finished; otherwise, go to step S3.
Step S3: an encryption operation is performed on the associated sensor data stored in the edge device. The specific encryption operation steps are as follows:
step S31: and (6) filling. The length M (bit) of the input information is complemented by 512, the result is m, if m is not equal to 448, 1 and n 0 are filled after the input information, so that the result of the complementation of the length M (bit) of the filled input information by 512 is equal to 448, wherein the value of n is that
Assume that the post-padding information length is 512N +448 (bit).
Step S32: the length of the information is recorded. The input information after padding is added with 64 bits for recording the information length M before padding, and the input information length is 512N +448+ 64-512 (N +1) bits.
Step S33: four standard magic numbers were generated, where the standard magic number (physical order) was taken as a ═ b (01234567)16，b＝(89ABCDEF)16，c＝(FEDCBA98)16，d＝(76543210)16The method is used for mixed use in grouping iterative computation, and four magic numbers can be customized according to actual use in the actual encryption process.
Step S34: four rounds of loop operations are performed, where the number of loops is the number of packets (N + 1). The specific circulating operation steps are as follows:
step S341: the input information processed in step S32 is grouped into 16 subgroups of 32 bits (4 bytes) per group every 512 bits.
Step S342: four linear encryption functions are set as follows:
(1)F(X,Y,Z)＝(X&Y)|((～X)&Z)
(2)G(X,Y,Z)＝(X&Z)|(Y&(～Z))
(3)H(X,Y,Z)＝X^Y^Z
(4)I(X,Y,Z)＝Y^(X|(～Z))
wherein, & represents AND operation, | represents OR operation, - [ means not operation ], and ^ represents XOR operation.
Step S343: the four linear encryption functions in step S342 are used for each packet to perform the operation, and the specific encryption operation process is as follows:
FF (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + F (b, c, d) + Mj + ti) < < s)
GG (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + G (b, c, d) + Mj + ti) < < s)
HH (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + H (b, c, d) + Mj + ti) < < s)
II (a, b, c, d, Mj, s, ti) denotes a ═ b + ((a + I (b, c, d) + Mj + ti) < < s)
Wherein, Mj and ti are constants used in the loop calculation process, the constants used in each loop are different, s is a left shift amount, and s used in each loop is different.
And (4) turning the calculation result to S342 iteration, and performing four rounds of iteration, wherein the linear encryption functions are alternately used in four rounds of cycles.
Step S344: the result of the iteration of S343 is four 32-bit packets, and a 128-bit hash value is generated after the four packets are concatenated, as the final encrypted value.
Step S4: a blockchain is constructed on an edge device, wherein the blockchain structure is shown in fig. 2.
Step S41: and storing the block address of the last block node in the block subchain, so that the previous block address points to the new block address, and inserting new block information.
Step S42: and storing the read-write time stamp.
Step S43: a random value is generated using the timestamp as a seed.
Step S44: the result of steps S344, S41, S42, S43 above is used on the edge device to construct the chunk subchain data chunk.
Step S5: and judging whether the intelligent contract is completely effective, and if not, continuing to S1 to read the sensing data for encrypted storage. And if the effect is completely achieved, the next step is carried out.
Step S6: and completely inserting the sub-chain into the existing block main chain of the cloud, so as to realize data storage in the main chain.
Step S7: and after the main chain data is stored, destroying the sub-chain in the edge device, and releasing the storage space to reduce the subsequent storage calculation pressure.
Step S8: the main chain broadcasts information to synchronize the information of each distributed node and realize the distributed storage of data.
Step S9: and completing the construction and storage process of the whole block chain.
Fig. 3 is an example of the block chain architecture application based on edge calculation in the cultural relic detection provided by the invention. The method comprises the following steps:
step S1: the detection data of various categories in the cultural relic storage process are collected through the sensor, the data collected by each node are transmitted to the edge computing equipment through the wireless communication network, and the edge computing layer is used for carrying out the next computation.
Specifically, the relevant data collected by the invention are temperature information and humidity information of different parts of the cultural relic, but the data which can be collected and applied comprise but are not limited to the two data, and the edge computing device can adopt a raspberry pie, and also comprises but is not limited to the application of the edge computing device.
Step S2: identity authentication is carried out on each edge node through an intelligent contract, and if the authentication is not passed, the data is considered as illegal data; otherwise, the collected related temperature and humidity information is the related cultural relic information needing to be stored.
Step S3: the temperature and humidity data stored in the edge device is encrypted. The specific encryption operation steps are as follows:
step S31: the lengths of the temperature and humidity information are filled separately. Taking temperature information length filling as an example, the temperature information length (bit) is complemented by 512, if the complementation result is not equal to 448, 1 and N0 s are filled into the input information, so that the complementation result of the filled input information length to 512 is equal to 448, and at this time, the temperature information length reaches 512N +448(bit) required by subsequent calculation.
Step S32: the pre-padding information length is stored with 64 bits. The 64-bit data is added after the padded information of step S31, and at this time, the data length is 512(N +1) bits.
Step S33: load with standard magic number, where the standard magic number (physical order) is A1 ═ 0123456716，B1＝(89ABCDEF)16，C1＝(FEDCBA98)16，D1＝(76543210)16。
Step S34: grouping the data processed in the step S32, wherein the grouping number is (N +1) groups, and performing four-round loop iterative operation on the grouped data by using the four magic numbers in the step S33, specifically comprising the following steps:
step S341: the (N +1) groups of data are grouped, i.e. divided into 16 subgroups every 512 bits, with 4 bytes per subgroup, so that there is 16(N +1) groups of data in total. Groups of 16 data were randomly arranged and grouped, with 4 groups of data each, for a total of four groups. The four packets are then separately encrypted.
Step S342: setting 4 linear encryption functions as:
(1)(X&Y)|((～X)&Z)
(2)(X&Z)|(Y&(～Z))
(3)X^Y^Z
(4)Y^(X|(～Z))
wherein, & represents AND operation, | represents OR operation, - [ means not operation ], and ^ represents XOR operation.
Step S343: four rounds of iterative encryption are respectively performed on the four packets obtained in step S341 using four sets of encryption functions.
Step S344: and taking and calculating the result obtained by the encryption in the step S343, and combining the result with the result in the step S343 to obtain a 128-bit hash value as a ciphertext numerical value of the information encryption.
Step S4: a blockchain is constructed on an edge device, and a schematic structure of the blockchain is shown in fig. 2.
Step S41: and storing the memory block address of the last node after the block encryption storage, so that the previous block address points to the new block address, and the insertion of new block information is realized.
Step S42: the specific time stamp at which the block construction operation is performed is stored.
Step S43: a random value is generated using the timestamp as a seed.
Step S44: the encryption tree is constructed using the data obtained by encrypting the read temperature and humidity information in step S3.
Step S5: and judging whether the intelligent contract operation is completely finished or not so as to detect whether the intelligent contract is completely effective or not. If the data is not completely valid, which means that the data is not stored and encrypted, the sensor data is continuously read for encrypted storage, and then the flow goes to step S2 to continue the data reading, encrypting and storing process. If the smart contract is in effect, then step S6 is continued.
Step S6: and transmitting the constructed subchains to a block chain layer shown in FIG. 3 in a raspberry group, and completely inserting the subchains into a main chain to realize data storage in the main chain.
Step S7: after the main chain data is stored, after the raspberry group receives the message and returns, the subchain of the subchain related detection data is destroyed to release the storage space and reduce the subsequent storage calculation pressure.
Step S8: the main chain broadcasts information in the block chain layer to synchronize the node information of the other block chain layers, thereby realizing distributed encryption storage.
Step S9: and finishing the storage and encryption of the related data acquired in the cultural relic detection process.
Claims (6)
1. A block chain frame construction counting data storage method based on edge node calculation is characterized by comprising the following steps:
step S1: collecting the measurement data of various sensors on the same cultural relic, and transmitting the data to each edge device through a wireless communication module;
step S2: identity authentication is carried out on each edge node by using an intelligent contract, if the authentication is not passed, the data acquired from the node cannot be stored and is regarded as illegal data, and the storage process is finished; otherwise, go to step S3;
step S3: carrying out encryption operation on related sensor data stored in the edge device;
step S4: building a blockchain on an edge device;
step S5: judging whether the intelligent contract is completely effective, if not, continuing to S1 to read the sensing data for encrypted storage; if the product is completely effective, the next step is carried out;
step S6: the sub-chain is completely inserted into the existing block main chain of the cloud, so that data storage in the main chain is realized;
step S7: after the main chain data is stored, destroying the sub-chains in the edge device and releasing the storage space;
step S8: and the main chain broadcasts information, synchronizes the information of each distributed node, realizes the distributed storage of data, and completes the construction and storage process of the whole block chain.
2. The method as claimed in claim 1, wherein the various sensors include but are not limited to a temperature sensor, a humidity sensor and an infrared sensor.
3. The method for storing data based on the blockchain framing count of claim 1, wherein the encryption operation of step S3 is as follows:
step S31: the input information length M bit is complemented by 512 with the result M, if M is not equal to 448, 1 and n 0 s are padded after the input information, so that the result of the complemented input information length M bit by 512 is equal to 448, wherein,
the length of the filled information is 512N +448 bits;
step S32: adding 64 bits after the filled input information for recording the length M of the information before filling;
step S33: generating four standard magic numbers;
step S34: four rounds of round robin are performed to generate a 128-bit hash value as the final encrypted value.
4. The method for storing data of block chain framing count based on edge node calculation as claimed in claim 3, wherein said four criteria of step S33 adopt a ═ a (01234567)16，b＝(89ABCDEF)16，c＝(FEDCBA98)16，d＝(76543210)16。
5. The method for storing data of block chain framing count based on edge node calculation in claim 3, wherein the loop operation of step S34 is as follows:
step S341: grouping the input information processed in step S32, and subdividing every 512 bits into 16 subgroups, each subgroup having 32 bits;
step S342: four linear encryption functions are set as follows:
(1)F(X,Y,Z)＝(X&Y)|((～X)&Z)
(2)G(X,Y,Z)＝(X&Z)|(Y&(～Z))
(3)H(X,Y,Z)＝X^Y^Z
(4)I(X,Y,Z)＝Y^(X|(～Z))
step S343: the four linear encryption functions in step S342 are used for each packet to perform the operation, and the specific encryption operation process is as follows:
FF (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + F (b, c, d) + Mj + ti) < < s)
GG (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + G (b, c, d) + Mj + ti) < < s)
HH (a, b, c, d, Mj, s, ti) represents a ═ b + ((a + H (b, c, d) + Mj + ti) < < s)
II (a, b, c, d, Mj, s, ti) denotes a ═ b + ((a + I (b, c, d) + Mj + ti) < < s)
Wherein, Mj and ti are constants used in the loop calculation process, the constants used in each loop are different, s is a left shift amount, and s used in each loop is different;
the calculation result is transferred to S342 for iteration, four rounds of iteration are carried out in total, and the linear encryption functions are alternately used in four rounds of circulation;
step S344: the result of the iteration of S343 is four 32-bit packets, and a 128-bit hash value is generated after the four packets are concatenated, as the final encrypted value.
6. The method for storing data based on the blockchain framing count of the edge node calculation in claim 1, wherein the step S4 includes the following steps:
step S41: storing the block address of the last block node in the block subchain, so that the previous block address points to the new block address, and inserting new block information;
step S42: storing the read-write time stamp;
step S43: generating a random number using the timestamp as a seed;
step S44: the chunk subchain data chunk is constructed on the edge device using the encrypted value and the results of the above steps S41, S42, S43.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111213257.1A CN113949575B (en) | 2021-10-19 | 2021-10-19 | Block chain frame design data storage method based on edge node calculation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111213257.1A CN113949575B (en) | 2021-10-19 | 2021-10-19 | Block chain frame design data storage method based on edge node calculation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113949575A true CN113949575A (en) | 2022-01-18 |
| CN113949575B CN113949575B (en) | 2024-10-18 |
Family
ID=79331689
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111213257.1A Active CN113949575B (en) | 2021-10-19 | 2021-10-19 | Block chain frame design data storage method based on edge node calculation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113949575B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115378658A (en) * | 2022-07-27 | 2022-11-22 | 咚咚数字科技有限公司 | Park communication data transmission method based on Internet of things cloud edge collaboration |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109302405A (en) * | 2018-10-31 | 2019-02-01 | 北京邮电大学 | Industrial data detection block chain network framework and detection method based on edge calculations |
| CN112380578A (en) * | 2020-11-20 | 2021-02-19 | 天翼电子商务有限公司 | Edge computing framework based on block chain and trusted execution environment |
| CN113079159A (en) * | 2021-04-01 | 2021-07-06 | 北京邮电大学 | Edge computing network architecture based on block chain |
-
2021
- 2021-10-19 CN CN202111213257.1A patent/CN113949575B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109302405A (en) * | 2018-10-31 | 2019-02-01 | 北京邮电大学 | Industrial data detection block chain network framework and detection method based on edge calculations |
| CN112380578A (en) * | 2020-11-20 | 2021-02-19 | 天翼电子商务有限公司 | Edge computing framework based on block chain and trusted execution environment |
| CN113079159A (en) * | 2021-04-01 | 2021-07-06 | 北京邮电大学 | Edge computing network architecture based on block chain |
Non-Patent Citations (4)
| Title |
|---|
| MA ZHAOFENG: "A Blockchain-Based Trusted Data Management Scheme in Edge Computing", IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 31 March 2020 (2020-03-31) * |
| 方俊杰;雷凯;: "面向边缘人工智能计算的区块链技术综述", 应用科学学报, no. 01 * |
| 程冠杰;黄诤杰;邓水光;: "基于区块链与边缘计算的物联网数据管理", 物联网学报, no. 02 * |
| 高利;王春艳;高心丹;: "运用区块链技术构建数字化古籍管理体系模型的研究", 图书情报工作, no. 03, 5 February 2019 (2019-02-05) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115378658A (en) * | 2022-07-27 | 2022-11-22 | 咚咚数字科技有限公司 | Park communication data transmission method based on Internet of things cloud edge collaboration |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113949575B (en) | 2024-10-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104219056B (en) | Privacy protection type real-time electric charge collecting method for intelligent power grid | |
| Zhang et al. | A new digital watermarking method for data integrity protection in the perception layer of IoT | |
| CN104780532B (en) | One cluster key management method that can be used for wireless sensor network | |
| Shi et al. | A reversible watermarking authentication scheme for wireless sensor networks | |
| CN109542883A (en) | A kind of information duplicate checking method based on block chain | |
| CN110413652B (en) | Big data privacy retrieval method based on edge calculation | |
| CN115277040B (en) | Medical health data storage and sharing method and system based on blockchain technology | |
| Chudzikiewicz et al. | Secure protocol for wireless communication within internet of military things | |
| CN113949575A (en) | Block chain frame construction counting data storage method based on edge node calculation | |
| CN111200604A (en) | Privacy protection method and system based on data aggregation | |
| CN102892113B (en) | Method for safety transmission of data between nodes in hierarchical wireless sensor network | |
| CN110022312A (en) | One kind being used for the prolongable lightweight method of proof of internet of things equipment | |
| Wang et al. | A copyright protection method for wireless sensor networks based on digital watermarking | |
| Juma et al. | Watermarking sensor data for protecting the integrity | |
| Albath et al. | Practical algorithm for data security (PADS) in wireless sensor networks | |
| CN103686715B (en) | Lightweight secrete discovery and dissemination method for wireless body area network safety data | |
| Zhou et al. | An efficient authentication scheme based on deployment knowledge against mobile sink replication attack in UWSNs | |
| Huang et al. | A secure wireless communication system integrating PRNG and Diffie-Hellman PKDS by using a data connection core | |
| Chiang et al. | A quantum assisted secure client-centric polyvalent blockchain architecture for smart cities | |
| Murtaza et al. | Techniques for Resource-Efficient, Lightweight Cryptography in IoT Devices for Smart Environment | |
| Dener et al. | TeenySec: a new data link layer security protocol for WSNs | |
| Kůr et al. | Two improvements of random key predistribution for wireless sensor networks | |
| Faraj et al. | ZIRCON: Zero-watermarking-based approach for data integrity and secure provenance in IoT networks | |
| Kur et al. | Two Improvements of Random Key Predistribution for Wireless Sensor Networks. | |
| Peng et al. | Enable privacy preservation and result verification for top-k query in two-tiered sensor networks |
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 |