Data sharing method, device, storage medium and product

Abstract

The application discloses a data sharing method and device, a storage medium and a product, relates to the technical field of blockchains, and the data sharing method comprises the following steps: receiving a data transaction request sent by a data requester; selecting data owners participating in a transaction from a blockchain based on committee nodes and the data transaction request; receiving a first transaction request sent by the data owners, and voting for a transaction corresponding to the first transaction request through an authority to generate a consensus transaction, wherein the consensus transaction is obtained through comprehensive voting based on reputations of the data requester and the data owners, the reputation is inversely proportional to network activity of the data requester and / or the data owners; and storing data corresponding to the consensus transaction in a node of the blockchain through a record manager after the consensus transaction is executed and completed. The application achieves the technical effect of avoiding being manipulated by other users in a sharing network.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of blockchain, and particularly relates to a data sharing method, device, storage medium and computer program product. BACKGROUND

[0002] Data sharing can connect many Internet and wearable devices. In any data sharing application, the most important thing is how to share data among various nodes while ensuring the privacy and security of all participating data sharing users. A blockchain is a distributed and immutable ledger that can provide tamper-proof and decentralized functions, and is therefore widely used in data sharing among various users.

[0003] However, although blockchain technology has potential in improving security and privacy, in order to encourage users to participate in the sharing network and promote their cooperation, a reputation mechanism is usually adopted to give each node in the blockchain a certain reputation score. However, in this case, a selfish user can manipulate the mechanism to seek his own interests, and therefore, how to avoid being manipulated by other users in the sharing network during the transaction has become a problem to be solved.

[0004] The above content is only used to assist in understanding the technical solutions of the present application and does not represent the acknowledgement of the above content as prior art. SUMMARY

[0005] The main purpose of the present application is to provide a data sharing method, device, storage medium and computer program product, which aims to solve the technical problem in the related art that a reputation mechanism is adopted to give each node in the blockchain a certain reputation score, but in this case, a selfish user can manipulate the mechanism to seek his own interests, and is easy to be manipulated by other users in the sharing network.

[0006] To achieve the above purpose, the present application provides a data sharing method, which comprises:

[0007] receiving a data transaction request sent by a data requester;

[0008] selecting a data owner participating in the transaction from a blockchain based on a committee node and the data transaction request;

[0009] receiving a first transaction request sent by the data owner, and voting for a transaction corresponding to the first transaction request through an authority to generate a consensus transaction, wherein the consensus transaction is obtained by comprehensive voting based on reputation values of the data requester and the data owner, and the reputation values are inversely proportional to network activity of the data requester and / or the data owner;

[0010] After the consensus transaction is executed, the consensus transaction corresponding data is stored in the blockchain corresponding node by the record manager.

[0011] In an embodiment, the step of voting the transaction corresponding to the first transaction request by the authority to generate a consensus transaction comprises:

[0012] Voting the transaction corresponding to the first transaction request by the authority and the decision maker to obtain voting data;

[0013] Verifying the voting data by a preset consensus algorithm, and generating a consensus transaction after determining that the authority and the decision maker reach a consensus.

[0014] In an embodiment, before the step of voting the transaction corresponding to the first transaction request by the authority and the decision maker to obtain voting data, further comprising:

[0015] Obtaining the number of cooperation between any data owner and data requester and network activity in a preset transaction time period;

[0016] Based on the network activity, calculating the reputation rate of the data owner or data requester to obtain a user reputation rate;

[0017] Based on the user reputation rate and the number of cooperation, calculating a user reputation value;

[0018] Assigning the user reputation value to the data owner and the data requester;

[0019] The step of voting the transaction corresponding to the first transaction request by the authority and the decision maker to obtain voting data comprises:

[0020] According to the user reputation value, voting the transaction corresponding to the first transaction request by the authority and the decision maker to obtain voting data.

[0021] In an embodiment, the step of calculating the reputation rate of the data owner or data requester based on the network activity to obtain a user reputation rate comprises:

[0022] Based on the network activity, calculating the reputation rate of the data owner or data requester to obtain a user reputation rate, wherein the formula of the user reputation rate is as follows:

[0023]

[0024] Wherein, is the network activity, , a preset network activity threshold, , , Three values corresponding to the user reputation rate under different network activity are shown.

[0025] In an embodiment, the step of generating a consensus transaction after the consensus of the parties in the authority and the decision maker is reached through the preset consensus algorithm includes:

[0026] determining the voting options of the parties in the authority;

[0027] If the number of votes in favor is greater than the number of votes against in the voting options, it is determined that the consensus of the parties in the authority and the decision maker is reached, and a consensus transaction is generated.

[0028] If the number of votes in favor is equal to the number of votes against in the voting options, a target trust factor is calculated based on a preset consensus algorithm, the target trust factor including a first trust factor of the data owner, a second trust factor of the data requester, and a transaction trust factor corresponding to the current transaction.

[0029] If it is determined that the transaction trust factor is less than a first preset threshold, a first personnel list corresponding to the votes in favor in the voting options and the target trust factor are sent to a leader for the leader to perform reputation punishment on the first personnel list based on the target trust factor, wherein the leader is randomly selected from the parties in the authority.

[0030] If the second trust factor is greater than a second preset threshold, a second personnel list corresponding to the votes against in the voting options and the target trust factor are sent to the leader for the leader to perform reputation punishment on the second personnel list based on the target trust factor.

[0031] After the reputation punishment is performed, the consensus of the parties in the authority and the decision maker is determined according to the proportion of votes in favor and votes against, and a consensus transaction is generated.

[0032] In an embodiment, the step of calculating the target trust factor based on the preset consensus algorithm includes:

[0033] The target trust factor is calculated based on the preset consensus algorithm, and the calculation formula of the first trust factor of the data owner, the second trust factor of the data requester, and the transaction trust factor corresponding to the current transaction is as follows:

[0034]

[0035]

[0036]

