CN111371801B - Block chain node scanning method, equipment and storage medium - Google Patents
Block chain node scanning method, equipment and storage medium Download PDFInfo
- Publication number
- CN111371801B CN111371801B CN202010176609.XA CN202010176609A CN111371801B CN 111371801 B CN111371801 B CN 111371801B CN 202010176609 A CN202010176609 A CN 202010176609A CN 111371801 B CN111371801 B CN 111371801B
- Authority
- CN
- China
- Prior art keywords
- node
- list
- nodes
- verification
- block 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 45
- 238000012795 verification Methods 0.000 claims abstract description 33
- 238000004590 computer program Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 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/12—Applying verification of the received information
-
- 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/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
-
- 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
- H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
-
- 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)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a block chain link point scanning method, equipment and a storage medium, wherein the method comprises the following steps: sending a connection request to a node to be connected, and judging whether the connection is successful: if not, adding the node into a local intranet node list; if yes, obtaining verification information of the node, verifying the verification information, and judging whether verification is successful: if yes, adding the node into a local external network node list, acquiring a connection node list of the node, and judging whether a first node which is not requested to be connected by the current node exists in the connection node list: if so, marking the first node as the node to be connected, and returning to send the connection request to the node to be connected. The invention realizes that the active statistics of the number of the block chain nodes can be carried out by any one or more block chain nodes without depending on any specific equipment.
Description
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a block chain link point scanning method, device, and storage medium.
Background
The number of the nodes of the blockchain network can be used as a criterion for judging the size of the blockchain network, and in the conventional statistical scheme of the number of the blockchain nodes, each node is usually actively connected with a specified server, and then the server counts data.
The above block chain node number statistical scheme has the disadvantages that, on one hand, the statistical mode is very passive, and only the node connection can be waited, but the active statistics can not be carried out; on the other hand, the above scheme relies on a specific server, and once the server is modified or an authentication server is added, the configuration of all nodes needs to be updated.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a block link point scan method, apparatus, and storage medium that can proactively count the number of block link nodes without relying on any particular equipment.
In a first aspect, the present invention provides a block chain link point scanning method suitable for a block chain node, including:
sending a connection request to a node to be connected, and judging whether the connection is successful:
if not, adding the node into a local intranet node list;
if yes, obtaining verification information of the node, verifying the verification information, and judging whether verification is successful:
if yes, adding the node into a local external network node list; and the number of the first and second groups,
acquiring a connection node list of the node, and judging whether a first node which is not requested to be connected by the current node exists in the connection node list:
If so, marking the first node as the node to be connected, and returning to send the connection request to the node to be connected.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a block link point scanning method provided in accordance with embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the block link point scanning method provided according to the embodiments of the present invention.
According to the block chain link point scanning method, the block chain link point scanning device and the block chain link point scanning storage medium, the connection node list is obtained from the successfully connected external network nodes, and the obtained nodes which are not connected in the connection node list are requested to be connected, so that all the nodes in the block chain network are scanned, and therefore the purpose that the scanning can be performed by any one or more block chain link points and the number of the block chain nodes can be actively counted without depending on any specific device is achieved;
the block chain link point scanning method, the block chain link point scanning device and the storage medium provided by some embodiments of the present invention further verify the block hash with random height after the connection is successful, thereby avoiding identifying a device maliciously disguised as a block chain link node as a block chain link point, and ensuring that verification is completed on a new node which is synchronizing block data.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments made with reference to the following drawings:
fig. 1 is a flowchart of a block link point scanning method according to an embodiment of the present invention.
FIG. 2 is a flow diagram of a preferred embodiment of the method of FIG. 1.
FIG. 3 is a flow diagram of a preferred embodiment of the method of FIG. 1.
Fig. 4 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of a block link point scanning method according to an embodiment of the present invention.
As shown in fig. 1, in this embodiment, the present invention provides a method for scanning a block chain node, including:
s11: sending a connection request to a node to be connected, and judging whether the connection is successful:
otherwise, step S12 is executed: adding the node into a local intranet node list;
if yes, go to step S13: obtaining verification information of the node, verifying the verification information, and judging whether verification is successful:
if yes, go to step S14: adding the node into a local external network node list; and the number of the first and second groups,
s15: acquiring a connection node list of the node, and judging whether a first node which is not requested to be connected by the current node exists in the connection node list:
if yes, go to step S16: the first node is marked as a node to be connected, and the process returns to step S11.
Specifically, in a blockchain network, each blockchain node needs to be connected with several other blockchain nodes, so each blockchain node locally maintains a connection node list of the current node. In this embodiment, the connection node list specifically includes an active connection node list out _ peer and a passive connection node list inner _ peer; in other embodiments, the blockchain node may configure a connection node list that is not subdivided or subdivided according to different policies according to actual needs.
The method is exemplarily described below by taking the scanning of the nodes and the statistics of the number of the nodes by the blockchain node a as an example.
In step S11, the node a connects the local connection node list out _ peerlistAAnd inner _ peerlistAEach node in (1) is marked as a node to be connected, and each node to be connected is respectively connected:
if the node a fails to connect to the node B, step S12 is executed, the node B is added to the intranet node list of the local node a, and the scanning branch based on the node B is ended;
if the node a succeeds in connecting to the node C, the step S13 is executed to obtain the verification information V from the node CCAnd is paired with VCAnd (6) carrying out verification. Specifically, in the present embodiment, the authentication information VCConfigured to be randomly assigned by the node A, and the current block height H of the plurality of random heights not larger than the node CCAnd is closest to HCRandom height of (H)1Block hash of1(ii) a In other embodiments, the method shown in fig. 2 may be adopted according to actual needs, or other methods as will be understood by those skilled in the art may be adopted to configure and verify the verification information.
When the block height returned by the node C is H1Block hash of1Block height of H stored locally with node A1Block hash of 2When the verification is different, the verification fails, and the node A considers that the node C is not a node of the current block link network;
when the block height returned by the node C is H1Block hash of1Block height of H stored locally with node A1Block hash of2If the verification is successful, executing step S14, and adding node C to the local extranet node list of node a; and the number of the first and second groups,
step S15, obtaining the connection node list out _ peer of the node CCAnd inner _ peerlistCAnd determines out _ peerlistCAnd inner _ peerlistCWhether there is a first node that node a has not requested to connect to:
if not, the scanning branch based on the node C is ended;
if yes, step S16 is executed to mark the first node M as a node to be connected, and the method returns to step S11 to request to connect the node M, and the scanning is continued based on the node M.
The process of the node a connecting with more nodes for scanning may refer to the process of the node B or the node C for scanning, which is not described in detail.
When the scanning branch based on each node is finished and new unconnected node information is not obtained, the scanning can be finished, and the number of nodes of the current block chain network is determined according to the local intranet node list and the local extranet node list of the node A.
The above example is exemplified by the node a actively performing scanning, and in further embodiments, any one or more nodes may be scanned by the above method, respectively, and are not limited to any particular device.
In the embodiment, the scanning of all the nodes in the block chain network is completed by acquiring the connection node list from the successfully connected external network nodes and requesting to connect the nodes which are not connected in the acquired connection node list, so that the active statistics of the number of the block chain nodes can be realized by any one or more block chain link points without depending on any specific equipment.
FIG. 2 is a flow diagram of a preferred embodiment of the method shown in FIG. 1. As shown in fig. 2, in a preferred embodiment, step S13 includes:
s131: acquiring the current height of the node, and determining a random height according to the current height;
s133: acquiring a first block hash of the random height of the node;
s135: verifying whether the first chunk hash is the same as a second chunk hash of the random height of the current node: if yes, the verification is successful.
Specifically, taking the scanning of the node C by the node a as an example:
in step S131, node a obtains the current block height H of node C CAccording to HCIs determined not to be greater than HCRandom height of (H)3；
In step S133, node a obtains the block height of node C as H3Block hash of3；
In step S135, the node a verifies the blockhash3Block height from local is H3Block hash of4Whether or not they are the same: if yes, the verification is successful.
The advantage of the verification method shown in fig. 2 over the verification method described in the example of fig. 1 is that it can ensure that the verification is completed for the new node that is synchronizing the block data (in the verification method described in the example of fig. 1, if each random height is greater than the synchronization height of the new node, the verification cannot be completed for the new node).
Preferably, the random height is no greater than the difference between the current height and the furcation safety depth. Specifically, the configuration can avoid misjudgment of other nodes caused by extreme reasons such as that the current node is in a bifurcation. The specific value of the bifurcation security depth can be configured according to a specific consensus mechanism.
The embodiment further verifies the block hash with random height after connection is successful, so that equipment maliciously disguised as block chain nodes is prevented from being identified as block chain node points, and verification of new nodes which are synchronizing block data is guaranteed.
FIG. 3 is a flow diagram of a preferred embodiment of the method of FIG. 1. As shown in fig. 3, in a preferred embodiment, the method further comprises:
s17: after the authentication fails at step S13, first notification information for notifying that the node is an illegal node is generated and broadcast in the blockchain network.
Specifically, when the node is determined to be an illegal node due to failure of the verification, the notification information m1 for notifying that the node is an illegal node may be directly generated and broadcasted, or the illegal node information of the node may be locally recorded, and after the scanning is finished, all the illegal node information may be collected to generate the notification information m2, and then the notification information m2 may be broadcasted.
After receiving m1 or m2, other nodes can avoid interacting with illegal nodes in time according to m1 or m 2.
Further preferably, the method further comprises: and verifying the second notification information broadcast by other nodes, and if the verification is successful, not connecting the illegal nodes notified by the second notification information.
Specifically, in order to avoid interference from the notification information forged and broadcast by a lawless person, the notification information may be verified when the notification information broadcast by other nodes is received. The manner of verifying the notification information may be configured to verify a signature (based on a private key built in the scanner) of the notification information, or verify an illegal node notified by the notification information based on the verification manner of step S13, or the like.
Fig. 4 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 4, as another aspect, the present application also provides an apparatus 400 including one or more Central Processing Units (CPUs) 401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data necessary for the operation of the device 400 are also stored. The CPU401, ROM402, and RAM403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each unit may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of such a unit or module does not in some way constitute a limitation on the unit or module itself.
The foregoing description is only exemplary of the preferred embodiments of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (8)
1. A method for block chain link point scanning, which is applied to a block chain node, the method comprising:
Sending a connection request to a node to be connected, and judging whether the connection is successful:
if not, adding the node into a local intranet node list;
if yes, obtaining verification information of the node, verifying the verification information, and judging whether verification is successful:
if yes, adding the node into a local external network node list; and (c) a second step of,
acquiring a connection node list of the nodes, and judging whether a first node which is not requested to be connected by the current node exists in the connection node list:
if so, marking the first node as a node to be connected, and returning to the node to be connected to send a connection request;
and when each scanning branch is finished and new unconnected node information is not acquired, finishing scanning, and determining the number of nodes of the current block chain network according to the local intranet node list and the local extranet node list.
2. The method of claim 1, wherein obtaining authentication information of the node and verifying the authentication information, and determining whether the authentication is successful comprises:
acquiring the current height of the node, and determining a random height according to the current height;
obtaining a first chunk hash of the random height of the node, verifying whether the first chunk hash is the same as a second chunk hash of the random height of the current node:
If yes, the verification is successful.
3. The method of claim 2, wherein the random height is no greater than a difference between the current height and a furcation security depth.
4. The method of any one of claims 1-3, further comprising:
and after the verification fails, generating first notification information for notifying the node of being an illegal node and broadcasting the first notification information in the blockchain network.
5. The method of claim 4, further comprising:
and verifying the second notification information broadcast by other nodes, and if the verification is successful, not connecting the illegal nodes notified by the second notification information.
6. The method according to any of claims 1-3, wherein the list of connecting nodes comprises a list of active connecting nodes and a list of passive connecting nodes.
7. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-6.
8. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010176609.XA CN111371801B (en) | 2020-03-13 | 2020-03-13 | Block chain node scanning method, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010176609.XA CN111371801B (en) | 2020-03-13 | 2020-03-13 | Block chain node scanning method, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111371801A CN111371801A (en) | 2020-07-03 |
| CN111371801B true CN111371801B (en) | 2022-05-24 |
Family
ID=71211882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010176609.XA Active CN111371801B (en) | 2020-03-13 | 2020-03-13 | Block chain node scanning method, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111371801B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112052250A (en) * | 2020-09-02 | 2020-12-08 | 杭州复杂美科技有限公司 | Performance measurement method, broadcast performance adjustment method, device and storage medium |
| CN115277021B (en) * | 2022-07-29 | 2025-10-17 | 蚂蚁区块链科技(上海)有限公司 | Method and device for preventing network attack |
| CN116471280B (en) * | 2022-08-30 | 2026-02-10 | 天津理工大学 | A lightweight blockchain network topology detection method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108769010A (en) * | 2018-05-29 | 2018-11-06 | 中国联合网络通信集团有限公司 | The method and apparatus that node is invited to registration |
| CN108989465A (en) * | 2018-08-30 | 2018-12-11 | 清华大学 | Common recognition method, server, storage medium and distributed system |
| CN110071898A (en) * | 2018-01-22 | 2019-07-30 | 厦门本能管家科技有限公司 | A method of removing Spot detection node legitimacy |
| CN110365584A (en) * | 2019-08-06 | 2019-10-22 | 北京润科通用技术有限公司 | A kind of network management and device |
| CN110730195A (en) * | 2019-12-18 | 2020-01-24 | 腾讯科技（深圳）有限公司 | Data processing method and device and computer readable storage medium |
| CN110855492A (en) * | 2019-11-15 | 2020-02-28 | 腾讯科技（深圳）有限公司 | Data processing method, device and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7904450B2 (en) * | 2008-04-25 | 2011-03-08 | Wilson Kelce S | Public electronic document dating list |
| US20190188700A1 (en) * | 2017-12-15 | 2019-06-20 | Fmr Llc | Social Data Tracking Datastructures, Apparatuses, Methods and Systems |
-
2020
- 2020-03-13 CN CN202010176609.XA patent/CN111371801B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110071898A (en) * | 2018-01-22 | 2019-07-30 | 厦门本能管家科技有限公司 | A method of removing Spot detection node legitimacy |
| CN108769010A (en) * | 2018-05-29 | 2018-11-06 | 中国联合网络通信集团有限公司 | The method and apparatus that node is invited to registration |
| CN108989465A (en) * | 2018-08-30 | 2018-12-11 | 清华大学 | Common recognition method, server, storage medium and distributed system |
| CN110365584A (en) * | 2019-08-06 | 2019-10-22 | 北京润科通用技术有限公司 | A kind of network management and device |
| CN110855492A (en) * | 2019-11-15 | 2020-02-28 | 腾讯科技（深圳）有限公司 | Data processing method, device and storage medium |
| CN110730195A (en) * | 2019-12-18 | 2020-01-24 | 腾讯科技（深圳）有限公司 | Data processing method and device and computer readable storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 区块链共识机制研究与分析;刘童桐;《信息通信技术与政策》;20180731;P26-P33 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111371801A (en) | 2020-07-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111371801B (en) | Block chain node scanning method, equipment and storage medium | |
| EP3855702A1 (en) | Blockchain-based service processing method and system | |
| CN105516135B (en) | Method and device for account login | |
| CN114449000B (en) | Internet of vehicles data consensus optimization storage method and storage system | |
| WO2021233048A1 (en) | Blockchain-based data detection method and device, and computer-readable storage medium | |
| US7577721B1 (en) | Structured peer-to-peer push distribution network | |
| CN110046901B (en) | Credibility verification method, system, device and equipment of alliance chain | |
| CN112184436B (en) | Data synchronization method, electronic device and readable storage medium | |
| CN111275438A (en) | Consensus method, device, equipment and storage medium for block chain network | |
| CN112651010A (en) | Method and device for verifying sliding verification code, computer equipment and medium | |
| FR3007231A1 (en) | SERVER APPARATUS, COMMUNICATION SYSTEM, AND DATA TRANSMISSION METHOD | |
| KR101944581B1 (en) | System, method, and apparatus for authentication | |
| CN113794694A (en) | Binary consensus method and device based on reliable broadcast | |
| AU2019302938A1 (en) | Decentralized automatic phone fraud risk management | |
| CN108683631B (en) | Method and system for preventing scanning of authority file | |
| CN116961892A (en) | Blockchain-based key generation method, device, electronic device and readable medium | |
| US11601290B2 (en) | Centralized database with provisions to prevent PKI key and security certificate duplication | |
| CN112235251B (en) | Block chain management method and device, computer equipment and storage medium | |
| CN111190754B (en) | Block chain event notification method and block chain system | |
| CN116244725A (en) | File processing method and device based on block chain, equipment and file contribution system | |
| WO2009102114A2 (en) | Terminal and method for identifying contents | |
| CN112118292A (en) | Method, apparatus, network node and storage medium for cross-link communication | |
| EP3306506A1 (en) | Authentication of a new device by a trusted device | |
| CN119696915A (en) | A method for detecting and locating abnormal behavior of edge nodes suitable for task offloading scenarios | |
| CN111935251B (en) | Block chain network management method, network, device, equipment and storage medium |
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 |