CN113038427B - Block chain cross-region authentication method based on credit mechanism and DPOS - Google Patents
Block chain cross-region authentication method based on credit mechanism and DPOS Download PDFInfo
- Publication number
- CN113038427B CN113038427B CN202110227576.1A CN202110227576A CN113038427B CN 113038427 B CN113038427 B CN 113038427B CN 202110227576 A CN202110227576 A CN 202110227576A CN 113038427 B CN113038427 B CN 113038427B
- Authority
- CN
- China
- Prior art keywords
- node
- vehicle
- nodes
- base station
- chain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 230000007246 mechanism Effects 0.000 title claims abstract description 20
- 238000004519 manufacturing process Methods 0.000 claims abstract description 23
- 238000012545 processing Methods 0.000 claims abstract description 4
- 230000006399 behavior Effects 0.000 claims description 10
- 230000003993 interaction Effects 0.000 claims description 4
- 230000008569 process Effects 0.000 claims description 4
- 230000008901 benefit Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/06—Authentication
-
- 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/84—Vehicles
-
- 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
Abstract
The invention relates to a block chain cross-region authentication method based on a reputation mechanism and DPOS (distributed data processing system), belonging to the field of block chains. The method comprises the following steps: s1: initializing each region chain; s2: the vehicle nodes needing to be accessed to the network send authentication requests, and the authentication is used as voting nodes to be added into a chain of the area where the vehicle nodes are located after passing the authentication; s3: the vehicle votes for the base station nodes according to the credit scores of the vehicle, and the base station nodes N before the number of votes are responsible for block production in one period; s4: carrying out DPOS consensus on the main chain; s5: the main chain is communicated with the regional chain to acquire vehicle information and credit scores, and the safety certification of the vehicle to a new region is realized; on the premise of ensuring safety authentication between vehicles, the invention adopts a mechanism of regional authentication and credit rating scoring, improves the efficiency of authentication between vehicles, considers the competition between nodes, enables the nodes with good performance to obtain higher income, and is particularly suitable for the intelligent terminal equipment of the Internet of vehicles with limited computing capacity.
Description
Technical Field
The invention belongs to the field of block chains, and relates to a block chain cross-region authentication method based on a reputation mechanism and DPOS.
Background
The internet of vehicles uses a new generation of information and communication technology to enable cooperative communication between vehicles and vehicles, vehicles and surroundings, vehicles and people. The method can be used for judging the relative position between the vehicles and the position of the vehicles in the surrounding environment, and improves the driving experience and safety guarantee of passengers. However, once the vehicle has accessed itself as a node into the network, it exposes itself to the open environment, which is more susceptible to network communications being tampered with by attackers, listening to or receiving false messages, receiving false indications. The development of the industry is always subjected to the problems of privacy protection, data security, multi-party interest balance and the like, and the occurrence of the block chain technology can be right when the block chain technology happens, so that a new opportunity is brought to the further development of the Internet of vehicles industry to a certain extent.
There are difficulties and limitations in the integration of car networking and blockchain technologies.
The first is the dynamic problem of the car networking, in which each car is accessed into the network as a node that moves frequently. In a local network environment, the number of nodes per second and the frequency of state changes may be as high as hundreds of times, while in a physical environment, the network structures of different areas are different, and each area has its own network architecture. Therefore, the blockchain network is required to be compatible with network structures in different regional environments, has strong flexibility and expansibility, and the state change of the node can be timely fed back to the network.
Secondly, the problem of the computing power of the vehicle-mounted equipment is that the performance of a vehicle-mounted CPU of the vehicle is generally low, and cannot support a Pow consensus mechanism adopted by a block chain system such as a bit coin, and a new consensus scheme needs to be designed, so that the consensus efficiency and the dynamic change rate of the vehicle can be matched, the security is sufficient, and the attack initiated by a malicious node can be effectively resisted.
Therefore, the invention provides a block chain cross-region authentication scheme based on a credit mechanism and DPOS (distributed data processing system), which can effectively ensure the normal operation of a block chain network under the condition that vehicles dynamically change in different regions.
Disclosure of Invention
In view of the above, the present invention provides a method for cross-region block chain authentication based on a reputation mechanism and DPOS. The safety certification problem of vehicles in a plurality of network areas in the internet of vehicles can be solved, and meanwhile, a credit mechanism is adopted to score the performance of the nodes, so that the participation of the nodes and the benefit of excellent nodes are improved.
In order to achieve the purpose, the invention provides the following technical scheme:
a block chain cross-region authentication method based on a reputation mechanism and DPOS is disclosed, and the method comprises the following steps:
introducing cross combination of a main chain and a regional chain, wherein the main chain is responsible for recording credit records of vehicles in the whole network, and the regional chain in each region is responsible for interaction behaviors of the vehicles in the corresponding region; introducing a node credit mechanism to score the credit degree of the behavior records of the base station node and the vehicle node in the operation process, and specifically comprising the following steps:
s1: initializing credit records of all nodes of the whole network, wherein all base station nodes of the whole network jointly form a main chain, and base station nodes of the same area form an area chain;
s2: the vehicle node needing to be accessed to the network sends an authentication request, the vehicle node is used as a voting node to be added into a chain of the area where the vehicle node is located after the vehicle node passes the authentication, and a DPOS (distributed data processing) consensus mechanism is adopted to generate a block;
s3: the base station node is used as a representative node, vehicles in the region are used as voting nodes, and the vehicles vote for the base station node according to the credit scores of the vehicles;
s4: and the main chain carries out DPOS consensus, generates a representative node of the main chain according to the statistical result of the number of votes, and is responsible for producing a block on the main chain, recording the movement information of the vehicle and realizing the safety certification of the vehicle to a new area.
Optionally, in S1, the method specifically includes:
s11: initializing node IDs of a whole network base station, wherein the node ID of each node is 'region code number-node sequence number';
s12: and nodes with the same area code number form respective area chains by adopting a DPOS mechanism, wherein each base station node is used as an alternative node to participate in competition production blocks, all the base station nodes form a main chain together, and high-credit nodes are selected according to voting results of the area chains to produce main chain blocks.
Optionally, in S2, the method specifically includes:
s21: in the authentication stage, the vehicle node sends an authentication request which contains a unique equipment identification code SUCI of the vehicle to the base station node; the base station node forwards the authentication center to authenticate the authentication center server;
s22: and the authentication server returns the temporary identifier GUTI generated by the SUCI after authentication is successful, and returns a successful authentication message to the base station node, the base station generates a wallet address and a public and private key for the vehicle node after receiving the successful authentication message and returns the wallet address and the public and private key to the vehicle, and the vehicle is used as a node and added into a chain of the region.
Optionally, in S3, the method specifically includes:
s31: reputation score P of vehicle nodeiThe method represents the number of votes which can be thrown by a vehicle i in a DPOS consensus process, and the number of votes comprises two parts: number of transactions of vehicle i in each area and number of participating voting rounds, P, in each areaiThe value of (c) is calculated by equation (1):
the credit value is determined by the region credit score, the vehicle transaction quantity, the vehicle voting turn and the vehicle behavior;
Tirindicating the number of transactions, V, of the vehicleirNumber of rounds, W, representing vehicle votesTWeight, W, representing the amount of the transactionTWeight representing number of voting rounds, BiThe behavior expression score of the vehicle is represented, the initial value is 1, and B is obtained after each voting round is finishediAs a function of vehicle behavior; wrAs calculated by the formula (2),
wherein, BadrRepresenting the number of block errors in region r, BadRRepresenting the number of block errors in all regions, GoodrNumber of successful block productions, G, for the representative region rOODRRepresenting the number of successful block production times of all areas;
s32: in each block production stage of each region, each vehicle node can vote on the base station node according to the credit score of the vehicle node, and after the voting is finished, the vote number of each base station node is calculated according to a formula (3):
wherein P isiNumber of votes representing vehicle node i, EjAnd (3) a reputation score representing the base station node j is calculated by the formula (4):
k, a and b are parameters for controlling the increase of the credit score and can be adjusted according to system requirements, q represents the number of failed production blocks, and p represents the number of successful production blocks;
s33: the system calculates the total number of the votes, selects the node N before the votes are obtained as the proxy node to take charge of the block production, and after the nodes in the batch are produced, the next operation cycle is performed, and the step S3 is continued.
Optionally, in S4, the method specifically includes:
s41: in the main chain block production stage, selecting a node with the highest reputation score in each area chain to participate in main chain DPOS consensus voting;
s42: the nodes participating in the consensus vote mutually according to the credit degree scores of the nodes, and after the voting is finished, the sum of the votes obtained by each base station is calculated;
s43: taking the node N' before obtaining the ticket number as a proxy node to be responsible for main chain block production, calculating the hash value of the latest block of each regional chain by the proxy node, generating a hash Merkel tree, and recording the hash Merkel tree in the main chain block;
s43: when the nodes in the area chain need to check the block, finding the corresponding leaf nodes in the Merkle tree according to the ID of the block, and comparing the hash values of the leaf nodes with the hash values of the block to finish the check.
Optionally, in S5, the method specifically includes:
s51: when the vehicle moves across areas, an authentication request is sent to a newly entered area, the request comprises the ID of the last area chain where the vehicle is located, the vehicle identification code GUTI and the hash value of the newly generated block, and the hash value is signed by a private key of the newly generated block;
s52: after receiving the authentication request, the regional chain firstly verifies the vehicle signature, then verifies the vehicle identity from the GUTI table maintained by the main chain, and then compares the Merkle tree hash value in the main chain block with the hash value in the request, if the Merkle tree hash value is consistent with the request, the authentication is passed.
The invention has the beneficial effects that:
1) the invention has the advantages of low calculation overhead and small occupied memory space, can effectively save energy and is suitable for vehicle-mounted calculation equipment with low power consumption and low calculation power.
2) The invention introduces a node credit value mechanism, improves the activity of vehicle nodes in a regional chain and promotes vehicle interaction in the Internet of vehicles; for the base station node, the performance of the node is effectively supervised, and the difficulty that the node which fails to produce the block is responsible for production again is improved.
3) The invention adopts the structure form that the main chain and the regional chain are crossed, and the different regional chains respectively supervise the responsible regions, thereby reducing the cost of nodes of the whole network and the redundancy of the whole network;
additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a diagram of a system model architecture;
FIG. 2 is a detailed flow chart of representative node selection and dynamic production of blocks according to the present invention;
FIG. 3 is a schematic diagram of the structure of the backbone Merkle tree generation;
FIG. 4 is a diagram illustrating comparison of leaf node hashes when checking a block;
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Wherein the showings are for the purpose of illustrating the invention only and not for the purpose of limiting the same, and in which there is shown by way of illustration only and not in the drawings in which there is no intention to limit the invention thereto; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by terms such as "upper", "lower", "left", "right", "front", "rear", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of description, but it is not an indication or suggestion that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes, and are not to be construed as limiting the present invention, and the specific meaning of the terms may be understood by those skilled in the art according to specific situations.
As shown in fig. 1, a block chain cross-region authentication scheme based on a reputation mechanism and DPOS is proposed herein, which has the basic idea that a whole network is firstly divided into region chains according to regions, vehicle autonomy is performed inside each region, and information interaction between vehicles is handled by the region chains; all base station nodes in the whole network form a main chain, and the main chain is responsible for realizing safety certification and ensuring the non-tamper property of each area chain when vehicles move among different areas;
the detailed work flow is shown in fig. 2, and the specific steps are implemented as follows:
step 1: according to the regional distribution condition, the nodes in the same region form respective regional chains by adopting a DPOS mechanism, wherein each base station node is used as an alternative node to participate in competition production blocks, all the base station nodes form a main chain together, and the initial credit value and each regional credit value of each node are calculated;
step 2: and in the authentication stage, the vehicle node sends an authentication request which contains the unique equipment identification code SUCI of the vehicle to the base station node. The base station node forwards the authentication center to authenticate the authentication center server; the authentication server returns the temporary identifier GUTI generated by the SUCI after authentication is successful, a successful authentication message is returned to the base station node, the base station generates a wallet address and a public and private key for the vehicle node after receiving the successful authentication message and returns the wallet address and the public and private key to the vehicle, and the vehicle is used as a node and added into a chain of the region;
and step 3: before each regional chain produces the block, the representative node is elected, and the election rule is as follows: firstly, calculating the credit score P of each vehicle node in the area, and the credit value W of the arearMeanwhile, the whole-area vehicle nodes vote for the supported base station nodes, after the voting is finished, the credit weighting votes of each node are sorted in a descending order, and the node N before the ranking in the sequence is selected as a representative node production block;
the algorithm for this step is described as follows:
and 4, step 4: when a new block is generated in the regional chain every time, the regional chain representative node sends the block content to the main chain representative node, the main chain representative node calculates the hash value of the latest block of each regional chain, and a merkle tree structure is adopted to record the merkle tree in the main chain block; as shown in FIG. 3, at T1 cycle, the region chains A, B and C are respectively generated as A1, B1 and C1, and the block generated by the main chain in T1 contains Merkle tree T1 with (hash) contentA1,hashB1,hashC1) (ii) a At the time of T2 cycle, the region chains A, B and C respectively generate blocks A2, B2 and C2, and the block generated by the main chain in T2 contains Merkle tree T2 with content of (hash)A2,hashB2,hashC2) (ii) a In the period of T3, the blocks generated by the regional chains A and B are A3 and B3, the block generated by the regional chain C is not generated, the main chain Merkle tree takes the latest block of each regional chain, the latest block of the regional chain C is C2, and therefore the content of the Merkle tree T3 contained in the block generated by the main chain in T3 is (hash)A3,hashB3,hashC2) (ii) a At the period of T4, the blocks generated by the regional chains A and C are A4 and C3, the blocks generated by the regional chains B are not generated, the main chain Merkle tree takes the latest block of each regional chain, the latest block of the regional chain B is B3, and therefore the content of the Merkle tree T4 contained in the block generated by the main chain in T3 is (hash)A4,hashB3,hashC3)；
And 5: the vehicle sends an authentication request to a newly entering area, the request comprises the ID of the last area chain where the vehicle is located, the vehicle identification code GUTI and the hash value of the newly generated block, the hash value is signed by a private key of the vehicle, and the content of the message is
Request＝sig(areaID,GUTI,BlockHash)
After receiving the authentication request, the regional chain firstly verifies the vehicle signature, then verifies the vehicle identity from a GUTI table maintained by the main chain, and then compares the Merkle tree hash value in the main chain block with the hash value in the request, if the Merkle tree hash value is consistent with the request, the authentication is passed; as shown in fig. 4, the received area id is area6, and the hash value is compared with the hash value of the corresponding node12 leaf node, and if the hash values are the same, the authentication is completed.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.
Claims (1)
1. A block chain cross-region authentication method based on a reputation mechanism and DPOS is characterized in that: the method comprises the following steps:
introducing cross combination of a main chain and a regional chain, wherein the main chain is responsible for recording credit records of vehicles in the whole network, and the regional chain in each region is responsible for interaction behaviors of the vehicles in the corresponding region; introducing a node credit mechanism to score the credit degree of the behavior records of the base station node and the vehicle node in the operation process, and specifically comprising the following steps:
s1: initializing credit records of all nodes of the whole network, wherein all base station nodes of the whole network jointly form a main chain, and base station nodes of the same area form an area chain;
s2: the vehicle node needing to be accessed to the network sends an authentication request, the vehicle node is used as a voting node to be added into a chain of the area where the vehicle node is located after the vehicle node passes the authentication, and a DPOS (distributed data processing) consensus mechanism is adopted to generate a block;
s3: the base station node is used as a representative node, vehicles in the region are used as voting nodes, and the vehicles vote for the base station node according to the credit scores of the vehicles;
s4: the main chain carries out DPOS consensus, generates a representative node of the main chain according to the statistical result of the number of votes, is responsible for producing a block on the main chain, recording the movement information of the vehicle and is responsible for realizing the safety certification of the vehicle to a new area;
in S1, the method specifically includes:
s11: initializing node IDs of a whole network base station, wherein the node ID of each node is 'region code number-node sequence number';
s12: nodes with the same area code number form respective area chains by adopting a DPOS mechanism, wherein each base station node is used as an alternative node to participate in competition production blocks, all the base station nodes form a main chain together, and high-credit nodes are selected according to voting results of the area chains to produce main chain blocks;
in S2, the method specifically includes:
s21: in the authentication stage, the vehicle node sends an authentication request which contains a unique equipment identification code SUCI of the vehicle to the base station node; the base station node forwards the authentication center to authenticate the authentication center server;
s22: the authentication server returns the temporary identifier GUTI generated by the SUCI after authentication is successful, a successful authentication message is returned to the base station node, the base station generates a wallet address and a public and private key for the vehicle node after receiving the successful authentication message and returns the wallet address and the public and private key to the vehicle, and the vehicle is used as a node and added into a chain of the region;
in S3, the method specifically includes:
s31: reputation score P of vehicle nodeiThe method represents the number of votes which can be thrown by a vehicle i in a DPOS consensus process, and the number of votes comprises two parts: number of transactions of vehicle i in each area and number of participating voting rounds, P, in each areaiThe value of (c) is calculated by equation (1):
the credit value is determined by the region credit score, the vehicle transaction quantity, the vehicle voting turn and the vehicle behavior;
Tirindicating the number of transactions, V, of the vehicleirNumber of rounds, W, representing vehicle votesTWeight, W, representing the amount of the transactionTWeight representing number of voting rounds, BiThe behavior expression score of the vehicle is represented, the initial value is 1, and B is obtained after each voting round is finishediAs a function of vehicle behavior; wrAs calculated by the formula (2),
wherein, BadrRepresenting the number of block errors in region r, BadRRepresenting the number of block errors in all regions, GoodrNumber of successful block production, GOOD, in the representative region rRRepresenting the number of successful block production times of all areas;
s32: in each block production stage of each region, each vehicle node can vote on the base station node according to the credit score of the vehicle node, and after the voting is finished, the vote number of each base station node is calculated according to a formula (2):
wherein P isiNumber of votes representing vehicle node i, EjAnd (3) calculating a reputation score representing the base station node j according to the formula (3):
k, a and b are parameters for controlling the increase of the credit score and can be adjusted according to system requirements, q represents the number of failed production blocks, and p represents the number of successful production blocks;
s33: the system calculates the total number of the votes, selects the node N before the votes are obtained as the proxy node to take charge of block production, and after the nodes are produced, the next operation cycle is carried out, and the step S3 is continued;
in S4, the method specifically includes:
s41: in the main chain block production stage, selecting a base station node with the highest reputation score in each area chain to participate in main chain DPOS consensus voting;
s42: the nodes participating in the consensus vote mutually according to the credit degree scores of the nodes, and after the voting is finished, the sum of the votes obtained by each base station is calculated;
s43: taking the node N' before obtaining the ticket number as a proxy node to be responsible for main chain block production, calculating the hash value of the latest block of each regional chain by the proxy node, generating a hash Merkel tree, and recording the hash Merkel tree in the main chain block;
s43: when the nodes in the area chain need to check the block, finding the corresponding leaf nodes in the Merkle tree according to the ID of the block, and comparing the hash values of the leaf nodes with the hash values of the block to finish the check.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110227576.1A CN113038427B (en) | 2021-03-01 | 2021-03-01 | Block chain cross-region authentication method based on credit mechanism and DPOS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110227576.1A CN113038427B (en) | 2021-03-01 | 2021-03-01 | Block chain cross-region authentication method based on credit mechanism and DPOS |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113038427A CN113038427A (en) | 2021-06-25 |
| CN113038427B true CN113038427B (en) | 2022-04-01 |
Family
ID=76466346
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110227576.1A Active CN113038427B (en) | 2021-03-01 | 2021-03-01 | Block chain cross-region authentication method based on credit mechanism and DPOS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113038427B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113965398B (en) * | 2021-10-29 | 2022-12-27 | 电子科技大学 | Vehicle identity authentication method based on twin block chain in Internet of vehicles scene |
| CN114095246B (en) * | 2021-11-18 | 2024-01-23 | 国网河北省电力有限公司电力科学研究院 | Network access identity authentication method of power distribution terminal |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110300107A (en) * | 2019-06-25 | 2019-10-01 | 南京邮电大学 | A kind of car networking secret protection trust model based on block chain |
| CN111241114A (en) * | 2020-01-07 | 2020-06-05 | 中国科学院信息工程研究所 | Intelligent service transaction block chain credit management method and system combining transaction and consensus |
| CN111601258A (en) * | 2020-05-15 | 2020-08-28 | 浙江树人学院（浙江树人大学） | Vehicle networking node data safety communication method based on block chain |
| CN111756546A (en) * | 2020-06-15 | 2020-10-09 | 杭州电子科技大学 | Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment |
| CN111818056A (en) * | 2020-07-09 | 2020-10-23 | 重庆邮电大学 | Industrial Internet identity authentication method based on block chain |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102228881B1 (en) * | 2019-08-19 | 2021-03-18 | 엘지전자 주식회사 | Method and apparatus for receiving of driving data in platooning in autonomous driving system |
-
2021
- 2021-03-01 CN CN202110227576.1A patent/CN113038427B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110300107A (en) * | 2019-06-25 | 2019-10-01 | 南京邮电大学 | A kind of car networking secret protection trust model based on block chain |
| CN111241114A (en) * | 2020-01-07 | 2020-06-05 | 中国科学院信息工程研究所 | Intelligent service transaction block chain credit management method and system combining transaction and consensus |
| CN111601258A (en) * | 2020-05-15 | 2020-08-28 | 浙江树人学院（浙江树人大学） | Vehicle networking node data safety communication method based on block chain |
| CN111756546A (en) * | 2020-06-15 | 2020-10-09 | 杭州电子科技大学 | Block chain consensus method based on dynamic credit mechanism in Internet of vehicles environment |
| CN111818056A (en) * | 2020-07-09 | 2020-10-23 | 重庆邮电大学 | Industrial Internet identity authentication method based on block chain |
Non-Patent Citations (4)
| Title |
|---|
| A Blockchain-Based Vehicle Platoon Leader Updating Scheme;Yongxin Ji等;《ICC 2020 - 2020 IEEE International Conference on Communications (ICC)》;20200727;全文 * |
| A Blockchain-Based Vehicle-Trust Management Framework Under a Crowdsourcing Environment;Dawei Wang等;《020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)》;20210209;全文 * |
| Blockchain-Enhanced High-Confidence Energy Sharing in Internet of Electric Vehicles;Gang Sun等;《IEEE Internet of Things Journal》;20200507;全文 * |
| 基于区块链的工业物联网节点行为数据分析与追踪模型研究;李汀;《中国优秀硕士学位论文》;20210215;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113038427A (en) | 2021-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Study of blockchains’s consensus mechanism based on credit | |
| CN111131181B (en) | Reputation mechanism and DPBFT algorithm-based block chain dynamic DPoS consensus method | |
| CN111090892B (en) | Block chain consensus method and device based on VRF and threshold signature | |
| CN113038427B (en) | Block chain cross-region authentication method based on credit mechanism and DPOS | |
| CN109347804A (en) | A kind of Byzantine failure tolerance common recognition optimization method for block chain | |
| CN110602117B (en) | Vehicle networking node consistency consensus method based on block chain | |
| CN112039964A (en) | Node reputation consensus method based on block chain | |
| CN108665359A (en) | Block chain processing method, accounting nodes and verification node | |
| CN112883114A (en) | Transaction processing method and device applied to block chain | |
| CN108564468A (en) | A kind of common recognition method based on the dynamic equity for trusting member | |
| CN111682942B (en) | Binary weighted Byzantine fault-tolerant consensus method applied to license chain | |
| CN112540926A (en) | Resource allocation fairness federal learning method based on block chain | |
| CN113301047B (en) | Vehicle networking node consistency consensus method based on malicious node attack detection | |
| CN110602705A (en) | Improved PBFT consensus method suitable for Internet of vehicles environment | |
| CN110298657A (en) | A kind of block chain common recognition method, relevant apparatus and system | |
| CN113422805B (en) | Fragment consensus method based on verifiable random function | |
| CN109919760A (en) | Byzantine failure tolerance common recognition algorithm based on voting mechanism | |
| Lev et al. | Convergence of iterative scoring rules | |
| Xing et al. | Uavs-aided delay-tolerant blockchain secure offline transactions in post-disaster vehicular networks | |
| CN113988314A (en) | Cluster federal learning method and system for selecting client | |
| CN112217683A (en) | Cross-heterogeneous-chain data reachability processing method, system, medium, device and terminal | |
| CN114663104A (en) | PBFT based on block chain product supply chain tracing | |
| CN111598127A (en) | Block chain consensus algorithm based on machine learning | |
| CN112637822A (en) | Cellular network safe transaction platform based on block chain | |
| CN115499129A (en) | Multimode trust cross-chain consensus method, system, medium, equipment and terminal |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230822 Address after: 475000 East Side of the North Section of Yulu Avenue in Lankao County, Kaifeng City, Henan Province (Third Ring Garden) Patentee after: Henan Sanbao Hongxin Culture Development Co.,Ltd. Patentee after: Henan Yiyao Technology Group Co.,Ltd. Patentee after: Shanghai Yuefu Shengya Culture and Art Development Center Patentee after: Henan Film and Television Production Group Co.,Ltd. Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231018 Address after: Room 103, Technology Incubator, Smart Home Industrial Park, Economic and Technological Development Zone, Lankao County, Kaifeng City, Henan Province, 475000 Patentee after: Kung Fu Yuan Digital Technology Co.,Ltd. Address before: 475000 East Side of the North Section of Yulu Avenue in Lankao County, Kaifeng City, Henan Province (Third Ring Garden) Patentee before: Henan Sanbao Hongxin Culture Development Co.,Ltd. Patentee before: Henan Yiyao Technology Group Co.,Ltd. Patentee before: Shanghai Yuefu Shengya Culture and Art Development Center Patentee before: Henan Film and Television Production Group Co.,Ltd. |
|
| TR01 | Transfer of patent right |