[0037] wherein, is a transaction trust factor, is a first trust factor, is a second trust factor, is a user reputation rate, and are current reputations of a data owner and a data requester, respectively, is a number of all previous transactions of the data owner, then records a number of all previous transactions of the data requester.

[0038] In an embodiment, the storing, by the record manager, of the consensus transaction corresponding data to the blockchain corresponding node comprises:

[0039] packing, by the record manager, the consensus transaction corresponding data into a data block;

[0040] sending the data block to a node in a blockchain network for consensus verification;

[0041] after verification, adding the data block to a tail node of the blockchain network to complete on-chain storage of the data block.

[0042] In addition, to achieve the above object, the present application also provides a data sharing device, which comprises a memory, a processor and a computer program stored in the memory and executable on the processor, and the computer program is configured to implement the steps of the data sharing method as described above.

[0043] In addition, to achieve the above object, the present application also provides a storage medium, which is a computer readable storage medium, and the storage medium stores a computer program, and the computer program is executed by a processor to implement the steps of the data sharing method as described above.

[0044] In addition, to achieve the above object, the present application also provides a computer program product, which comprises a computer program, and the computer program is executed by a processor to implement the steps of the data sharing method as described above.

[0045] The application provides a data sharing method, device, storage medium and computer program product. The application receives a data transaction request of a data requester, analyzes and processes the data transaction request through a committee node, selects data owners participating in the transaction from a block chain, and after receiving a first transaction request sent by the data owners, votes for a transaction corresponding to the first transaction request through an authoritative organization to generate a consensus transaction. Since the consensus transaction is obtained through comprehensive voting based on reputations of the data requester and the data owners, and the reputation is inversely proportional to network activity of the data requester and / or the data owners, a user who attempts to maximize reputation by manipulating the system can be prevented from manipulating the transaction through abnormal operation, the possibility of manipulation of the consensus transaction by other users in the block chain is reduced, the sharing network is prevented from being manipulated by other users during the transaction process, and the security of the data transaction is improved. BRIEF DESCRIPTION OF DRAWINGS

[0046] The accompanying drawings, which are incorporated herein and constitute part of the specification, illustrate embodiments consistent with the application and, together with the description, serve to explain the principles of the application.

[0047] In order to more clearly illustrate the technical solutions in the embodiments of the application or the prior art, the accompanying drawings needed to be used in the embodiments or prior art description will be briefly introduced. Obviously, for those skilled in the art, other drawings can also be obtained based on these drawings without creative labor.

[0048] Figure 1 A flowchart is provided for the data sharing method embodiment one of the application;

[0049] Figure 2 A data request flowchart related to the data sharing method of the application is provided;

[0050] Figure 3 A whole execution flowchart related to the data sharing method of the application is provided;

[0051] Figure 4 A whole system architecture related to the data sharing method of the application is provided;

[0052] Figure 5 A flowchart is provided for the data sharing method embodiment two of the application;

[0053] Figure 6 A module structure of the data sharing device of the embodiment of the application is provided;

[0054] Figure 7 A device structure of a hardware running environment related to the data sharing method in the embodiment of the application is provided.

[0055] The object, functional characteristics and advantages of the present application will be further explained in conjunction with the embodiments, with reference to the accompanying drawings. DETAILED DESCRIPTION

[0056] It should be understood that the specific embodiments described herein are merely intended to explain the technical solutions of the present application, and are not intended to limit the present application.

[0057] In order to better understand the technical solutions of the present application, the following will be described in detail in conjunction with the accompanying drawings and specific embodiments.

[0058] The main solution of the embodiments of the present application is: receiving a data transaction request sent by a data requester;

[0059] Based on the committee node and the data transaction request, selecting data owners participating in the transaction from the blockchain;

[0060] Receiving a first transaction request sent by the data owner, and voting for the transaction corresponding to the first transaction request through an authority to generate a consensus transaction, wherein the consensus transaction is obtained based on the comprehensive voting of the reputation values of the data requester and the data owner, and the reputation value is inversely proportional to the network activity of the data requester and / or the data owner;

[0061] After the execution of the consensus transaction is completed, the data corresponding to the consensus transaction is stored in the node of the blockchain through the record manager.

[0062] Although the blockchain technology has potential in improving security and privacy, the complexity of the consensus algorithm in ensuring the effective verification of the blockchain often leads to major problems such as high energy consumption, weighted voting, high communication cost and delay. In addition, any data sharing network needs to motivate users to participate and encourage them to cooperate. In order to achieve this, a reputation mechanism is usually adopted, but in this case, a selfish user can manipulate the mechanism to benefit himself.

[0063] The application provides a data sharing method, device, storage medium and computer program product. The application receives a data transaction request of a data requester, analyzes and processes the data transaction request through a committee node, selects data owners participating in the transaction from a block chain, receives a first transaction request sent by the data owners, votes for a transaction corresponding to the first transaction request through an authoritative organization to generate a consensus transaction. The consensus transaction is obtained based on comprehensive voting of reputations of the data requester and the data owners, and the reputation is inversely proportional to network activity of the data requester and / or the data owners. The application avoids abnormal operation of a user who tries to maximize reputation by manipulating the system, reduces the possibility of manipulation of the consensus transaction by other users in the block chain, avoids manipulation of a sharing network by other users in the transaction process, and improves the security of the data transaction.

[0064] It should be noted that the execution subject of the embodiment can be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone or the like, or an electronic device, a data sharing device, a transaction manager or the like capable of realizing the above functions. The following takes the transaction manager as an example to describe the embodiment and each of the following embodiments.

[0065] Based on this, the application provides a data sharing method, which is applied to a transaction manager in a data sharing system. The data sharing system further includes a record manager. For details, refer to Figure 1 , Figure 1 The flowchart of the first embodiment of the data sharing method of the application is shown in FIG. 1.

[0066] In the embodiment, the data sharing method includes steps S10-S40.

