CN113489697A - Centerless key distribution method in Internet of things - Google Patents
Centerless key distribution method in Internet of things Download PDFInfo
- Publication number
- CN113489697A CN113489697A CN202110706916.9A CN202110706916A CN113489697A CN 113489697 A CN113489697 A CN 113489697A CN 202110706916 A CN202110706916 A CN 202110706916A CN 113489697 A CN113489697 A CN 113489697A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- consensus
- public key
- internet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000012937 correction Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 7
- 230000008901 benefit Effects 0.000 abstract description 3
- 238000010187 selection method Methods 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- QSHDDOUJBYECFT-UHFFFAOYSA-N mercury Chemical compound [Hg] QSHDDOUJBYECFT-UHFFFAOYSA-N 0.000 description 1
- 229910052753 mercury Inorganic materials 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction 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/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
- H04L63/062—Network architectures or network communication protocols for network security for supporting key management in a packet data network for key distribution, e.g. centrally by trusted party
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
- G16Y30/00—IoT infrastructure
- G16Y30/10—Security thereof
-
- 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/104—Peer-to-peer [P2P] networks
-
- 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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
-
- 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- Algebra (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention belongs to the field of information security, and particularly relates to a centerless key distribution method in the Internet of things. The invention firstly uses NAF scalar multiplication by improving ECC encryption algorithm, so that the NAF scalar multiplication is light enough and is suitable for nodes with limited resources; secondly, a PBFT consensus algorithm is used for achieving consensus among nodes, and a main node selection method in the PBFT is designed; and finally, the master node stores the public key information of all the nodes into the block chain, and the communication among the nodes can confirm the credibility of the public key through the block chain. The method has the advantages that the resource-limited Internet of things equipment can automatically generate the public and private keys without a third party, high-quality nodes are selected as the main nodes to generate the blocks with higher probability, and the communication between the nodes verifies the Hash value of the public key of the other side through the block chain and the surrounding nodes so as to carry out communication.
Description
Technology neighborhood
The invention belongs to the field of information security, and particularly relates to a centerless key distribution method in the Internet of things.
Background
With the advancement of wireless Internet technology, a new computing ecosystem, the Internet of Things (IoT), has brought convenience in many areas of life and industry. An internet of things system is composed of a variety of different types of heterogeneous devices, called objects or things. The objects are able to detect the environment in which they are located, are interrelated, and are able to communicate with each other. The Internet of things equipment can be connected to the Internet through an Internet Protocol (IP) router so as to be accessed and managed anytime and anywhere. For example, sensors, actuators, and RFID (radio frequency identification) tags can sense the environment by acquiring measured values, store and process collected data, and exchange data through a network. To make the communication between these internet of things devices more secure, the addition of key management is required. Today, the memory, computing and battery capacity resources of many internet of things devices are relatively limited, so that it is necessary to research a lightweight centerless key distribution method. The invention mainly uses an ECC (Elliptic curve cryptography) encryption algorithm and a block chain technology, and the two technologies are explained below.
ECC is a public key cryptosystem, originally introduced into cryptography by both Koblitz and Miller in 1985. The mathematical basis is the computational complexity of forming the discrete logarithm of the ellipse on the Abel addition group by using rational points on the elliptic curve. Just for the advantage in the security field, ECC can be applied to the computer security field as a good public key cryptosystem.
Blockchains are a combination of techniques that integrate knowledge of related disciplines of mathematics, computers, and cryptography. The block chain has the advantage of decentralization, and by applying an encryption algorithm, a timestamp, a Mercury tree and a consensus mechanism, point-to-point transaction is realized in a decentralization node group which does not need to be trusted, so that the problems of poor reliability, high cost, easiness in attack, low efficiency and the like in the current centralization application are solved.
Disclosure of Invention
Aiming at the existing problems, the invention provides a centerless key distribution method in the Internet of things so as to adapt to the Internet of things equipment with limited resources.
In order to achieve the purpose, the specific technical scheme of the invention is as follows: a centerless key distribution method in the Internet of things comprises the following steps:
1) constructing a network and initializing node parameters; the Internet of things is composed of m nodes and is recorded as
i is the node number, m is the node number, niIs the ith node; one node corresponds to one piece of Internet of things equipment and is deployed at different positions; the node parameters include: node consensus score hiAt initialization time is
Percentage e of node remaining capacityiWhen initializing, the number of times of successful participation of the node in consensus is 100 percentiWhen initializing, the number of times of node total consensus is 0, and when initializing, the number of times of node total consensus is 0;
2) generating a public key K and a private key K of each node through a lightweight ECC (error correction code) encryption algorithm;
3) each node broadcasts own public key information to other nodes except the node, wherein the public key information comprises a node ID, a node public key, a timestamp and the effective start-stop time of the public key;
4) selecting a main node through the distance;
5) the master node broadcasts the public key information to the slave nodes for consensus;
6) judging whether the node consensus is successful, if the node consensus is successful, adding a to the historical consensus score, adding 1 to the number of successful consensus participation times, and turning to the step 8), otherwise, subtracting b from the historical consensus score, and turning to the step 7);
7) grading and selecting the main node according to the historical consensus grade, the electric quantity, the consensus times and the distance of the node, and turning to the step 5)
8) The master node generates blocks to form a block chain, the master node stores the public key information of all the nodes into the block chain, and the slave nodes synchronize the block chain to realize key distribution.
Further, the generation of the node public key and the node private key in the step 2) comprises the following steps:
2.1) selecting an elliptic curve equation Ep(a, b) randomly selecting one point on the elliptic curve as a base point P, wherein the order is n;
2.2) randomly selecting an integer k as a private key, wherein k belongs to [1, n-1 ];
2.3) converting the integer k into a binary string, wherein the length of the binary string is recorded as l, and the Hamming weight of the binary string, namely the number of non-0 bits, is recorded as h;
2.4) multiplying the public key K by a binary scalar, wherein the calculation formula is as follows: and K equals kP, i.e. l-1 times of point multiplication and h-1 times of point addition are carried out on P.
Further, the selecting the master node according to the distance in the step 4) includes the following steps:
4.1) calculating the sum of the distances between each node and other m-1 nodes, wherein the distance between two nodes is calculated according to the following formula:
tijrepresenting a node niAnd node njNetwork delay between uijRepresenting a node niAnd node njThe number of routes in (1);
4.2) selecting the node with the minimum sum of the distances as the main node.
Further, the consensus among the nodes in the step 5) includes the following steps:
5.1) the master node sends the public key information of all the slave nodes and the public key information of the master node to all the slave nodes;
5.2) the slave node receives the public key information sent by the master node and verifies whether the Hash value of the public key information is consistent with the Hash value of the public key information stored in the slave node; if consistent, a message is sent to the master node, otherwise nothing is done.
Further, the method for determining whether the node consensus is successful in the step 6) above is: and if the number of the messages received by the main node within the S second is more than or equal to 2f +1, the consensus is successful, otherwise, the node consensus is unsuccessful, wherein f represents the number of the malicious nodes which can be tolerated at most in the node group.
Further, the step 7) of scoring and selecting the master node according to the historical consensus score, the electric quantity, the consensus times and the distance of the node includes the following steps:
7.1) calculating the score of each node according to the following calculation formula:
wherein S isiRepresents the total score of node i; m represents the number of nodes; h isiA consensus score representing node i; e.g. of the typeiRepresenting the percentage of the remaining capacity of the node i; c. CiAnd C respectively represents the times of successful participation of the node in consensus and the total consensus times;
tijrepresenting the network delay, u, of node i and node jijRepresenting the number of routing of the node i and the node j; k is a radical of1，k21k3，k4Respectively representing historical consensus scores, the percentage of the residual electric quantity of the nodes, the times of successfully participating in consensus of the nodes and the weights of the scores of the nodes by the distance between the nodes;
7.2) selecting the node with the highest score as the main node.
Further, the step 8) includes the steps of:
8.1) the main node constructs a block chain and stores the public key information of all the nodes into the block chain;
8.2) the master node broadcasts the block to other slave nodes by using the private key signature of the master node;
8.3) other slave nodes use the public key of the master node to decrypt, and carry out the synchronization of the own block chain, thereby realizing the key distribution.
The invention automatically generates public keys and private keys on nodes with limited resources, and provides a grading and sorting mechanism to select the main nodes, so that the nodes with high quality are selected as the main nodes with higher probability to generate blocks; the communication between the nodes verifies the Hash value of the public key of the other party through the block chain, and can also verify the Hash value of the public key of the other party by inquiring the surrounding nodes.
Drawings
Fig. 1 is a flowchart of a key distribution method without a center in the internet of things according to the present invention.
Detailed Description
The present invention will be further described with reference to the accompanying drawings and specific embodiments, it should be noted that the technical solutions and design principles of the present invention are described in detail below only with one optimized technical solution, but the scope of the present invention is not limited thereto.
The present invention is not limited to the above-described embodiments, and any obvious improvements, substitutions or modifications can be made by those skilled in the art without departing from the spirit of the present invention.
A process of a centerless key distribution method in the internet of things is shown in fig. 1, and includes the following steps:
1) constructing a network and initializing node parameters; the Internet of things is composed of m nodes and is recorded as
i is the node number, m is the node number, niIs the ith node; one node corresponds to one piece of Internet of things equipment and is deployed at different positions; the node parameters include: node consensus score hiAt initialization time is
Percentage e of node remaining capacityiWhen initializing, the number of times of successful participation of the node in consensus is 100 percentiWhen initializing, the number of times of node total consensus is 0, and when initializing, the number of times of node total consensus is 0; in a specific embodiment of the present invention, x is 6.
2) Generating a public key and a private key of each node through a lightweight ECC (error correction code) encryption algorithm, wherein a public key infrastructure is not required to broadcast the public key to the nodes; as a preferred embodiment of the present invention, the generation of the node public key and the private key includes the steps of:
2.1) selecting an elliptic curve equation Ep(a, b) randomly selecting one point on the elliptic curve as a base point P, wherein the order is n;
2.2) randomly selecting an integer k as a private key, wherein k belongs to [1, n-1 ];
2.3) converting the integer k into a binary string, wherein the length of the binary string is recorded as l, and the Hamming weight (namely the number of non-0 bits) of the binary string is recorded as h;
2.4) multiplying the public key K by a binary scalar, wherein the calculation formula is as follows: k equals kP, i.e., P is subjected to point doubling operation l-1 times and point addition operation h-1 times;
2.5) calculating the Hash value of the public key.
3) Each node broadcasts own public key information to other nodes except the node, wherein the public key information comprises a node ID, a node public key, a timestamp and the effective start-stop time of the public key;
4) the selection of the master node by distance, as a preferred embodiment of the present invention, comprises the steps of:
4.1) calculating the sum of the distances between each node and other m-1 nodes, wherein the distance between two nodes is calculated according to the following formula:
tijrepresenting a node niAnd node njNetwork delay between uijRepresenting a node niAnd node njThe number of routes in (1);
4.2) selecting the node with the minimum sum of the distances as the main node.
5) Carrying out consensus among nodes; as a preferred embodiment of the invention, the consensus among the nodes comprises the following steps:
5.1) the master node sends the public key information of all the slave nodes and the public key information of the master node to all the slave nodes;
5.2) the slave node receives the public key information sent by the master node and verifies whether the Hash value of the public key information is consistent with the Hash value of the public key information stored in the slave node; if the two are consistent, sending a message to the main node, otherwise, doing nothing;
6) judging whether the node consensus is successful, wherein the judging method comprises the following steps: if the number of the messages received by the main node in S second is more than or equal to 2f +1, the consensus is successful, the historical consensus score is added with a, the number of times of successful participation in the consensus is added with 1, and the step 8) is switched, otherwise, the node consensus is unsuccessful, the historical consensus score is subtracted with b, and the step 7) is switched; wherein f represents the number of malicious nodes which can be tolerated at most in the node group; in a specific embodiment of the present invention, S is 5, a is 1, b is 3, and f is 3.
7) The method for selecting the main node by scoring through the historical consensus scores, the electric quantity, the consensus times and the distances of the nodes is taken as a preferred embodiment of the invention and comprises the following steps:
7.1) calculating the score of each node according to the following calculation formula:
wherein S isiRepresents the total score of node i; m represents the number of nodes; h isiA consensus score representing node i; e.g. of the typeiRepresenting the percentage of the current remaining capacity of the node i; c. CiAnd C respectively represents the times of successful participation of the node in consensus and the total consensus times;
tijrepresenting the network delay, u, of node i and node jijRepresenting the number of routing of the node i and the node j; k is a radical of1，k2，k3，k4Respectively representing historical consensus scores, the percentage of the residual electric quantity of the nodes, the times of successfully participating in consensus of the nodes and the weights of the scores of the nodes by the distance between the nodes; in a specific embodiment of the invention, k1，k2，k3，k4The values are respectively 0.1,0.2,0.3 and 0.4.
7.2) selecting the node with the highest score as the main node. Turning step 5)
8) Generating a block by a master node to form a block chain, storing public key information of all nodes into the block chain by the master node, and synchronizing the block chain by the slave nodes; as a preferred embodiment of the present invention, the method comprises the following steps:
8.1) the master node stores the public key information of all the nodes into the block chain;
8.2) the master node broadcasts the block to other slave nodes by using the private key signature of the master node;
8.3) other slave nodes use the public key of the master node to decrypt, and carry out the synchronization of the own block chain, thereby realizing the key distribution.
So far, the specific implementation steps of a centerless key distribution method in the internet of things are all completed, and the following explains the steps of communication between nodes after key distribution:
when the nodes communicate with each other, both sides need to obtain the public key of the other side, and one side is selected to obtain the public key of the other side for explanation; verifying the Hash value of the public key of the opposite node from the block chain, and comprising the following steps:
1) when node niAnd node njWhile communicating, node niWill own public key
Is sent to node nj；
2) Node njReceiving a public key
Post-computation public key
A Hash value of;
3) then the node n is stored in the block chain Merck treeiOf (2) a public key
The Hash values are compared, if the Hash values are consistent, the public key is proved to be the node n indeediThus, can be usedA message; otherwise, if the two public keys are inconsistent, the public key of the other party needs to be acquired again, and communication can not be carried out until the two public keys are consistent.
Claims (7)
1. A centerless key distribution method in the Internet of things is characterized by comprising the following steps:
1) constructing a network and initializing node parameters; the Internet of things is composed of m nodes and is recorded as
i is the node number, m is the node number, niIs the ith node; one node corresponds to one piece of Internet of things equipment and is deployed at different positions; the node parameters include: node consensus score hiAt initialization time is
Percentage e of node remaining capacityiWhen initializing, the number of times of successful participation of the node in consensus is 100 percentiWhen initializing, the number of times of node total consensus is 0, and when initializing, the number of times of node total consensus is 0;
2) generating a public key K and a private key K of each node through a lightweight ECC (error correction code) encryption algorithm;
3) each node broadcasts own public key information to other nodes except the node, wherein the public key information comprises a node ID, a node public key, a timestamp and the effective start-stop time of the public key;
4) selecting a main node through the distance;
5) the master node broadcasts the public key information to the slave nodes for consensus;
6) judging whether the node consensus is successful, if the node consensus is successful, adding a to the historical consensus score, adding 1 to the number of successful consensus participation times, and turning to the step 8), otherwise, subtracting b from the historical consensus score, and turning to the step 7);
7) grading and selecting the main node according to the historical consensus grade, the electric quantity, the consensus times and the distance of the node, and turning to the step 5)
8) The master node generates blocks to form a block chain, the master node stores the public key information of all the nodes into the block chain, and the slave nodes synchronize the block chain to realize key distribution.
2. The centerless key distribution method in the internet of things as claimed in claim 1, wherein the generation of the node public key and private key in step 2) comprises the following steps:
2.1) selecting an elliptic curve equation Ep(a, b) randomly selecting one point on the elliptic curve as a base point P, wherein the order is n;
2.2) randomly selecting an integer k as a private key, wherein k belongs to [1, n-1 ];
2.3) converting the integer k into a binary string, wherein the length of the binary string is recorded as l, and the Hamming weight of the binary string, namely the number of non-0 bits, is recorded as h;
2.4) multiplying the public key K by a binary scalar, wherein the calculation formula is as follows: and K equals kP, i.e. l-1 times of point multiplication and h-1 times of point addition are carried out on P.
3. The key distribution method without center in the internet of things as claimed in claim 1, wherein the step 4) of selecting the master node by distance comprises the following steps:
4.1) calculating the sum of the distances between each node and other m-1 nodes, wherein the distance between two nodes is calculated according to the following formula:
tijrepresenting a node niAnd node njNetwork delay between uijRepresenting a node niAnd node njThe number of routes in (1);
4.2) selecting the node with the minimum sum of the distances as the main node.
4. The centerless key distribution method in the internet of things as claimed in claim 1, wherein the step 5) of performing consensus among the nodes comprises the steps of:
5.1) the master node sends the public key information of all the slave nodes and the public key information of the master node to all the slave nodes;
5.2) the slave node receives the public key information sent by the master node and verifies whether the Hash value of the public key information is consistent with the Hash value of the public key information stored in the slave node; if consistent, a message is sent to the master node, otherwise nothing is done.
5. The centerless key distribution method in the internet of things as claimed in claim 1, wherein the method for determining whether the node consensus is successful in step 6) is: and if the number of the messages received by the main node within the S second is more than or equal to 2f +1, the consensus is successful, otherwise, the node consensus is unsuccessful, wherein f represents the number of the malicious nodes which can be tolerated at most in the node group.
6. The centerless key distribution method in the internet of things as claimed in claim 1, wherein the step 7) of scoring and selecting the master node according to the historical consensus score, the electric quantity, the consensus times and the distance of the nodes comprises the following steps:
7.1) calculating the score of each node according to the following calculation formula:
wherein S isiRepresents the total score of node i; m represents the number of nodes; h isiA consensus score representing node i; e.g. of the typeiRepresenting the percentage of the remaining capacity of the node i; c. CiAnd C respectively represents the times of successful participation of the node in consensus and the total consensus times;
tijrepresenting the network delay, u, of node i and node jijRepresenting the number of routing of the node i and the node j; k is a radical of1，k2，k3，k4Respectively representing historical consensus scores and the residual electric quantity of nodesThe scoring weight of the nodes is calculated according to the score, the number of times of successful participation of the nodes in consensus and the distance between the nodes;
7.2) selecting the node with the highest score as the main node.
7. The key distribution method without center in the internet of things as claimed in claim 1, wherein the step 8) comprises the steps of:
8.1) the main node constructs a block chain and stores the public key information of all the nodes into the block chain;
8.2) the master node broadcasts the block to other slave nodes by using the private key signature of the master node;
8.3) other slave nodes use the public key of the master node to decrypt, and carry out the synchronization of the own block chain, thereby realizing the key distribution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110706916.9A CN113489697A (en) | 2021-06-24 | 2021-06-24 | Centerless key distribution method in Internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110706916.9A CN113489697A (en) | 2021-06-24 | 2021-06-24 | Centerless key distribution method in Internet of things |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113489697A true CN113489697A (en) | 2021-10-08 |
Family
ID=77937181
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110706916.9A Pending CN113489697A (en) | 2021-06-24 | 2021-06-24 | Centerless key distribution method in Internet of things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113489697A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114339653A (en) * | 2022-03-04 | 2022-04-12 | 杭州格物智安科技有限公司 | Block chain system based on wireless sensor network and data recording method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340543A (en) * | 2011-10-18 | 2012-02-01 | 华为技术有限公司 | Method and equipment for selecting master node of system |
| CN108259505A (en) * | 2018-01-31 | 2018-07-06 | 大连大学 | A kind of ECC lightweight encryption methods for terminal mini-plant |
| US20190208422A1 (en) * | 2018-01-03 | 2019-07-04 | Helium Systems , Inc. | Systems and methods for providing and using a decentralized wireless network |
| US20190379538A1 (en) * | 2018-06-12 | 2019-12-12 | Electronics And Telecommunications Research Institute | Method and apparatus for selecting distributed consensus node based on proof of nonce |
| CN111414420A (en) * | 2020-03-17 | 2020-07-14 | 重庆邮电大学 | Improved PBFT block chain consensus method |
| CN111639361A (en) * | 2020-05-15 | 2020-09-08 | 中国科学院信息工程研究所 | Block chain key management method, multi-person common signature method and electronic device |
| CN112532676A (en) * | 2020-07-24 | 2021-03-19 | 北京航空航天大学 | Vehicle calculation task unloading method based on block chain data sharing |
-
2021
- 2021-06-24 CN CN202110706916.9A patent/CN113489697A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340543A (en) * | 2011-10-18 | 2012-02-01 | 华为技术有限公司 | Method and equipment for selecting master node of system |
| US20190208422A1 (en) * | 2018-01-03 | 2019-07-04 | Helium Systems , Inc. | Systems and methods for providing and using a decentralized wireless network |
| CN108259505A (en) * | 2018-01-31 | 2018-07-06 | 大连大学 | A kind of ECC lightweight encryption methods for terminal mini-plant |
| US20190379538A1 (en) * | 2018-06-12 | 2019-12-12 | Electronics And Telecommunications Research Institute | Method and apparatus for selecting distributed consensus node based on proof of nonce |
| CN111414420A (en) * | 2020-03-17 | 2020-07-14 | 重庆邮电大学 | Improved PBFT block chain consensus method |
| CN111639361A (en) * | 2020-05-15 | 2020-09-08 | 中国科学院信息工程研究所 | Block chain key management method, multi-person common signature method and electronic device |
| CN112532676A (en) * | 2020-07-24 | 2021-03-19 | 北京航空航天大学 | Vehicle calculation task unloading method based on block chain data sharing |
Non-Patent Citations (1)
| Title |
|---|
| 吴奥宇: "面向物联网的区块链共识算法研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114339653A (en) * | 2022-03-04 | 2022-04-12 | 杭州格物智安科技有限公司 | Block chain system based on wireless sensor network and data recording method |
| CN114339653B (en) * | 2022-03-04 | 2022-05-24 | 杭州格物智安科技有限公司 | Block chain system based on wireless sensor network and data recording method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11558188B2 (en) | Methods for secure data storage | |
| CN110832825B (en) | Method and node for network for increasing verification speed by tamper-proof data | |
| KR101796690B1 (en) | Firmware integrity verification system based on block chain and the method thereof | |
| US10862959B2 (en) | Consensus system and method for adding data to a blockchain | |
| US8645698B2 (en) | Method and node for generating distributed Rivest Shamir Adleman signature in ad-hoc network | |
| Grover et al. | A survey of broadcast authentication schemes for wireless networks | |
| CN111639361A (en) | Block chain key management method, multi-person common signature method and electronic device | |
| CN101960814B (en) | IP address delegation | |
| CN109802967B (en) | Block chain information tracking method and system | |
| CN111934889B (en) | Key generation method, signature and signature verification method, device, equipment and medium | |
| US20050053045A1 (en) | Method and system for distributed certificate management in ad-hoc networks | |
| US20040107346A1 (en) | Efficient authenticated dictionaries with skip lists and commutative hashing | |
| CN105376098A (en) | Route origin and path two-factor authentication method | |
| Park | One-time password based on hash chain without shared secret and re-registration | |
| CN115378604A (en) | Identity authentication method of edge computing terminal equipment based on credit value mechanism | |
| Hamouid et al. | Efficient certificateless web-of-trust model for public-key authentication in MANET | |
| CN113489697A (en) | Centerless key distribution method in Internet of things | |
| CN112988903B (en) | Data processing method, device and equipment based on block chain network and storage medium | |
| CN114745689A (en) | Multi-time-segment data fusion method and system for wireless sensor network | |
| Yang et al. | HHT-based security enhancement approach with low overhead for coding-based reprogramming protocols in wireless sensor networks | |
| Danzi et al. | Repeat-authenticate scheme for multicasting of blockchain information in IoT systems | |
| JPWO2010032391A1 (en) | COMMUNICATION SYSTEM, COMMUNICATION DEVICE, COMMUNICATION METHOD AND PROGRAM USING THEM | |
| CN111030823A (en) | Ultra-lightweight multi-signature data processing method and system and Internet of things platform | |
| Pura et al. | A self-organized key management scheme for ad hoc networks based on identity-based cryptography | |
| CN117240900B (en) | Block chain node discovery and networking method and device based on software defined network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20211008 |
|
| RJ01 | Rejection of invention patent application after publication |