CN112235360B - Data sharing method, device and system based on alliance chain, electronic equipment and computer readable storage medium - Google Patents
Data sharing method, device and system based on alliance chain, electronic equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN112235360B CN112235360B CN202011028388.8A CN202011028388A CN112235360B CN 112235360 B CN112235360 B CN 112235360B CN 202011028388 A CN202011028388 A CN 202011028388A CN 112235360 B CN112235360 B CN 112235360B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- chain
- data sharing
- alliance 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
Images
Classifications
-
- 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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- 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/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Storage Device Security (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of information security, in particular to a data sharing method, device and system based on a alliance chain, electronic equipment and a computer readable storage medium. The method comprises the following steps: a first node initiates a first data sharing request; judging whether the first node belongs to a node in a alliance chain; if so, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold; the first node sharing first data to a second node; the second node sharing the first data to the remaining nodes in the federation chain; each node corresponds to an intelligent terminal in the alliance chain. The data sharing scheme based on the alliance chain improves protection and control of data sharing authority and improves resource sharing efficiency among nodes.
Description
Technical Field
The invention relates to the technical field of information security, in particular to a data sharing method, device and system based on a alliance chain, electronic equipment and a readable storage medium.
Background
With the conflicting demands of continuous importance on interconnection and communication among enterprises and continuous increase of data leakage risks in the internet environment at present, people have become an important demand on whether data can be shared on the premise that limited information security is guaranteed between two parties and the data is not leaked, and the shared data is opened, meanwhile, sensitive information, secret-related data and the like of users are protected from being illegally obtained and utilized, and the shared data is a basic consensus and demand of opening shared data. The current data sharing method mainly comprises a traditional data sharing scheme and a centralized data sharing scheme; the traditional data sharing scheme is realized by listening to establishing shared data and object directories and setting permissions among shared users, and the sharing mode solves the safety problem but is not beneficial to the reuse of the shared data value, or the sharing mode is called as that the limited storage resources cause great waste, for example, except for data sharing between a specific bank and a central bank in bank transactions, partial inquiry permissions need to be opened for the users under special scenes to meet the business requirements of the users. However, the traditional data sharing cannot be realized, and only a part of shared data can be arranged out to be accessed by a user in another frame link. The centralized data sharing scheme mainly takes a third party as a data opening and sharing center, each data owner trusts and opens data to the third party, and the data sharing process is realized by scheduling through the third party.
Disclosure of Invention
The object of the present application is to solve at least one of the technical drawbacks mentioned above. The technical scheme adopted by the application is as follows:
in a first aspect, an embodiment of the present application discloses a data sharing method based on a federation chain, where the method includes:
a first node initiates a first data sharing request;
judging whether the first node belongs to a node in a alliance chain;
if so, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold;
the first node shares first data to a second node;
the second node sharing the first data to the remaining nodes in the federation chain; each node corresponds to an intelligent terminal in the alliance chain.
Optionally, the method further comprises:
judging whether the first node belongs to a node in a alliance chain;
if not, rejecting the first node's request for sharing.
Further, when a third node in the federation chain initiates a data access request to the first node;
acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a preset threshold value;
the first node shares data to a second node;
and the third node establishes a link with the second node to access the data.
Further, before the first node shares data to a second node, the method further comprises:
setting target parameters of preselected nodes participating in a data sharing decision;
when the preselected nodes meeting the target parameters jointly agree with a request of the first node for data sharing to the second node;
the first node shares data to a second node.
Optionally, the obtaining the second node in the federation chain by using the preset algorithm includes:
obtaining a degree center coefficient of each node in the alliance;
normalizing the degree center coefficient of each node;
calculating a compact center coefficient of each node according to the normalized degree center coefficient of each node;
and selecting a node in the alliance chain, wherein the compact center coefficient meets a first preset threshold value, as a second node.
Optionally, the method further comprises:
calculating the intermediate center coefficient of each node of which the compact center coefficient meets a first preset threshold;
and selecting the node with the intermediate center coefficient meeting a second preset threshold value as a second node.
Further, the preset target algorithm is as follows: the least squares method.
Optionally, each node in the federation chain has an independent storage function and a data interface function;
wherein the storage function is to store shared data;
the interface function is used for receiving alliance shared data;
optionally, the data interface function is further configured to receive information uploaded by the user of the node.
In another aspect, an embodiment of the present application provides a data sharing system based on a federation chain, where the system includes: the first node, the second node and other remaining nodes in the federation chain; wherein, the first and the second end of the pipe are connected with each other,
a first node initiates a first data sharing request;
judging whether the first node belongs to a node in a alliance chain;
if so, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold;
the first node sharing first data to a second node;
the second node sharing the first data to the remaining nodes in the federation chain; each node corresponds to an intelligent terminal in the alliance chain.
Further, when a third node in the federation chain initiates a data access request to the first node;
acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a preset threshold value;
the first node shares data to a second node;
and the third node establishes a link with the second node to access the data.
Specifically, before the first node shares data to the second node, setting target parameters of preselected nodes participating in a data sharing decision;
when the preselected nodes meeting the target parameters jointly agree with the request of the first node for data sharing to the second node;
the first node shares data to a second node.
In a third aspect, an embodiment of the present application further provides a data sharing method based on a federation chain, where the method is applied to a first terminal, where the first terminal corresponds to a first node in the federation chain, and the method includes:
a first node initiates a first data sharing request;
the first node sharing first data to a second node; the second node is a node which is obtained based on a preset algorithm and satisfies a first preset threshold value of a compact center coefficient in the alliance chain; wherein the first data is shared to remaining nodes in a federation chain through the second node; each node corresponds to an intelligent terminal in the alliance chain.
In a fourth aspect, an embodiment of the present application provides a data sharing apparatus based on a federation chain, where the apparatus is applied to a first terminal, and the first terminal corresponds to a first node in the federation chain, and the apparatus includes: an interface module and a memory module, wherein,
the storage module is used for storing first data;
the interface module is used for initiating a first data sharing request and sharing the first data to the second node; the second node is a node which is obtained based on a preset algorithm and satisfies a first preset threshold value of a compact center coefficient in the alliance chain;
wherein the first data is shared to remaining nodes in a federation chain through the second node; each node corresponds to an intelligent terminal in the alliance chain.
In a fifth aspect, an embodiment of the present application provides an electronic device, including a processor and a memory;
the memory is used for storing operation instructions;
the processor is configured to execute the method in any of the embodiments by calling the operation instruction.
In a sixth aspect, the present application provides a computer-readable storage medium, where a computer program is stored on the storage medium, and when the computer program is executed by a processor, the computer program implements the method of any one of the above embodiments.
The embodiment of the application provides a data sharing scheme, and a first data sharing request is initiated through a first node; judging whether the first node belongs to a node in a alliance chain; if so, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold; the first node sharing first data to a second node; the second node sharing the first data to the remaining nodes in the federation chain; wherein each node is realized by corresponding to an intelligent terminal in a alliance chain, and the beneficial effects at least comprise one of the following:
1) data sharing is performed based on a mode of a alliance chain, and compared with a traditional password verification and authorization authentication mode, the data sharing safety is improved. Resources cannot be stolen and unauthorized resources cannot be accessed.
2) On the basis of utilizing the characteristics of the alliance chain, the optimal path and the transmission mode of data sharing are optimized through the least square method, the shortest access can be optimized again for the newly added nodes, extra waste of the nodes is not needed for sharing, and therefore data access among the nodes is not slowed down due to increasingly increased shared materials.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings used in the description of the embodiments of the present application will be briefly described below.
FIG. 1 is an exemplary diagram of one diagram provided by an embodiment of the present application;
fig. 2 is a schematic flowchart of a data sharing method based on a federation chain according to an embodiment of the present application;
fig. 3 is a schematic flowchart of a data sharing method based on a federation chain according to an embodiment of the present application;
fig. 4 is a schematic diagram of a data sharing apparatus based on a federation chain according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to embodiments of the present application, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are exemplary only for the purpose of explaining the present application and are not to be construed as limiting the present invention.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. As used herein, the term "and/or" includes all or any element and all combinations of one or more of the associated listed items.
In addition, it is to be understood that "at least one" in the embodiments of the present application means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a alone, both A and B, and B alone, where A, B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a and b, a and c, b and c, or a, b and c, wherein a, b and c can be single or multiple.
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
The following describes the technical solutions of the present application and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.
Based on the limitations of the currently existing data sharing techniques as introduced in the background art, the following embodiments of the present invention provide a federation chain-based data sharing method to solve at least one of the above-mentioned deficiencies.
To more clearly describe the technical solution of the present application, the following describes some concepts, terms or systems that the following embodiments may relate to help understand the federation chain-based data sharing scheme disclosed in the present application:
the alliance chain is one of block chains, and refers to a block chain which is managed and maintained by a plurality of organizations together, nodes participating in the block chain are selected in advance, all or part of functions are opened only for internal members of the alliance, and reading, writing and accounting rules of information on the chain are set according to an alliance consensus mechanism. Or may be interpreted as specifying a number of preselected nodes internally as billers for only members of a particular group and limited third parties, each block generated as a result of all preselected nodes in common, other access nodes may participate in the transaction but without having to ask about the billing process, and other third parties may make limited queries through the API opened by the blockchain. To achieve better performance, the federation chain places certain requirements on the configuration and network environment of the consensus or authentication node. With the admission mechanism, the transaction performance can be improved more easily, and problems caused by the participants with different participation levels can be avoided. The alliance chain has the characteristics of high billing efficiency, short consensus time, low billing cost and privacy consideration.
The original intention of alliance chain design is to reduce the node of verifying based on the design that need not know each other and trust on changing public chain, reaches the purpose of save time and compares public blockchain, and alliance blockchain and private blockchain are more advantageous in efficiency and flexibility, mainly embody following several:
one is that the transaction costs are cheaper. The transaction can be verified only by a few trusted, high-computing nodes, without requiring a network-wide confirmation.
Secondly, the nodes can be well connected, the fault can be quickly repaired through manual intervention, and the consensus algorithm is allowed to be used to reduce the block time, so that the transaction can be completed more quickly.
Thirdly, if the reading right is limited, better privacy protection can be provided. Fourth, it is more flexible, and a community or company running a private blockchain can easily modify the rules of the blockchain, restore transactions, modify balances, etc., if desired.
A graph is a mesh data structure, consisting of a set of non-empty vertices and a set describing the relationships between the vertices, defined as G ═ V, E,
v: representing a non-empty finite set of elements, called vertices, A, B, C, D, E as shown in FIG. 1
E: a finite set of relationships between elements, called edges, are represented as { (A, B), (B, D), (B, C) } shown in FIG. 1
The graph is measured by three coefficients: degree center coefficient (degree center), closeness center coefficient (closeness center), and betweenness center coefficient (betweenness center), wherein:
coefficient of degree center: the number of edges connected to a certain point is normalized;
compact center coefficient: average length of shortest path from one node to other nodes;
the intermediate center coefficient: the number of the nodes existing on the shortest path of all the nodes.
The least square method is a mathematical tool widely applied in many subject fields of data processing such as error estimation, uncertainty, system identification and prediction, etc., and the least square method (also called a least squares method) is a mathematical optimization technology. It matches by minimizing the sum of the squares of the errors to find the best function of the data. Unknown data can be easily obtained by the least square method, and the sum of squares of errors between these obtained data and actual data is minimized.
Fig. 2 shows a schematic flowchart of data sharing based on a federation chain according to an embodiment of the present application, and as shown in fig. 2, the method mainly includes:
s201, a first node initiates a first data sharing request;
s202, judging whether the first node belongs to a node in a alliance chain;
s203, if so, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold;
s204, the first node shares the first data to a second node; further, in a specific embodiment, if not, the sharing request of the first node is rejected.
S205, the second node shares the first data to the rest nodes in the alliance chain; each node corresponds to an intelligent terminal in the alliance chain.
In all embodiments of the application, each node corresponds to one intelligent terminal and also corresponds to one user, and each node stores the uploaded shared resource information of the user.
The foregoing steps S201 to S205 are explained from the point that the node in the federation chain receives new data that needs to be shared in the federation resource pool, and transmits the new data to another sharing node, that is, uploads the data of the node to another node. Similarly, if viewed from the data access side, the method comprises the following steps:
when a third node in the alliance chain initiates a data access request to the first node;
acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a preset threshold value;
the first node shares data to a second node;
and the third node establishes a link with the second node to access the data.
Further, before the first node shares data to the second node, whether from data upload or data access, the method further comprises:
setting target parameters of preselected nodes participating in a data sharing decision;
when the preselected nodes meeting the target parameters jointly agree with a request of the first node for data sharing to the second node;
the first node shares data to a second node.
In the embodiment of the present application, the mechanism is designed such that when each node uploads data to a federation resource pool or each node needs to access data in the federation resource pool, a certain number of nodes need to be set as preselected decision nodes, for example, it may be set that the data sharing request degree of each node needs to be performed by at least 2/3 nodes in the federation chain for a common decision, and data sharing may continue only after the preselected decision nodes approve a single node upload or access request. Compared with the traditional data sharing, the embodiment of the application reduces the redundancy and complexity of password authentication.
Optionally, the obtaining the second node in the federation chain by using the preset algorithm includes:
step 1, obtaining a degree center coefficient of each node in the union;
step 2, normalizing the degree center coefficient of each node; on the same alliance chain, all nodes are mutually associated, so that degree center coefficients are uniform and must be normalized, the mapping range of the degree center coefficients is within { -1,1} by utilizing the normalization operation process, and the overlarge deviation caused by overlarge distance of some nodes is avoided;
step 3, calculating a compact center coefficient of each node according to the normalized degree center coefficient of each node; and selecting a node in the alliance chain, wherein the compact center coefficient meets a first preset threshold value, as a second node. In a preferred embodiment, the node in the federation chain whose compact center coefficient satisfies the first preset threshold is selected as the second node, specifically, the node with the smallest compact center coefficient is selected as the second node. Further, in an alternative embodiment, the preset target algorithm for calculating the minimum compact center coefficient of each node may be a least square method.
In an optional embodiment, the method further comprises:
calculating the intermediate center coefficient of each node of which the compact center coefficient meets a first preset threshold;
and selecting the node with the intermediate center coefficient meeting a second preset threshold value as a second node.
In a preferred embodiment, the process of selecting the optimal second node, that is, determining the optimal transmission path for data sharing, includes:
step 1, obtaining a degree center coefficient of each node in the alliance, normalizing the degree center coefficient of each node, and utilizing a normalization operation process to enable a mapping range to be { -1,1 }.
Step 2, calculating a compact center coefficient of each node by using a least square method according to the normalized degree center coefficient of each node;
step 3, calculating the intermediate center coefficient of each node with the compact center coefficient meeting a first preset threshold;
and 4, calculating the shortest path and determining the fastest mode of mutual access among the nodes according to the calculation result.
Optionally, each node in the federation chain has an independent storage function and a data interface function;
the storage function is used for storing shared data, including shared data acquired from other nodes and updated data uploaded from a terminal corresponding to the node;
the interface function is used for receiving alliance shared data;
optionally, the data interface function is further configured to receive information uploaded by the user of the node.
According to the data sharing method disclosed by the embodiment of the application, the data sharing prepositive authority is designed to be possessed only by the associated node in the alliance chain, so that the protection and control of the data sharing authority are realized; and the fastest mode of mutual access of the nodes in the alliance is determined by using the rule of the least square method, and the resource sharing efficiency among the nodes is improved.
In another aspect, an embodiment of the present application provides a data sharing method based on a federation chain, where the method is applied to a first terminal, and the first terminal corresponds to a first node in the federation chain, as shown in fig. 3, the method includes:
s301, a first node initiates a first data sharing request;
s302, the first node shares the first data to a second node; the second node is a node which is obtained based on a preset algorithm and satisfies a first preset threshold value of a compact center coefficient in the alliance chain; wherein the first data is shared to remaining nodes in a federation chain through the second node; each node corresponds to an intelligent terminal in the alliance chain.
Based on the federation chain-based data sharing method shown in fig. 3, in another aspect, an embodiment of the present application provides a federation chain-based data sharing apparatus, where the apparatus is applied to a first terminal, and the first terminal corresponds to a first node in a federation chain, and as shown in fig. 4, the apparatus may include: 401 an interface module and 402 a memory module, wherein,
the 402 storage module is used for storing first data;
the 401 interface module is configured to initiate a first data sharing request and share first data to a second node; the second node is a node which is obtained based on a preset algorithm and satisfies a first preset threshold value of a compact center coefficient in the alliance chain; wherein the first data is shared to remaining nodes in a federation chain through the second node; each node corresponds to an intelligent terminal in the alliance chain.
Based on the data sharing method based on the federation chain shown in fig. 2, on the other hand, an embodiment of the present application provides a data sharing system based on the federation chain, where the system may include: the first node, the second node and other remaining nodes in the federation chain; wherein, the first and the second end of the pipe are connected with each other,
a first node initiates a first data sharing request;
judging whether the first node belongs to a node in a alliance chain;
if yes, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold;
the first node shares first data to a second node;
the second node sharing the first data to the remaining nodes in the federation chain; each node corresponds to an intelligent terminal in the alliance chain.
Further, when a third node in the federation chain initiates a data access request to the first node;
acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a preset threshold value;
the first node shares data to a second node;
and the third node establishes a link with the second node to access the data.
Specifically, before the first node shares data to the second node, setting target parameters of preselected nodes participating in a data sharing decision;
when the preselected nodes meeting the target parameters jointly agree with the request of the first node for data sharing to the second node;
the first node shares data to a second node.
It is to be understood that the above-mentioned respective component devices of federation chain-based data sharing in the present embodiment have functions of implementing the corresponding steps of the method in the embodiments shown in fig. 2 and 3. The function can be realized by hardware, and can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules or systems corresponding to the above-described functions. The modules and systems can be software and/or hardware, and the modules and systems can be realized independently or integrated by a plurality of modules and systems. For the functional description of each module and system, reference may be specifically made to the corresponding description of the method in the embodiment shown in fig. 2 and fig. 3, and therefore, the beneficial effects that can be achieved by the method may refer to the beneficial effects in the corresponding method provided above, and details are not described here again.
It should be understood that the illustrated structure of the embodiment of the present invention does not constitute a specific limitation to the specific structure of the federation chain-based data sharing system. In other embodiments of the present application, a federation chain-based data sharing system may include more or fewer components than shown, or some components may be combined, or some components may be split, or a different arrangement of components. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.
The embodiment of the application provides an electronic device, which comprises a processor and a memory;
a memory for storing operating instructions;
and the processor is used for executing the data sharing method based on the alliance chain provided by any embodiment of the application by calling the operation instruction.
As an example, fig. 5 shows a schematic structural diagram of an electronic device to which an embodiment of the present application is applicable, and as shown in fig. 5, the electronic device 500 includes: a processor 501 and a memory 503. Wherein the processor 501 is coupled to the memory 503, such as via the bus 502. Optionally, the electronic device 500 may also include a transceiver 504. It should be noted that the transceiver 504 is not limited to one in practical applications. It is to be understood that the illustrated structure of the embodiment of the invention does not constitute a specific limitation to the specific structure of the electronic device 500. In other embodiments of the present application, the electronic device 500 may include more or fewer components than shown, or combine certain components, or split certain components, or a different arrangement of components. The illustrated components may be implemented in hardware, software, or a combination of software and hardware. Optionally, the electronic device may further include a display screen 505 for displaying images or receiving operation instructions of a user as needed.
The processor 501 is applied to the embodiment of the present application, and is configured to implement the method shown in the foregoing method embodiment. The transceiver 504 may include a receiver and a transmitter, and the transceiver 504 is applied in the embodiments of the present application to implement the functions of the electronic device of the embodiments of the present application to communicate with other devices when executed.
The Processor 501 may be a CPU (Central Processing Unit), a general-purpose Processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array) or other Programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 501 may also be a combination of implementing computing functionality, e.g., comprising one or more microprocessors, a combination of DSPs and microprocessors, and the like.
The processor 501 may operate the data sharing method based on the alliance chain provided in the embodiment of the present application, so as to reduce the operation complexity of the user, improve the intelligent degree of the terminal device, and improve the user experience. The processor 501 may include different devices, for example, when the CPU and the GPU are integrated, the CPU and the GPU may cooperate to execute the federation chain-based data sharing method provided in the embodiment of the present application, for example, part of algorithms in the federation chain-based data sharing method is executed by the CPU, and another part of algorithms is executed by the GPU, so as to obtain faster processing efficiency.
The Memory 503 may be a ROM (Read Only Memory) or other type of static storage device that can store static information and instructions, a RAM (Random Access Memory) or other type of dynamic storage device that can store information and instructions, an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact disk Read Only Memory), a high speed Random Access Memory, a non-volatile Memory such as at least one magnetic disk storage device, a flash Memory device, a Universal flash Memory (UFS), or other optical disk storage, optical disk storage (including Compact disk, laser disk, digital versatile disk, Blu-ray disk, etc.), a magnetic disk storage medium or other magnetic storage device, an optical disk storage medium, a magnetic disk storage medium, or other magnetic storage device, Or any other medium which can be used to carry or store desired program code in the form of instructions or data structures and which can be accessed by a computer, but is not limited to such.
Optionally, the memory 503 is used for storing application program codes for executing the scheme of the present application, and is controlled by the processor 501 to execute. The processor 501 is configured to execute the application program code stored in the memory 503 to implement the federation chain-based data sharing method provided in any embodiment of the present application.
The memory 503 may be used to store computer-executable program code, which includes instructions. The processor 501 executes various functional applications of the electronic device 500 and data processing by executing instructions stored in the memory 503. The memory 503 may include a program storage area and a data storage area. Wherein, the storage program area can store the codes of the operating system and the application program, etc. The storage data area may store data created during use of the electronic device 500 (e.g., images, videos, etc. captured by a camera application), and the like.
The memory 503 may further store one or more computer programs corresponding to the federation chain-based data sharing method provided in the embodiment of the present application. The one or more computer programs stored in the memory 503 and configured to be executed by the one or more processors 501 include instructions that can be used to perform the various steps in the respective embodiments described above.
Of course, the code of the federation chain-based data sharing method provided in the embodiment of the present application may also be stored in the external memory. In this case, the processor 501 may execute the code of the federation chain-based data sharing method stored in the external memory through the external memory interface, and the processor 501 may control the execution of the federation chain-based data sharing flow.
The display screen 505 includes a display panel. The display panel may be a Liquid Crystal Display (LCD), an organic light-emitting diode (OLED), an active-matrix organic light-emitting diode (AMOLED), a flexible light-emitting diode (FLED), a miniature, a Micro-o led, a quantum dot light-emitting diode (QLED), or the like. In some embodiments, the electronic device 500 may include 1 or N display screens 505, N being a positive integer greater than 1. The display screen 505 may be used to display information input by or provided to the user as well as various Graphical User Interfaces (GUIs). For example, the display screen 505 may display a photograph, video, web page, or file, etc.
The electronic device provided by the embodiment of the present application is applicable to any embodiment of the foregoing method, and therefore, the beneficial effects that can be achieved by the electronic device can refer to the beneficial effects in the corresponding method provided above, and details are not repeated here.
The present application provides a computer-readable storage medium, which stores thereon a computer program, and when the computer program is executed by a processor, the computer program implements the federation chain-based data sharing method shown in the above method embodiment.
The computer-readable storage medium provided in the embodiment of the present application is applicable to any embodiment of the foregoing method, and therefore, beneficial effects that can be achieved by the computer-readable storage medium refer to the beneficial effects in the corresponding method provided above, which are not described herein again.
The embodiment of the present application further provides a computer program product, which when running on a computer, causes the computer to execute the above related steps to implement the method in the above embodiment. The computer program product provided in the embodiments of the present application is applicable to any of the embodiments of the method described above, and therefore, the beneficial effects that can be achieved by the computer program product can refer to the beneficial effects in the corresponding method provided above, and are not described herein again.
The data sharing scheme based on the alliance chain provided by the embodiment of the application comprises the steps that a first node initiates a first data sharing request; judging whether the first node belongs to a node in a alliance chain; if so, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold; the first node sharing first data to a second node; the second node shares the first data to the remaining nodes in the federation chain; each node corresponds to an intelligent terminal in the alliance chain. According to the data sharing scheme based on the alliance chain, the nodes only relevant to the alliance chain have the data sharing preposed authority, and protection and control over the data sharing authority are achieved; and the fastest mode of mutual access of the nodes in the alliance is determined by using a rule of a least square method, and the resource sharing efficiency among the nodes is improved.
In the several embodiments provided in the present application, it should be understood that the disclosed system and method may be implemented in other ways. For example, the above-described system embodiments are merely illustrative, and for example, a division of a module or a unit is merely one type of logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be discarded or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, systems or units, and may be in an electrical, mechanical or other form.
Units described as separate parts may or may not be physically separate, and parts displayed as units may be one physical unit or a plurality of physical units, may be located in one place, or may be distributed to a plurality of different places. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented as a software functional unit and sold or used as a separate product, may be stored in a readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially or partially contributed to by the prior art, or all or part of the technical solutions may be embodied in the form of a software product, where the software product is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the methods of the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
It should be understood that, although the steps in the flowcharts of the figures are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least a portion of the steps in the flow chart of the figure may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed alternately or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of changes or substitutions within the technical scope of the present application, and can make several modifications and decorations, and these changes, substitutions, improvements and decorations should also be considered to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (14)
1. A federation chain-based data sharing method, the method comprising:
a first node initiates a first data sharing request;
judging whether the first node belongs to a node in a alliance chain;
if yes, acquiring a second node in the alliance chain; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold;
the first node shares first data to a second node;
the second node sharing the first data to the remaining nodes in the federation chain; each node corresponds to an intelligent terminal in a alliance chain;
the method for acquiring the second node in the alliance chain comprises the following steps: obtaining a degree center coefficient of each node in the alliance;
normalizing the degree center coefficient of each node;
calculating a compact center coefficient of each node according to the normalized degree center coefficient of each node;
selecting a node in the alliance chain with the compact center coefficient meeting a first preset threshold value as a second node;
calculating the intermediate center coefficient of each node of which the compact center coefficient meets a first preset threshold;
and selecting the node with the intermediate center coefficient meeting a second preset threshold value as a second node.
2. A federation chain-based data sharing method as claimed in claim 1, wherein the method further comprises:
judging whether the first node belongs to a node in a alliance chain;
if not, rejecting the sharing request of the first node.
3. A federation chain-based data sharing method as claimed in claim 1, wherein the method further comprises:
a third node in the federation chain initiates a data access request to the first node;
acquiring a second node in the alliance chain; the second node is a node of which the compact center coefficient in the alliance chain meets a preset threshold value;
the first node shares data to a second node;
and the third node establishes a link with the second node to access the data.
4. A federation chain-based data sharing method as claimed in claim 1 or 3, wherein before the first node shares data to a second node, the method further comprises:
setting target parameters of preselected nodes participating in a data sharing decision;
when the preselected nodes meeting the target parameters jointly agree with a request of the first node for data sharing to the second node;
the first node shares data to a second node.
5. A federation chain-based data sharing method as claimed in claim 1 wherein the compact centre coefficient for each node is calculated using a least squares method.
6. A federation chain-based data sharing method as claimed in claim 1 or 5 wherein each node in the federation chain has independent storage and data interface functions; wherein the storage function is to store shared data; the interface function is used for receiving alliance shared data.
7. A federation chain-based data sharing method as claimed in claim 6 wherein the data interface function is also used to receive information uploaded by a node.
8. A federation chain-based data sharing system, the system comprising: the first node, the second node and other remaining nodes in the federation chain; wherein the content of the first and second substances,
a first node initiates a first data sharing request;
judging whether the first node belongs to a node in a alliance chain;
if yes, acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a first preset threshold;
the first node sharing first data to a second node;
the second node sharing the first data to the remaining nodes in the federation chain; each node corresponds to an intelligent terminal in the alliance chain.
9. A federation chain-based data sharing system as claimed in claim 8 wherein a third node in the federation chain initiates a data access request to the first node;
acquiring a second node in the alliance chain by using a preset algorithm; the second node is a node of which the compact center coefficient in the alliance chain meets a preset threshold value;
the first node shares data to a second node;
and the third node establishes a link with the second node to access the data.
10. A federation chain-based data sharing system as claimed in claim 9 wherein before the first node shares data to a second node, target parameters are set for preselected nodes participating in a data sharing decision;
when the preselected nodes meeting the target parameters jointly agree with the request of the first node for data sharing to the second node;
the first node shares data to a second node.
11. A data sharing method based on a federation chain is characterized in that the method is applied to a first terminal, wherein the first terminal corresponds to a first node in the federation chain, and the method comprises the following steps:
a first node initiates a first data sharing request;
the first node sharing first data to a second node; the second node is a node which is obtained based on a preset algorithm and satisfies a first preset threshold value of a compact center coefficient in the alliance chain; wherein the first data is shared to remaining nodes in a federation chain by the second node; each node corresponds to an intelligent terminal in the alliance chain.
12. An apparatus for data sharing based on federation chain, the apparatus being applied to a first terminal, the first terminal corresponding to a first node in the federation chain, the apparatus comprising: an interface module and a memory module, wherein,
the storage module is used for storing first data;
the interface module is used for initiating a first data sharing request and sharing the first data to the second node; the second node is a node which is obtained based on a preset algorithm and satisfies a first preset threshold value of a compact center coefficient in the alliance chain;
wherein the first data is shared to remaining nodes in a federation chain through the second node; each node corresponds to an intelligent terminal in the alliance chain.
13. An electronic device comprising a processor and a memory;
the memory is used for storing operation instructions;
the processor is used for executing the method of any one of claims 1-7 or 11 by calling the operation instruction.
14. A computer-readable storage medium, characterized in that the storage medium has stored thereon a computer program which, when being executed by a processor, carries out the method of any one of claims 1-7 or 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011028388.8A CN112235360B (en) | 2020-09-26 | 2020-09-26 | Data sharing method, device and system based on alliance chain, electronic equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011028388.8A CN112235360B (en) | 2020-09-26 | 2020-09-26 | Data sharing method, device and system based on alliance chain, electronic equipment and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112235360A CN112235360A (en) | 2021-01-15 |
| CN112235360B true CN112235360B (en) | 2022-09-06 |
Family
ID=74107774
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011028388.8A Active CN112235360B (en) | 2020-09-26 | 2020-09-26 | Data sharing method, device and system based on alliance chain, electronic equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112235360B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113434269A (en) * | 2021-06-10 | 2021-09-24 | 湖南天河国云科技有限公司 | Block chain-based distributed privacy calculation method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111262724A (en) * | 2020-01-07 | 2020-06-09 | 中国联合网络通信集团有限公司 | Method and device for confirming trust relationship between domains |
| CN111294202A (en) * | 2020-01-16 | 2020-06-16 | 重庆邮电大学 | Identity authentication method facing alliance chain |
| CN111586157A (en) * | 2020-04-30 | 2020-08-25 | 财付通支付科技有限公司 | Information processing method, device and equipment |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10484346B2 (en) * | 2017-02-07 | 2019-11-19 | Microsoft Technology Licensing, Llc | Establishment of consortium blockchain network |
| WO2018209542A1 (en) * | 2017-05-16 | 2018-11-22 | 北京大学深圳研究生院 | Consensus method for decentralized domain name system |
| CN110210961A (en) * | 2019-05-21 | 2019-09-06 | 平安普惠企业管理有限公司 | Data capture method, server and computer storage medium based on alliance's chain |
| CN110245185A (en) * | 2019-05-21 | 2019-09-17 | 平安普惠企业管理有限公司 | Data processing method, terminal device and computer storage medium based on alliance's chain |
| CN110868424A (en) * | 2019-11-26 | 2020-03-06 | 深圳市信联征信有限公司 | Data sharing method and device based on block chain, computer equipment and storage medium |
-
2020
- 2020-09-26 CN CN202011028388.8A patent/CN112235360B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111262724A (en) * | 2020-01-07 | 2020-06-09 | 中国联合网络通信集团有限公司 | Method and device for confirming trust relationship between domains |
| CN111294202A (en) * | 2020-01-16 | 2020-06-16 | 重庆邮电大学 | Identity authentication method facing alliance chain |
| CN111586157A (en) * | 2020-04-30 | 2020-08-25 | 财付通支付科技有限公司 | Information processing method, device and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112235360A (en) | 2021-01-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7422806B2 (en) | Methods, electronic devices and storage media to avoid or reduce cryptographically stranded resources in blockchain networks | |
| EP3479519B1 (en) | Dynamic access control on blockchain | |
| CN110166442B (en) | Data processing method and device based on block chain | |
| US11386405B2 (en) | Dynamic blockchain transactional policy management | |
| CN106919419A (en) | The update method and device of the intelligent contract program on block chain | |
| WO2020259156A1 (en) | Blockchain-based private transaction method and apparatus | |
| US20180365688A1 (en) | Transaction execution and validation in a blockchain | |
| CN110275891B (en) | Artificial intelligence software market | |
| CN110855637A (en) | Block chain Internet of things distributed access control method based on attributes | |
| CN110505228B (en) | Edge cloud architecture-based big data processing method, system, medium and device | |
| CN110851877B (en) | Data processing method and device, block chain node equipment and storage medium | |
| US20170004201A1 (en) | Structure-based entity analysis | |
| Kwame et al. | V-chain: A blockchain-based car lease platform | |
| CN112235360B (en) | Data sharing method, device and system based on alliance chain, electronic equipment and computer readable storage medium | |
| US11363000B1 (en) | System for virtual private network authentication sensitivity with read only sandbox integration | |
| CN110033188A (en) | Business scheduling method, device, calculating equipment and medium based on block chain | |
| CN116821952A (en) | Privacy data calculation traceability system and method based on block chain consensus mechanism | |
| CN110276693B (en) | Insurance claim settlement method and system | |
| WO2023221350A1 (en) | Blockchain-based code copyright registration system, method and platform | |
| CN112184435A (en) | Supervision contract signing method and device, electronic equipment and readable storage medium | |
| CN111314436A (en) | Hierarchical block chain system and implementation method | |
| WO2020119477A1 (en) | Identity authentication method employing blockchain, and terminal apparatus | |
| Zhang et al. | Access Control Model Based on the Privacy of Crowdsourcing Task Content Protection in the Blockchain Environment | |
| US20240028675A1 (en) | Managing virtual avatars in virtual environments | |
| Xian et al. | A data middleware for obtaining trusted price data for blockchain |
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 |