[0067] In step S10, a data transaction request sent by a data requester is received.

[0068] It should be noted that the data requester can be a user who wants to trade data. The data requester finds the data he / she needs by sending a data transaction request on the block chain.

[0069] It should be noted that the data sharing system is composed of two controllers, a transaction manager and a record manager. The transaction manager plays an intermediary role between all types of users, including data owners, requesters, authorities and decision makers. The transaction manager is mainly used for: 1) receiving data from data owners and preventing suspicious data submission; 2) receiving requests from requesters and ensuring the integrity of transactions between trusted owners and requesters. On the other hand, the record manager interacts with the database and the blockchain, securely receives new data from the owner, and retrieves data for data requesters. Each manager is composed of multiple subparts. The transaction manager is composed of committees, transaction pools and voting processes, while the record manager part is composed of permission handling programs, blockchains and encryption / decryption.

[0070] It should be noted that the data request process is as shown in Figure 2 First, the requester sends a permission verification request, the permission handling program verifies the requester's permission, and when the permission is not passed, the requester is denied access. Then, the requester accesses the encrypted data address in the blockchain, and the record manager retrieves the corresponding data from the database according to the encrypted data address provided by the requester. The retrieved data is all encrypted and can be restored to the original data by performing decryption processing. Encryption processing needs to be ensured throughout the transmission process.

[0071] Step S20, based on the committee nodes and the data transaction request, selecting data owners participating in the transaction from the blockchain;

[0072] It should be noted that the committee nodes can be composed of a group of fixed and trusted nodes, which are generated through some election or selection mechanism. The committee is responsible for performing specific tasks, such as verifying transactions, generating blocks or participating in consensus processes.

[0073] It should be noted that after the transaction manager receives the data transaction request, the committee broadcasts the required data as a message among the data owners on the blockchain. The data owner who meets the requirements and responds first becomes the selected data owner, provides the requested data, and is responsible for generating the corresponding transaction.

[0074] Step S30, receiving the first transaction request sent by the data owner, and voting on the transaction corresponding to the first transaction request through the authority to generate a consensus transaction, wherein the consensus transaction is obtained based on the comprehensive voting of the reputation values of the data requester and the data owner, and the reputation value is inversely proportional to the network activity of the data requester and / or the data owner;

[0075] It should be noted that the data owner sends a first transaction request to the transaction manager when determining that a data transaction is needed, wherein the authority is an external regulatory agency (such as the government, the central bank, the industry association, etc.) that supervises and manages the blockchain project in the alliance chain or private chain scenario, and when the blockchain technology is applied to the regulated fields such as finance, law, etc. These regulatory agencies ensure the compliance of the blockchain project by formulating rules, reviewing transactions, imposing penalties, etc., and are therefore important authorities in the blockchain ecosystem.

[0076] It should be noted that the authority votes on the transaction corresponding to the first transaction request to determine whether to allow it to proceed normally, thereby avoiding the generation of abnormal transactions. The consensus transaction includes transaction data obtained after the authority and other decision makers reach a consensus, and also includes the transaction result corresponding to the determination of whether to proceed with the transaction, wherein the transaction result can be to agree to the transaction or to disagree with the transaction.

[0077] It should be noted that the data requester and the data owner will have a corresponding reputation value. In existing blockchains, a common way is for two users to generate a large number of false transactions in a short period of time to increase their reputation and show that they are active participants on the network. In order to reduce the possibility of such manipulation, we adopt a reputation granting scheme as follows:

[0078]

[0079] wherein M represents the reputation value, is a protection factor, is the number of collaborations between a certain owner and requester within a critical transaction period, which is equivalent to the network activity of the user. Therefore, this formula is set to reflect that the reputation value is inversely proportional to the network activity, is a protection factor, for the initial transactions within P (such as = 1), the user obtains a higher reputation, and as the number of transactions within P increases (for example = 10), the reputation value between any two participants is reduced due to previous transactions, and therefore value can be optimally determined according to the data traffic of a specific application. is the reputation rate.

[0080] It should be noted that the reputation value is also assigned to other users, authorities, and decision makers. Granting reputation means giving certain trust or recognition to these authorities and decision makers. In this case, reputation can be regarded as a standard of evaluation for measuring the performance, professional ability, or integrity of an organization or individual in a particular field. By granting reputation to authorities and decision makers, people can have more confidence in their decisions, suggestions, or actions.

[0081] In an implementation, the step S20 of generating the consensus transaction by the authorities voting on the transaction corresponding to the first transaction request comprises:

[0082] The authorities and the decision maker vote on the transaction corresponding to the first transaction request to obtain voting data;

[0083] It is to be noted that the authorities and the decision maker are pre-selected according to their reputations, and the obligation of the decision maker is to ensure the honest behavior of the authorities by monitoring the activities of the authorities. Similarly, the authorities are responsible for verifying the transaction based on the reputations of the owners and the requesters.

[0084] It is to be noted that in the process of voting, the authorities jointly make decisions, and when the authorities cannot reach a consensus, the decision maker makes a decision on the transaction to determine whether to approve the transaction.

[0085] It is to be noted that the voting data can be the votes for or against by the authorities.

[0086] The voting data is verified by a preset consensus algorithm, and the consensus transaction is generated after the authorities and the decision maker reach a consensus.

[0087] It is to be noted that the preset consensus algorithm is a key step for verifying and confirming the validity and correctness of the data sharing transaction. When the data requester issues a data request or the data owner contributes data, these transactions are first added to the transaction pool. Then, these transactions are verified by the consensus algorithm to ensure the legality and reliability of the transactions.

[0088] In the process of verification, the verification process is guided by trust factors . The security of the transaction is shown, which is composed of three important factors: a transaction trust factor , an owner trust factor and a requester trust factor . When verifying any transaction, these factors are used by the authorities, and after the authorities reach a consensus, the consensus transaction is generated.

[0089] In an implementation, the step of verifying the voting data by the preset consensus algorithm and generating the consensus transaction after the authorities and the decision maker reach a consensus comprises:

[0090] Determining the voting options of the authorities;

[0091] If the number of votes in favor is greater than the number of votes against, it is determined that consensus is reached among the parties in the authority and the decision maker, and a consensus transaction is generated;

[0092] It should be noted that the voting options include votes in favor and votes against. When the number of votes in favor is greater than the number of votes against, it is determined that the transaction is passed, i.e., it is determined that the transaction can be executed. Conversely, when the number of votes in favor is less than the number of votes against, it is determined that the transaction is rejected, i.e., the transaction cannot be executed.

[0093] If the number of votes in favor is equal to the number of votes against, a target trust factor is calculated based on a preset consensus algorithm, the target trust factor including a first trust factor of the data owner, a second trust factor of the data requester, and a transaction trust factor corresponding to the current transaction;

[0094] It should be noted that when the number of votes in favor is equal to the number of votes against, the target trust factor is calculated by the preset consensus algorithm. The target trust factor shows the security of the transaction, which is composed of three important factors: the transaction trust factor , the first trust factor , and the second trust factor .

[0095] In a feasible implementation, the step of calculating the target trust factor based on the preset consensus algorithm includes:

[0096] The target trust factor is calculated based on the preset consensus algorithm, and the calculation formula of the first trust factor of the data owner, the second trust factor of the data requester, and the transaction trust factor corresponding to the current transaction is as follows:

[0097]

[0098]

[0099]

[0100] wherein, is the transaction trust factor, is the first trust factor, is the second trust factor, is the user reputation rate, and are the current reputations of the data owner and the data requester, respectively, is the number of all previous transactions of the data owner, records the number of all previous transactions of the data requester.

[0101] It should be noted that when a certain authority approves a transaction with a lower When a transaction is made with a reputation value of <1), the decision maker will verify such activities to confirm the decision. If there is suspicion of dishonest activities, the authority will be punished by lowering the reputation value. When a certain authority has rejected a transaction with a higher reputation value of >1), a similar process will be taken. Through this process, the decision maker can monitor the verification decisions of each authority and ensure that only honest authorities will be rewarded. >1), a similar process will be taken. Through this process, the decision maker can monitor the verification decisions of each authority and ensure that only honest authorities will be rewarded.

[0102] In another embodiment, considering that the current trust factor is obtained based on static rule calculation, in order to make it dynamic adjustment, we define the current activity of the network , the recent transaction success rate and the number of detected dishonest behaviors , according to the above parameters, the dynamic adjustment coefficient of the owner trust factor and the dynamic adjustment coefficient of the requester trust factor :

[0103]

[0104]

[0105] wherein, and are the benchmark adjustment coefficients of the owner trust factor and the requester trust factor; , and represent the influence degree of activity, transaction success rate and detected dishonest behavior on and respectively; and represent the benchmark values of activity and transaction success rate respectively.

[0106] After calculating and , we can further obtain In the real-time process of dynamic adjustment strategy, the state of the network and the result of the transaction are continuously monitored, and parameters such as , , , and are adjusted regularly to ensure the effectiveness of the dynamic adjustment strategy.

[0107]

[0108]

[0109]

[0110] If it is determined that the transaction trust factor is less than a first preset threshold, a first personnel list corresponding to the yes vote in the voting option and the target trust factor are sent to a leader for the leader to perform prestige punishment on the first personnel list based on the target trust factor, wherein the leader is randomly selected from the parties of the authority;

[0111] It should be noted that the first preset threshold can be 1 or other data, and is not limited in particular. Taking the first preset threshold as 1 as an example, the following steps are executed:

[0112] If the number of yes votes = the number of no votes, execute:

[0113] Leader decision

[0114] If <1, execute:

[0115] Store members who vote yes in a list

[0116] Send the list and to the leader

[0117] If there is any punishment, then:

[0118] Reduce the prestige from the list members.

[0119] If the second trust factor is greater than a second preset threshold, a second personnel list corresponding to the no vote in the voting option and the target trust factor are sent to the leader for the leader to perform prestige punishment on the second personnel list based on the target trust factor;

[0120] It should be noted that the second preset threshold can be 3 or other data, and is not limited in particular. Taking the second preset threshold as 3 as an example, the following steps are executed:

[0121] If >3, execute:

[0122] Store members who vote no in a list

[0123] Send the list and to the leader

[0124] If there is any punishment, then

[0125] Reduce the prestige from the list members.

[0126] After the execution of the prestige punishment is completed, according to the ratio of yes votes and no votes, it is determined that the parties in the authority and the decision maker reach a consensus, and a consensus transaction is generated.

[0127] It should be noted that when the number of votes is the same, the members who vote for or against are punished according to the size of the trust factor, and the reputation value is reduced, so as to reset the proportion of votes for and against. The data sharing system in the application enhances security through two management subparts. In the transaction manager, users must have high reputation to be included in the potential authority group and have the opportunity to become a randomly selected leader. This significantly reduces the possibility of self-attack. Even if there are malicious users in the verification personnel, most of the authority personnel will decide to accept or cancel the transaction. In addition, during the voting process, the trust factor helps to identify the authority personnel with bad behavior. In the record manager, the permission handling program module adds the approved transaction to the user's permission list. Even if the blockchain is attacked and the data address information is accessed, the record manager will cancel the data retrieval of those users who do not have corresponding data IDs in the permission list.

[0128] Specifically, the consensus voting algorithm can execute the following process:

[0129]

[0130] Step S40, after the consensus transaction is executed, the data corresponding to the consensus transaction is stored in the corresponding node of the blockchain through the record manager.

[0131] It should be noted that after the consensus transaction is executed, the transaction data generated by the formula transaction is stored through the record manager, and stored in the corresponding node on the blockchain, so that the transaction can be traced.

[0132] In a possible implementation, the step S40 of storing the data corresponding to the consensus transaction in the corresponding node of the blockchain through the record manager comprises:

[0133] The data corresponding to the consensus transaction is packaged into a data block through the record manager;

[0134] It should be noted that the data block can be in the form of a data package, and packaging the data into a data package facilitates the storage of the data.

[0135] The data block is sent to a node in the blockchain network for consensus verification;

[0136] It should be noted that after the packaging is completed, the data block also needs to be verified by consensus, and the transaction approved by voting through the authority is equivalent to legal authentication. After the authentication is completed, the data block can be stored on the blockchain.

[0137] After verification, the data block is added to the last node of the blockchain network to complete the on-chain storage of the data block.

[0138] It should be noted that the purpose of adding the data block to the end node of the blockchain network is that each new data block contains a reference to the previous block (usually through a hash value), and this chain structure ensures the continuity of data. Adding new blocks to the end makes the entire blockchain a growing chain, ensuring that all transaction records from the genesis block to the current block are continuous and complete.

[0139] Once the data is added to the blockchain, it is almost impossible to tamper with or delete. Because to modify the data of a block, all blocks after the block need to be modified, which is computationally infeasible. Therefore, by continuously adding new blocks to the end, the data tamper resistance is enhanced.

[0140] Specifically, in the transaction manager composition module, the committee is a useful tool to connect data owners and requesters, and the main process of the transaction manager is as shown in Figure 3

[0141] The requester transmits a data request containing specific requirements and types to the transaction manager, and then the committee broadcasts the required data as a message among the data owners.

[0142] The data owner who meets the requirements and responds first becomes the selected data owner, provides the requested data, and is responsible for generating the corresponding transaction.

[0143] Each transaction should contain the encrypted identity of the data owner and the data requester, and give the information of the relevant data storage location. The data storage location will be provided to the corresponding data owner, so that the data can be found faster in future sharing process.

[0144] After verifying the received transaction, the committee will forward such transaction to the voting handler. The voting handler performs the verification process by sending the transaction to the authorities. When the authorities reach a consensus, they may allocate rewards among all participating authorities according to their contributions, while the authorities not participating in any consensus process will not receive rewards. If the voting handler observes dishonest activities between the authorities, the decision maker will verify the response of each authority and verify the previous record in combination with its trust factor. Similarly, for transactions that cannot reach a consensus due to voting differences, the decision maker will make a final decision on whether such transactions should be approved.

[0145] Specifically, as shown in Figure 4 ​As shown, the system architecture in the present application is composed of two controllers, "transaction manager" and "record manager". The transaction manager plays an intermediary role between all types of users, including data owners, requesters, authorities and decision makers. The transaction manager is mainly used for: first, receiving data from data owners and preventing suspicious data submission; second, receiving requests from requesters and ensuring the integrity of transactions between trusted owners and requesters. On the other hand, the record manager interacts with the database and the blockchain, safely receives new data from the owners, and retrieves data for data requesters. Each manager is composed of multiple subparts. The transaction manager is composed of procedures such as committee, transaction pool and voting processing, while the record manager part is composed of permission processing program, blockchain and encryption / decryption.

[0146] In another embodiment, the overall execution algorithm flowchart is as follows:

[0147]

[0148] The present application proposes a data sharing method, device, storage medium and computer program product. The present application receives a data transaction request of a data requester, analyzes and processes the data transaction request through a committee node, selects data owners participating in the transaction from the blockchain, and after receiving a first transaction request sent by the data owners, votes for the transaction corresponding to the first transaction request through an authority to generate a consensus transaction. Because the consensus transaction is obtained by comprehensive voting based on the reputation values of the data requester and the data owners, and the reputation value is inversely proportional to the network activity of the data requester and / or the data owners, the user who tries to maximize the reputation by manipulating the system avoids manipulating the transaction through abnormal operation, reduces the possibility of manipulation of the consensus transaction by other users in the blockchain, avoids being manipulated by other users in the sharing network during the transaction process, and improves the security of the data transaction.

[0149] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as the above embodiment one can refer to the above introduction, and the following will not be repeated. On this basis, please refer to Figure 5 , before the step of obtaining voting data by voting for the transaction corresponding to the first transaction request through an authority and a decision maker, further comprising:

[0150] Step S200, obtaining the number of cooperations and network activity between any data owner and data requester in a preset transaction time period;

[0151] It should be noted that the preset transaction time period can be 1 day, 2 days, etc., and is not limited in detail.

[0152] It should be noted that the number of cooperation times is the number of transactions between the two, and the activity level on the blockchain network.

[0153] Step S210, based on the network activity, the data owner or data requester is calculated, and the user credit rate is obtained;

[0154] It should be noted that the network activity is different, and the user's credit rate is different. The user credit rate can reflect the trust degree of the user in a period of time.

[0155] In one possible implementation, the step S210 of calculating the credit rate of the data owner or data requester based on the network activity to obtain the user credit rate comprises:

[0156] Based on the network activity, the data owner or data requester is calculated, and the user credit rate is obtained, wherein the formula of the user credit rate is as follows:

[0157]

[0158] Wherein, is the network activity, , is a preset network activity threshold, , , The three values of the user credit rate corresponding to different network activities are represented.

[0159] It should be noted that in actual application, the network activity needs to be dynamically adjusted according to the network activity. Specifically, a mapping function from activity to credit can be defined , wherein is the network activity, mainly realizes dynamic credit adjustment. It can be represented as:

[0160]

[0161] When A is lower than a certain threshold , a higher value can be set to encourage users to participate; when A is between and , can be kept at a benchmark value ; when A is higher than , a lower value To avoid over-incentivizing, A will rationally plan based on collected network activity data over a period of time, and set initial goals based on historical data analysis and business needs. and Threshold. It should be set in an area with low network activity, and It should then be set in an area with high network activity.

[0162] In order to avoid Sudden changes in values ​​can affect network stability. This paper uses polynomial interpolation to define the relationship between reputation rate β and network activity A, as shown below:

[0163]

[0164] In practical applications, to avoid Sudden changes in values ​​can affect network stability. This paper addresses this issue by designing network activity values. To credit rating mapping function At that time, a polynomial interpolation method is used for dynamic adjustment, which can be specifically manifested as follows:

[0165] First, set the interpolation conditions: when hour, ;when hour, Then the definition is:

[0166]

[0167] To determine the coefficients and The above two interpolation conditions need to be met. Substituting them, we can obtain:

[0168]

[0169]

[0170] It can be obtained

[0171]

[0172]

[0173] In summary:

[0174]

[0175] Step S220: Calculate the user reputation value based on the user reputation rate and the number of collaborations;

[0176] It should be noted that the user reputation value can be calculated in the following manner:

[0177]

[0178] wherein, is the number of cooperation between a certain owner and requester within a preset transaction period . is a protection factor. For the initial transaction within P (eg = 1), the user gets a higher reputation. As the number of transactions within P increases (eg = 10), the reputation value between any two participants is reduced due to previous transactions, so value can be determined optimally according to the data traffic of a specific application. is the reputation rate.

[0179] Specifically, a prediction model can also be used to obtain the optimal reputation value, and a prediction model is trained based on time series analysis using historical data to predict network activity and user behavior patterns in the future period of time, so as to dynamically adjust the reputation rate or reputation value to adapt to changes in the network environment.

[0180] Step S230, assigning the user reputation value to the data owner and the data requester;

[0181] It should be noted that the user reputation value is assigned to the data owner and the data requester to determine the reputation value of the two parties in the data transaction, so as to comprehensively judge whether to agree to the transaction between them according to the reputation value.

[0182] It should be noted that before the consensus vote is performed, the reputation value of the authority or decision maker can also be awarded through this reputation awarding scheme, so as to determine whether it can become a member of the voting members, thereby increasing the credibility of the voting result.

[0183] The step of voting by the authority and the decision maker on the transaction corresponding to the first transaction request to obtain voting data comprises:

[0184] According to the user reputation value, the authority and the decision maker vote on the transaction corresponding to the first transaction request to obtain voting data.

[0185] It should be noted that after the user reputation value is assigned to the data requester and the data owner, the authority is responsible for verifying the transaction based on the reputation of the owner and the requester, and combining various trust factors to obtain a more accurate voting result.

[0186] In the embodiment, the reputation of each user is granted by the adaptive method, the relationship between the reputation rate β and the network activity A is defined by using the polynomial interpolation, and the reputation value of the user is dynamically adjusted, so as to avoid that other users manipulate the sharing network for their own interests.

[0187] It should be noted that the above examples are only used for understanding the present application and do not constitute a limitation on the data sharing method of the present application. More forms of simple transformation based on the technical concept are within the protection scope of the present application.

[0188] The present application also provides a data sharing device, please refer to Figure 6 , the data sharing device comprises:

[0189] The receiving module 10 is used for receiving the data transaction request sent by the data requester;

[0190] The selection module 20 is used for selecting the data owner participating in the transaction from the blockchain based on the committee node and the data transaction request;

[0191] The voting module 30 is used for receiving the first transaction request sent by the data owner, and voting for the transaction corresponding to the first transaction request through the authority, to generate a consensus transaction, wherein the consensus transaction is obtained by comprehensive voting based on the reputation values of the data requester and the data owner, and the reputation value is inversely proportional to the network activity of the data requester and / or the data owner;

[0192] The storage module 40 is used for storing the data corresponding to the consensus transaction in the corresponding node of the blockchain through the record manager after the execution of the consensus transaction is completed.

[0193] Optionally, the voting module comprises:

[0194] The voting unit is used for voting for the transaction corresponding to the first transaction request through the authority and the decision maker, to obtain voting data;

[0195] The processing unit is used for verifying and processing the voting data through a preset consensus algorithm, and generating a consensus transaction after determining that all parties in the authority and the decision maker reach a consensus.

[0196] Optionally, the voting module further comprises:

[0197] The acquisition unit is used for acquiring the number of cooperations and the network activity between any data owner and data requester within a preset transaction time period;

[0198] The first calculation unit is used for calculating the reputation rate of the data owner or the data requester based on the network activity, to obtain the user reputation rate.

[0199] a second calculation unit, configured to calculate a user reputation value based on the user reputation rate and the number of cooperation times;

[0200] an assignment unit, configured to assign the user reputation value to the data owner and the data requester.

[0201] Optionally, the first calculation unit comprises:

[0202] a first calculation sub-unit, configured to calculate a user reputation rate based on the network activity, to obtain the user reputation rate, wherein the user reputation rate is calculated according to the following formula:

[0203]

[0204] wherein, is the network activity, , is a preset network activity threshold, , , represents three values of the user reputation rate corresponding to different network activities.

[0205] Optionally, the processing unit comprises:

[0206] a first determination sub-unit, configured to determine voting options of each party in the authority;

[0207] a second determination sub-unit, configured to determine that each party in the authority and the decision maker reach a consensus and generate a consensus transaction if the number of favorable votes in the voting options is greater than the number of unfavorable votes;

[0208] a second calculation sub-unit, configured to calculate a target trust factor based on a preset consensus algorithm if the number of favorable votes in the voting options is equal to the number of unfavorable votes, wherein the target trust factor comprises a first trust factor of the data owner, a second trust factor of the data requester, and a transaction trust factor corresponding to the current transaction;

[0209] a first sending sub-unit, configured to send a first personnel list corresponding to the favorable votes in the voting options and the target trust factor to a leader for prestige punishment on the first personnel list based on the target trust factor if it is determined that the transaction trust factor is less than a first preset threshold, wherein the leader is randomly selected from each party in the authority;

[0210] a second sending subunit, configured to send, if the second trust factor is greater than a second preset threshold, a second person list corresponding to an opposing vote in the voting option and the target trust factor to a leader, so that the leader performs reputation punishment on the second person list based on the target trust factor;

[0211] a generating subunit, configured to determine, after the reputation punishment is executed, that all parties in an authority and a decision maker reach a consensus according to a ratio of the votes in favor and the votes against, and generate a consensus transaction.

[0212] Optionally, the second calculating subunit comprises:

[0213] a calculating component, configured to calculate the target trust factor based on a preset consensus algorithm, wherein a calculation formula of the first trust factor of the data owner, the second trust factor of the data requester and a transaction trust factor corresponding to a current transaction is as follows:

[0214]

[0215]

[0216]

[0217] wherein, is the transaction trust factor, is the first trust factor, is the second trust factor, is a user reputation rate, and are current reputations of the data owner and the data requester respectively, is a number of all previous transactions of the data owner, records a number of all previous transactions of the data requester.

[0218] Optionally, the storage module comprises:

[0219] a packing unit, configured to pack data corresponding to the consensus transaction into a data block by the record manager;

[0220] a consensus verification unit, configured to send the data block to a node in a block chain network for consensus verification;

[0221] an adding unit, configured to add the data block to a tail node of the block chain network after the verification is passed, so as to complete on-chain storage of the data block.

[0222] The data sharing device provided in the present application adopts the data sharing method in the above embodiments, and can solve the technical problem of data sharing. Compared with the prior art, the data sharing device provided in the present application has the same beneficial effects as the data sharing method provided in the above embodiments, and other technical features in the data sharing device are the same as the features disclosed in the above embodiments, which will not be repeated here.

[0223] The present application provides a data sharing device, comprising: at least one processor; and a memory connected with the at least one processor in communication; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the data sharing method in the above embodiment one.

[0224] Reference will be made to the following description of the embodiments of the present application, taken in conjunction with the accompanying drawings, in which Figure 5 which shows a structural schematic diagram of a data sharing device suitable for implementing the embodiments of the present application. The data sharing device in the embodiments of the present application can include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (Personal Digital Assistant), PADs (Portable Application Description), PMPs (Portable Media Player), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like. Figure 5 The data sharing device shown is only an example, and should not bring any limitation to the functions and use range of the embodiments of the present application.

[0225] As Figure 5As shown, the data sharing device can include a processing apparatus 1001 (e.g., a central processing unit, a graphics processing unit, etc.) that can perform various appropriate actions and processes according to programs stored in a read only memory (ROM) 1002 or loaded from a storage apparatus 1003 into a random access memory (RAM) 1004. Various programs and data required for operation of the data sharing device are also stored in the RAM 1004. The processing apparatus 1001, the ROM 1002, and the RAM 1004 are connected to each other by a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: input apparatus 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output apparatus 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; the storage apparatus 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication apparatus 1009. The communication apparatus 1009 can allow the data sharing device to communicate wirelessly or by wire with other devices to exchange data. Although the data sharing device having various systems is shown in the figure, it should be understood that all of the shown systems are not required to be implemented or possessed. More or less systems can be alternatively implemented or possessed.

[0226] In particular, the processes described above with reference to the flowcharts can be implemented as computer software programs according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a computer readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network by a communication apparatus, or installed from the storage apparatus 1003, or installed from the ROM 1002. When the computer program is executed by the processing apparatus 1001, the above-mentioned functions defined in the methods of embodiments of the present disclosure are performed.

[0227] The data sharing device provided by the present disclosure adopts the data sharing method in the above-mentioned embodiments, and can solve the technical problem of data sharing. Compared with the prior art, the data sharing device provided by the present disclosure has the same beneficial effects as the data sharing method provided by the above-mentioned embodiments, and other technical features in the data sharing device are the same as the features disclosed in the above-mentioned embodiments, which will not be repeated here.

[0228] It should be understood that various parts of the present application can be realized in hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0229] The above description is merely that of a specific implementation of the present application, and the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical range disclosed by the present application, and all such changes or replacements should be encompassed within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

[0230] The present application provides a computer readable storage medium having stored thereon computer readable program instructions (i.e., a computer program) for performing the data sharing method in the above embodiments.

[0231] The computer readable storage medium provided by the present application may, for example, be a U disk, but is not limited to an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, system, or device, or any combination thereof. More specific examples of the computer readable storage medium can include, but are not limited to, an electrical connection having one or more conductive wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present embodiment, the computer readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system, or device. The program code contained on the computer readable storage medium can be transmitted in any suitable medium, including but not limited to electrical wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0232] The above computer readable storage medium can be contained in the data sharing device; or can exist separately and not be assembled into the data sharing device.

[0233] The above computer readable storage medium carries one or more programs, which, when executed by the data sharing device, cause the data sharing device to:

[0234] receive a data transaction request sent by a data requester;

[0235] selecting, from the blockchain, data owners participating in the transaction based on the committee nodes and the data transaction request;

[0236] receiving a first transaction request sent by the data owners, and voting for a transaction corresponding to the first transaction request through an authority to generate a consensus transaction, wherein the consensus transaction is obtained based on comprehensive voting of reputations of the data requester and the data owners, and the reputation is inversely proportional to network activity of the data requester and / or the data owners;

[0237] storing, through the record manager, data corresponding to the consensus transaction in a node of the blockchain after the consensus transaction is executed.

[0238] Computer program code for carrying out operations of the present application can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0239] The computer program instructions can also be loaded onto a computer or other programmable information processing apparatus to cause a series of operations to be performed on the computer or other programmable information processing apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable information processing apparatus implement the functions / acts specified in the flowchart and / or block diagram block or blocks.

[0240] The modules described in the embodiments of the present application can be implemented in the form of software or in the form of hardware. In some cases, the name of the module does not constitute a limitation on the module itself.

[0241] The computer readable storage medium provided by the present application is a computer readable storage medium, which stores computer readable program instructions (i.e. computer programs) for executing the above-mentioned data sharing method, and can solve the technical problem of data sharing. Compared with the prior art, the computer readable storage medium provided by the present application has the same beneficial effects as the data sharing method provided by the above-mentioned embodiments, which will not be repeated here.

[0242] The present application also provides a computer program product, comprising a computer program, which is executed by a processor to realize the steps of the data sharing method as described above.

[0243] The computer program product provided by the present application can solve the technical problem of data sharing. Compared with the prior art, the computer program product provided by the present application has the same beneficial effects as the data sharing method provided by the above-mentioned embodiments, which will not be repeated here.

[0244] The above only describes some embodiments of the present application, and does not limit the patent scope of the present application. Any equivalent structural transformation, direct / indirect application in other related technical fields based on the technical concept of the present application, and the contents of the specification and drawings are included in the patent protection scope of the present application.

Claims

1. A data sharing method, characterized by, A transaction manager applied to a data sharing system, the data sharing system further comprising a record manager, the method comprising: receiving a data transaction request sent by a data requester; selecting data owners participating in a transaction from a blockchain based on committee nodes and the data transaction request; receiving a first transaction request sent by the data owners, and voting on a transaction corresponding to the first transaction request through an authority to generate a consensus transaction, wherein the consensus transaction is obtained based on comprehensive voting of reputation values of the data requester and the data owners, and the reputation value is calculated based on a user reputation rate and a number of collaborations of a user, and the user reputation rate is dynamically adjusted based on a network activity of the user and a preset mapping function, and the formula of the user reputation rate is as follows: wherein, represents a reputation value, is the number of collaborations between a certain owner and a requester within a preset transaction period, is a reputation rate; The reputation value is inversely proportional to the network activity of the data requester and / or the data owner, the reputation value is calculated based on a user reputation rate and a number of collaborations of a user, the user reputation rate is dynamically adjusted based on a network activity of the user and a preset mapping function, and the formula of the user reputation rate is as follows: wherein, is the network activity, , is a preset network activity threshold, , , represent three values of the corresponding user reputation rate under different network activities. The number of collaborations is the number of collaborations of the data requester and the data owner within a preset time, and the user includes the data owner and the data requester; After the consensus transaction is executed, the record manager stores the data corresponding to the consensus transaction in the corresponding node of the blockchain.

2. The method of claim 1, wherein, The step of voting on the transaction corresponding to the first transaction request through the authority to generate a consensus transaction comprises: Voting on the transaction corresponding to the first transaction request through the authority and the decision maker to obtain voting data; verifying the voting data through a preset consensus algorithm, and generating a consensus transaction after determining that the parties in the authority and the decision maker reach a consensus.

3. The method of claim 2, wherein, Before the step of voting on the transaction corresponding to the first transaction request through the authority and the decision maker to obtain voting data, further comprising: obtaining the number of collaborations and the network activity between any data owner and data requester within a preset transaction period; calculating the reputation rate of the data owner or the data requester based on the network activity to obtain a user reputation rate; calculating a user reputation value based on the user reputation rate and the number of collaborations; assigning the user reputation value to the data owner and the data requester; The step of voting on the transaction corresponding to the first transaction request through the authority and the decision maker to obtain voting data comprises: According to the user reputation value, voting on the transaction corresponding to the first transaction request through the authority and the decision maker to obtain voting data.

4. The method of claim 2, wherein, The step of verifying the voting data through a preset consensus algorithm, and generating a consensus transaction after determining that the parties in the authority and the decision maker reach a consensus, comprises: determining the voting options of the parties in the authority; if the number of votes in favor is greater than the number of votes against in the voting options, it is determined that the parties in the authority and the decision maker reach a consensus, and a consensus transaction is generated; If the number of votes in favor is equal to the number of votes against in the voting options, a target trust factor is calculated based on a preset consensus algorithm, the target trust factor including a first trust factor of the data owner, a second trust factor of the data requester, and a transaction trust factor corresponding to a current transaction; If it is determined that the transaction trust factor is less than a first preset threshold, a first personnel list corresponding to the votes in favor in the voting options and the target trust factor are sent to a leader for the leader to perform prestige punishment on the first personnel list based on the target trust factor, wherein the leader is randomly selected from parties in an authority institution; If the second trust factor is greater than a second preset threshold, a second personnel list corresponding to the votes against in the voting options and the target trust factor are sent to the leader for the leader to perform prestige punishment on the second personnel list based on the target trust factor; After the execution of the prestige punishment is completed, it is determined that the parties in the authority institution and a decision maker reach a consensus to generate a consensus transaction according to the proportion of the votes in favor and the votes against.

5. The method of claim 4, wherein, The step of calculating the target trust factor based on the preset consensus algorithm includes: The target trust factor is calculated based on the preset consensus algorithm, wherein the calculation formula of the first trust factor of the data owner, the second trust factor of the data requester, and the transaction trust factor corresponding to the current transaction is as follows: wherein, is a transaction trust factor, is a first trust factor, is a second trust factor, is a user reputation rate, and are current reputations of the data owner and the data requester, respectively, is a number of all previous transactions of the data owner, then records a number of all previous transactions of the data requester.

6. The method of claim 1, wherein, The step of storing the data corresponding to the consensus transaction in the node of the block chain by the record manager includes: The record manager packages the data corresponding to the consensus transaction into a data block; The data block is sent to a node in a block chain network for consensus verification; After the verification is passed, the data block is added to a tail node of the block chain network to complete the on-chain storage of the data block.

7. A data sharing device, characterized by, The device includes a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the data sharing method according to any one of claims 1 to 6.

8. A storage medium, characterized by The storage medium is a computer readable storage medium, and the storage medium stores a computer program, the computer program being executed by a processor to implement the steps of the data sharing method according to any one of claims 1 to 6.

9. A computer program product, characterised in that, The computer program product includes a computer program, the computer program being executed by a processor to implement the steps of the data sharing method according to any one of claims 1 to 6.

Images