Distributed data transaction method and system

By introducing distributed data trading methods and systems into the data trading market, using two-way auction mechanism and blockchain, the credit value of data providers and multiple rounds of quotations are solved, and the trust crisis of data trading market in the existing technology is solved and The data leakage problem has achieved the security and efficiency balance of data transactions.

CN113744051BActive Publication Date: 2024-11-08BEIJING UNIV OF POSTS & TELECOMM +2
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110839261.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-07-23
Publication Date
2024-11-08
Estimated Expiration
2041-07-23

AI Technical Summary

Technical Problem

The existing data trading market lacks applicable trading rules, centralized solutions have a trust crisis and data leakage risk, and the existing two-way auction mechanism fails to effectively analyze the quotation strategies of buyers and sellers and consider the impact of different payment rules on the matching algorithm, neglecting The utility of data consumers and providers.

Method used

Using distributed data trading methods and systems, a data trading framework is constructed based on a two-way auction mechanism and blockchain. By calculating the reputation value of the data provider, multiple rounds of quotation and transaction volume calculations are performed, combining data consumers and providers. Quotation, form a transaction plan that meets the expectations of both parties, and record the transaction plan on the blockchain.

Benefits of technology

It realizes the protection of user data privacy during data transactions under data agent intermediary, ensures the security and balance of benefits of data transactions, and realizes distributed data transactions through blockchain, meeting the expectations of data consumers and providers. , improve market balance and social welfare.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113744051B_ABST
    Figure CN113744051B_ABST
Patent Text Reader

Abstract

The present disclosure provides a distributed data trading method and system; the method includes: constructing a distributed data trading framework based on a two-way auction mechanism and blockchain, calculating the reputation value based on the previous transaction records of the data provider, comprehensively considering the quotations of data consumers and data providers, and finally obtaining a trading plan that meets the expectations of data consumers and data providers after multiple rounds of quotations and calculation of transaction volumes under the mediation of data agents. The data privacy of users in the auction process is guaranteed, distributed data transactions are realized through blockchain, and the security of data transactions is guaranteed.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the technical field of data transaction, and in particular to a distributed data transaction method and system. Background Art

[0002] Existing data trading markets, such as Infochimps, Datacoup, and Microsoft Azure Marketplace, are still in their infancy and lack applicable trading rules. Moreover, from an economic perspective, market organizers are selfish and pursue the maximization of their own interests rather than the overall utility of the system. Existing frameworks generally use data agents as intermediaries to implement data transactions, that is, data agents purchase data from data providers and then sell it to data consumers. Due to the trust crisis of agents and the low replication cost of data products, these centralized solutions will bring challenges in data leakage. Double auctions are a "many-to-many market structure" in which neither the buyer nor the seller has an advantage over one party, but a mutually equal supply and demand relationship. The buyer is the data consumer, the seller is the data provider, and the auction host is the data agent. The auction host is responsible for collecting the quotation information and data information of the buyer and seller, matching them according to the data matching rules, and finally determining the resource payment price. Summary of the invention

[0003] In view of this, the purpose of the present disclosure is to provide a distributed data transaction method and system.

[0004] Based on the above objectives, the present disclosure provides a distributed data transaction method, including:

[0005] S1. Obtain the transaction records of the data provider, and calculate the reputation value of the data provider according to the transaction records;

[0006] S2. The data provider and the data consumer respectively calculate quotations according to the reputation value and send the quotations to the data agent;

[0007] S3, the data agent calculates the transaction data volume according to the quotation, and sends the transaction data volume to the data provider and the data consumer;

[0008] S4. According to the data volume of the transaction, the data provider and the data consumer respectively calculate new quotations and transmit them to the data agent;

[0009] S5, looping through steps S3-S4, in response to determining that the change in the amount of data of the transaction meets a preset threshold, obtaining a transaction plan, and recording the transaction plan on the blockchain;

[0010] S6. According to the transaction plan, the data provider sends the data product to the data consumer to complete the transaction.

[0011] Based on the same inventive concept, the present disclosure also provides a distributed data transaction system, including: a data provider, a data consumer and a data agent, wherein:

[0012] Obtaining transaction records of a data provider, and calculating the reputation value of the data provider based on the transaction records;

[0013] The data provider and the data consumer respectively calculate quotations according to the reputation value and send the quotations to the data agent;

[0014] The data agent calculates the transaction data volume according to the quotation, and sends the transaction data volume to the data provider and the data consumer;

[0015] According to the data volume of the transaction, the data provider and the data consumer respectively calculate new quotes and transmit them to the data agent;

[0016] In response to determining that a change in the amount of data of the transaction calculated by submitting new quotations multiple times satisfies a preset threshold, a transaction plan is obtained, and the transaction plan is recorded on the blockchain;

[0017] According to the transaction plan, the data provider sends the data product to the data consumer to complete the transaction.

[0018] From the above, it can be seen that the distributed data trading method and system provided by the present disclosure builds a distributed data trading framework based on the two-way auction mechanism and blockchain, calculates the reputation value according to the previous transaction records of the data provider, comprehensively considers the quotations of data consumers and data providers, and finally obtains a trading plan that meets the expectations of data consumers and data providers after multiple rounds of quotations and calculation of transaction volume under the mediation of data agents, and stores the trading plan on the blockchain. The data privacy of users in the auction process is guaranteed, distributed data transactions are realized through blockchain, and the security of data transactions is guaranteed. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the present disclosure or related technologies, the drawings required for use in the embodiments or related technical descriptions are briefly introduced below. Obviously, the drawings described below are only embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0020] Figure 1 This is a flow chart of a distributed data transaction method according to an embodiment of the present disclosure;

[0021] Figure 2 A flow chart of a double auction method according to an embodiment of the present disclosure;

[0022] Figure 3 A schematic diagram of a distributed data transaction system according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0023] In order to make the objectives, technical solutions and advantages of the present disclosure more clearly understood, the present disclosure is further described in detail below in combination with specific embodiments and with reference to the accompanying drawings.

[0024] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present disclosure should be understood by people with ordinary skills in the field to which the present disclosure belongs. The "first", "second" and similar words used in the embodiments of the present disclosure do not indicate any order, quantity or importance, but are only used to distinguish different components. "Include" or "comprising" and similar words mean that the elements or objects appearing before the word cover the elements or objects listed after the word and their equivalents, without excluding other elements or objects.

[0025] As described in the background technology section, existing data trading solutions are still difficult to meet the needs of data trading. In the process of implementing the present disclosure, the applicant found that the existing data trading solutions based on the single-round two-way auction mechanism did not analyze the bidding strategies of the buyer and seller. The data trading solutions based on the multi-round two-way auction mechanism also only studied the bidding adjustment strategies of the buyer or seller, but did not consider how they can adjust their bids at the same time before joining the next round of auctions, nor did they consider the impact of different payment rules on the matching algorithm. At the same time, the current data trading platforms have the following main problems in data trading: (1) The transaction process mostly considers its own utility, ignoring the utility of data consumers and data providers. (2) This centralized management solution, on the one hand, is very easy to suffer from single-point attacks, thereby leaking users' privacy information. On the other hand, due to the low replication cost of data products, the cost of data agents themselves doing evil is extremely low, and it is easy to have the risk of data agents leaking data themselves.

[0026] In view of this, the present disclosure provides a distributed data transaction solution. Specifically, a distributed data transaction framework is first constructed based on blockchain, which includes three entities: data provider (DP), data consumer (DC) and data agent (DA). Then, the initial transaction quotation is calculated considering the reputation, and the above quotation is optimized by proposing a two-way auction mechanism. Finally, a transaction plan that meets the expectations of data consumers and data providers is obtained, and the transaction plan and transaction records are stored on the blockchain.

[0027] It can be seen that the distributed data trading scheme disclosed in this disclosure builds a distributed data trading framework based on the two-way auction mechanism and blockchain, calculates the reputation value based on the previous transaction records of the data provider, comprehensively considers the quotations of data consumers and data providers, and finally obtains a trading scheme that meets the expectations of data consumers and data providers after multiple rounds of quotations and calculation of transaction volume under the mediation of data agents, and stores the trading scheme and transaction records on the blockchain. The data privacy of users in the auction process is guaranteed, distributed data transactions are realized through blockchain, and the security of data transactions is guaranteed.

[0028] The technical solutions of one or more embodiments of the present disclosure are described in detail below through specific examples.

[0029] refer to Figure 1 The distributed data transaction method of an embodiment of the present disclosure includes the following steps:

[0030] Step S101: Acquire transaction records of a data provider, and calculate the reputation value of the data provider based on the transaction records.

[0031] In this embodiment, the data agent DA is the organizer of data transactions and is responsible for the transmission of some information during the data transaction process. At the same time, it acts as an auctioneer in the two-way auction mechanism. Each DA is responsible for the transaction of a certain type of data. For example, some DAs are responsible for the transaction of IoT data, and some DAs are responsible for the transaction of Internet data. In the consortium blockchain, DA acts as a selected node to verify the transaction. The data provider DP collects data generated from various sources (such as sensors, mobile devices, Internet, etc.), which contain certain attributes. The data consumer DC is an end user who purchases data and has certain attribute requirements for the data. There are no less than one data provider DP, data consumer DC and data agent DA. In the initial preparation stage, DP and DC use valid identity certificates (such as resident ID cards, business licenses, etc.) to register with DA as legal entities, and a pair of keys including public and private keys will be assigned to them. DP and DC use private keys to generate wallet addresses to participate in data transactions. Subsequently, DP and DC send transaction requests to the corresponding DA according to the type of data. DP's request includes the quantity and attribute information of its data, and DC's request includes its attribute requirements.

[0032] In this step, reputation is used to describe the credibility of DP. The higher the data quality of the data products provided by DP, the more stable the data transmission, the better the trust of DP, and the higher the corresponding reputation. The reputation model is established through the evaluation of DP by DC after the transaction is completed. The construction of the model takes into account data quality and data transmission efficiency. The data purchased by DC is mainly used for data mining and machine learning. The higher the data quality, the better the trained model.

[0033] Step S102: The data provider and the data consumer respectively calculate quotations according to the reputation value and send the quotations to the data agent.

[0034] Step S103: The data agent calculates the transaction data volume according to the quotation, and sends the transaction data volume to the data provider and the data consumer.

[0035] Step S104: According to the data volume of the transaction, the data provider and the data consumer respectively calculate new quotations and transmit them to the data agent.

[0036] Step S105, looping through steps S103-S104, in response to determining that the change in the amount of data of the transaction meets a preset threshold, obtaining a transaction plan, and recording the transaction plan on the blockchain.

[0037] In this embodiment, there can be more than one DP, DC and DA, and there is a set of DA, denoted as A, a k ∈A, 1≤k≤K. Over a period of time, a k Collect data transaction requests of DP and DC. Assume that P and C represent the set of DP and DC respectively. P contains J DPs, p j ∈P, 1≤j≤J, p j To a k Submit its data attribute collection and data volume C contains 1 DCs, c i ∈C, 1≤i≤I, c i To a k Submit its attribute requirement set In fully satisfying c i When the attribute is required, c i The maximum data volume required is The minimum requirement is

[0038] After receiving the attribute requirements of DC, DP provides corresponding data products for each DC. The attributes of the data products are the intersection of the attributes that DP can provide and the attribute requirements of DC. j will be c i Provide data products PC j,i , its attribute set is M j,i ,

[0039] c i The satisfaction function can be expressed as:

[0040] where δ i Indicates ci Personal preference, 0<δ i ≤1, high preference indicates high demand for data services, such as people who travel frequently care more about weather services than people who work, which can be defined by habits, needs, etc. i Indicates the remaining DC pairs c i The impact of β i,j Display data product PC j,i C i The availability is calculated as follows:

[0041]

[0042] Among them, θ i It is c i The threshold of and is set based on experience. j,i Indicates p j C i The reputation value of is calculated by the reputation value model introduced later. i,j Indicates c i From p j The amount of data purchased.

[0043] p j The cost function can be expressed as:

[0044] Among them, y j,i Indicates p j Sell ​​to c i The amount of data. and Represents a cost parameter.

[0045] Because DC wants to maximize satisfaction, while DP tries to minimize cost. Therefore, DA, as a data agent, needs to meet the needs of both parties as much as possible. From a social perspective, data trading should maximize social welfare and achieve effective market equilibrium. DA is committed to solving the problem of maximizing social welfare (called SW) to match data trading requests from DC and DP. The objective function of the social welfare problem can be expressed as:

[0046]

[0047]

[0048] y j,i ≤N j , 1≤j≤J,

[0049] x i,j =y j,i , 1≤i≤I, 1≤j≤J,

[0050] y j,i ≥0,1≤j≤J

[0051] SW is strictly concave with tight convex constraints, so there is a unique optimal solution under the Karush-Kuhn-Tucker (KKT) condition. By substituting the known conditions, we get the Lagrangian function L1:

[0052]

[0053] in, φ i , γ i,j , η i,j and κ i,j The Lagrange multipliers representing the constraints are in the form of vectors φ. γ, η and κ. From the perspective of stationary conditions, the optimal solution of SW satisfies the following conditions:

[0054]

[0055]

[0056] In order to solve SW, DA needs to know the real and complete information of DC and DP, such as DC's personal preferences, the amount of data DC wants to buy, DP's cost parameters, etc. This information may leak the personal privacy of DP and DC, so DP and DC may be unwilling to provide this information. In order to solve this problem, DA acts as an auctioneer. i To a k Submit Quote B i , p j To a k Submit a Quote j ,

[0057] During the repeated bid adjustment (auction) process of the transaction, DC will solve the data purchase problem (DB) to determine the optimal auction price. DB is defined as follows:

[0058]

[0059] Where pay(B i ) is c i The payment function.

[0060] DP will solve the data selling problem (DS) to determine the optimal auction price. DS is defined as follows:

[0061]

[0062] where re(Dj ) is p j The reward function of .

[0063] After receiving the quotations from DP and DC, a k The following optimal data transaction allocation problem (DA) will be solved to calculate the data transaction volume:

[0064]

[0065]

[0066] y j,i ≤N j , 1≤j≤J,

[0067] x i,j =y j,i , 1≤i≤I, 1≤j≤J,

[0068] y j,i ≥0, 1≤j≤J.

[0069] Among them, DA and SW have the same constraints, so DA is also a strictly concave problem, and there is a unique optimal solution. Substituting the known conditions, we get the following Lagrangian function L2:

[0070]

[0071] in, and Applying the stationary condition (the first-order derivative is 0) yields:

[0072]

[0073]

[0074] In order to ensure that DA and SW have the same optimal solution, it is necessary to ensure that: and Therefore, combining the two Lagrangian functions of this embodiment, we can obtain:

[0075]

[0076]

[0077] That is, DC i and DP j You can follow b i,j and d j,i Submit a quote in the form.

[0078] in,

[0079] Step S106: According to the transaction plan, the data provider sends the data product to the data consumer to complete the transaction.

[0080] In this step, each entity DP and DC has its own account and wallet. The account is used to store transaction records. The wallet is used to manage the digital currency in the account. After the transaction is completed, DP and DC use the wallet to receive / pay digital currency. Through the Byzantine Fault Tolerance (PBFT) mechanism, at least 1 / 3 of the DAs confirm the transaction to reach a consensus.

[0081] As an optional embodiment, the distributed data transaction method in the above embodiment may further include the following steps:

[0082] Step S107: The data consumer sends the transaction record and the evaluation of the data provider to the data agent after being digitally signed.

[0083] Step S108: The data provider checks and digitally signs the data and then sends it back to the data agent.

[0084] Step S109: The data agent packages the transaction records and stores the packaged transaction records on the blockchain.

[0085] In this step, the transaction records stored in the blockchain can be used as the basis for calculating the reputation value in future transactions.

[0086] In some embodiments, reference Figure 2 , the double auction step S105 in the above embodiment may further include the following steps:

[0087] Step S201: According to the quotation of the data consumer B 1 and the data provider's quote D 1 , the data agent calculates the data transaction volume X of the data consumer 1 and the data transaction volume Y of the data provider 1 , and the X 1 , Y 1 Sent to the data consumer and the data provider.

[0088] Step S202: According to the X 1 , Y 1 , the data consumer and the data provider respectively calculate the corresponding quote B 2 , D 2 , and the B 2 , D 2 Send to the data agent to calculate X 2 , Y 2 .

[0089] Step S203, repeat the above steps to obtain B n , D n , X n and Y n , in response to determining B n satisfy D n satisfy The B n , D n , X n and Y n As the output of the transaction plan, σ, ε are preset thresholds, n is an integer greater than 1, and B n is the final quotation of the data consumer, D n is the final quotation of the data provider, X n is the final data transaction volume of the data consumer, Y n is the final data transaction volume of the data provider.

[0090] In this step, B n and D n The price difference between them is used as the reward of DA, and the two thresholds σ and ε can be determined according to the actual situation. For the case of multiple DPs, DCs and DAs, the corresponding B i n satisfy D j n satisfy Output corresponding to B i n , D j n , X i n and Y j n .

[0091] In some embodiments, calculating the reputation value of the data provider based on the transaction record includes: determining a first reputation value of the data provider based on the information entropy, data transmission efficiency, data transmission speed, unit data transmission fee and network congestion status contained in the data in the transaction record, and using the first reputation value of the data provider as the reputation value of the data provider.

[0092] Information entropy can be used to measure the quality of data. At the same time, the efficiency of data transmission is related to the speed and cost of data transmission. As an optional embodiment, for the reputation value in the above embodiment, the following model can be established to determine the first reputation value of the DP according to the following expression, and the first reputation value of the DP is used as the reputation value of the DP:

[0093]

[0094]

[0095]

[0096]

[0097] Among them, DP, DC and DA are at least one. When DP, DC and DA are extended to multiple data providers, data consumers and data agents, c i represents the i-th DC, I is an integer greater than 1, representing the number of DCs, 1≤i≤I; p j represents the jth DP, J is an integer greater than 1, representing the number of DPs, 1≤j≤J; q j,i Indicates p j C i Reputation value; H j,i Indicates c i From p j The information entropy contained in the data you want to purchase; It is a parameter used to adjust the data quality or the emphasis of data transmission; j,i Indicates p j to c i Data transmission efficiency; i,j Indicates data transmission speed; f i,j Indicates the transmission cost per unit of data; C i,j is a constant, indicating the congestion status of the network; dte j,i Represents the mapping w j,i The result is (0-1).

[0098] In some embodiments, the reputation value further includes: determining a second reputation value of the data provider according to the first reputation value and the time of historical transactions in the transaction record, and using the second reputation value of the data provider as the reputation value of the data provider.

[0099] c i It is possible that multiple data transactions have been carried out. i We will consider DPs with good reputation among those we have traded with before, and c i Will consider p who has recently conducted transactions and has a higher reputation j , so p j There will be cumulative reputation, and the longer the transaction time is, the smaller the impact on the current reputation value. j T transactions have been made, 1≤t≤T, affecting the parameter θ t =zT-t , z∈(0,1), the larger the t is, the closer it is to the current transaction, and the larger the influencing parameter is. Considering the time factor, the second reputation value of the DP is determined according to the first reputation value and the time of the historical transaction, and the second reputation value of the DP is used as the reputation value of the DP, wherein the time of the historical transaction can be obtained from the transaction record, and the second reputation value is determined according to the following expression:

[0100]

[0101]

[0102]

[0103] Furthermore, in some embodiments, the evaluation of other DCs may also affect c i P j evaluation, and with c i The more similar the attribute requirements are, the greater the impact of the evaluation. j The indirect reputation value can be expressed as:

[0104]

[0105]

[0106]

[0107] in, Indicates indirect reputation value; dte ind j,i Represents the mapping w in the indirect reputation value j,i The result of (0-1); i,k Indicates c i and c k similarity.

[0108] Combined with c in this embodiment i P j The direct evaluation of the second reputation value and p j The indirect reputation value of the final third reputation value model can be expressed as:

[0109]

[0110]

[0111]

[0112] in Indicates the final reputation value; Represents the mapping w in the final reputation value j,iThe result is (0-1).

[0113] It can be seen that in one or more embodiments of this specification, a distributed data transaction framework is constructed based on blockchain, and the framework includes three entities: data provider (DP), data consumer (DC) and data agent (DA). DA is the organizer of data transactions and is responsible for the transmission of some information in the data transaction process. At the same time, it acts as an auctioneer in the double auction mechanism. In the blockchain, DA acts as a selected node to verify the transaction. DP collects data generated from various sources (such as sensors, mobile devices, Internet, etc.), which contain certain attributes. DCs are end users who purchase data and have certain attribute requirements for the data. In the data transaction flow process, the reputation value is calculated, the double auction mechanism and the transaction records are packaged and produced. Considering multi-dimensional factors, the cost function of the data provider and the satisfaction function of the data consumer are established to construct an optimization function with the goal of maximizing social benefits. By solving the optimization function, the quotations of suitable data providers and data consumers are obtained, and finally a transaction plan that meets the expectations of data consumers and data providers is obtained, and the transaction plan and transaction records are stored on the blockchain. The data privacy of users and the benefit balance between buyers and sellers in the auction process are guaranteed, and distributed data transactions are realized through blockchain, and the security of data transactions is guaranteed.

[0114] It should be noted that the method of the embodiment of the present disclosure can be performed by a single device, such as a computer or a server. The method of the present embodiment can also be applied in a distributed scenario and completed by multiple devices cooperating with each other. In the case of such a distributed scenario, one of the multiple devices can only perform one or more steps in the method of the embodiment of the present disclosure, and the multiple devices will interact with each other to complete the described method.

[0115] It should be noted that the above describes some embodiments of the present disclosure. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the above embodiments and still achieve the desired results. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0116] Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present disclosure also provides a distributed data transaction system.

[0117] refer to Figure 3 The distributed data transaction system includes: data providers, data consumers and data agents, wherein:

[0118] Obtaining transaction records of a data provider, and calculating the reputation value of the data provider based on the transaction records;

[0119] The data provider and the data consumer respectively calculate quotations according to the reputation value and send the quotations to the data agent;

[0120] The data agent calculates the transaction data volume according to the quotation, and sends the transaction data volume to the data provider and the data consumer;

[0121] According to the data volume of the transaction, the data provider and the data consumer respectively calculate new quotes and transmit them to the data agent;

[0122] In response to determining that the amount of data of the transaction calculated by submitting new quotations multiple times meets a preset threshold, a transaction plan is obtained, and the transaction plan is recorded on the blockchain;

[0123] According to the transaction plan, the data provider sends the data product to the data consumer to complete the transaction.

[0124] The system of the above embodiment is used to implement the corresponding distributed data transaction method in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0125] Those skilled in the art should understand that the discussion of any of the above embodiments is merely illustrative and is not intended to imply that the scope of the present disclosure (including the claims) is limited to these examples. Based on the concept of the present disclosure, the technical features in the above embodiments or different embodiments may be combined, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present disclosure as described above, which are not provided in detail for the sake of simplicity.

[0126] While the disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications and variations of these embodiments will be apparent to those skilled in the art in light of the foregoing description.

[0127] The embodiments of the present disclosure are intended to cover all such substitutions, modifications and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present disclosure should be included in the scope of protection of the present disclosure.

Claims

1. A distributed data transaction method, comprising: S1. Obtain the transaction records of the data provider, and calculate the reputation value of the data provider according to the transaction records; The method includes: determining the first reputation value of the data provider by the following formula according to the information entropy, data transmission efficiency, data transmission speed, unit data transmission fee and network congestion status contained in the data in the transaction record, and using the first reputation value of the data provider as the reputation value of the data provider: Among them, DP, DC and DA are at least one. When DP, DC and DA are extended to multiple data providers, data consumers and data agents, c i represents the i-th DC, I is an integer greater than 1, representing the number of DCs, 1≤i≤I; p j represents the jth DP, J is an integer greater than 1, representing the number of DPs, 1≤j≤J; q j,i Indicates p j C i Reputation value; H j,i Indicates c i From p j The information entropy contained in the data you want to purchase; It is a parameter used to adjust the data quality or the emphasis of data transmission; j,i Indicates p j to c i Data transmission efficiency; i,j Indicates data transmission speed; f i,j Indicates the transmission cost per unit of data; C i,j is a constant, indicating the congestion status of the network; dte j,i Represents the mapping w j,i The result to (0-1), x i,j c i From p j The amount of data purchased, DP is the data provider, DC is the data consumer, and DA is the data agent; S2. The data provider and the data consumer respectively calculate quotations according to the reputation value and send the quotations to the data agent; S3, the data agent calculates the transaction data volume according to the quotation, and sends the transaction data volume to the data provider and the data consumer; S4. According to the data volume of the transaction, the data provider and the data consumer respectively calculate new quotations and transmit them to the data agent; S5, looping through steps S3-S4, in response to determining that the change in the amount of data of the transaction meets a preset threshold, obtaining a transaction plan, and recording the transaction plan on the blockchain; S6. According to the transaction plan, the data provider sends the data product to the data consumer to complete the transaction.

2. The method according to claim 1, wherein: The method further comprises: The data consumer sends the transaction record and the evaluation of the data provider to the data agent after being digitally signed; The data agent sends the transaction record and the evaluation of the data provider to the data provider; The data provider checks and digitally signs the data before sending it back to the data agent; The data agent packages the transaction records and stores the packaged transaction records on the blockchain.

3. The method according to claim 1, wherein: The step S3-S4 is executed cyclically, and in response to determining that the data volume change of the transaction meets a preset threshold, a transaction plan is obtained, including: According to the data, the consumer's quotation B 1 and the data provider's quote D 1 , the data agent calculates the data transaction volume X of the data consumer 1 and the data transaction volume Y of the data provider 1 , and the X 1 , Y 1 Sending to the data consumer and the data provider; According to the X 1 , Y 1 , the data consumer and the data provider respectively calculate the corresponding quote B 2 , D 2 , and the B 2 , D 2 Send to the data agent to calculate X 2 , Y 2 ; Repeat the above steps to get B n , D n , X n and Y n , in response to determining B n satisfy , D n satisfy , the B n , D n , X n and Y n As the output of the transaction plan, σ, ε are preset thresholds, n is an integer greater than 1, and B n is the final quotation of the data consumer, D n is the final quotation of the data provider, X n is the final data transaction volume of the data consumer, Y n is the final data transaction volume of the data provider.

4. The method according to claim 3, wherein: The data consumer's quote is expressed as: in, Indicates the first i , I is an integer greater than 1, indicating the number of the data consumers, 1≤i≤I; The data provider j , J is an integer greater than 1, indicating the number of data providers, 1≤j≤J; express right Reputation value; express right quotations; express from The amount of data purchased; express Data products for availability; Represents the remaining data consumers The impact of express The minimum amount of data required, c i Personal preferences; The data provider's quote is expressed as: in, express right quotations; express Trade to The amount of data; and Represents a cost parameter.

5. The method according to claim 4, wherein: and Satisfy the social welfare maximization problem SW, which is: in, express Satisfaction function: express Personal preferences, ; express The cost function is: ; The data consumer's bid is based on the data purchase problem Sure: in, yes The payment function, ; The data provider's offer is based on the data selling issue Sure: in, yes The reward function, ; The data transaction volume is based on the optimal data transaction allocation problem Sure: 。 6. The method according to claim 1, wherein: Calculating the reputation value of the data provider based on the transaction record further includes: determining a second reputation value of the data provider based on the first reputation value and the time of historical transactions in the transaction record, and using the second reputation value of the data provider as the reputation value of the data provider.

7. The method according to claim 6, wherein: The calculating the reputation value of the data provider according to the transaction record further comprises: Determining an indirect reputation value of the data provider based on evaluations of other data consumers; A third reputation value is determined according to the second reputation value and the indirect reputation value, and the third reputation value is used as the reputation value of the data provider.

8. A distributed data trading system, comprising: Data providers, data consumers and data agents, wherein the transaction records of the data providers are obtained, and the reputation value of the data providers is calculated according to the transaction records; including: according to the information entropy, data transmission efficiency, data transmission speed, unit data transmission fee and network congestion status contained in the data in the transaction records, the first reputation value of the data provider is determined by the following formula, and the first reputation value of the data provider is used as the reputation value of the data provider: Among them, DP, DC and DA are at least one. When DP, DC and DA are extended to multiple data providers, data consumers and data agents, c i represents the i-th DC, I is an integer greater than 1, representing the number of DCs, 1≤i≤I; p j represents the jth DP, J is an integer greater than 1, representing the number of DPs, 1≤j≤J; q j,i Indicates p j C i Reputation value; H j,i Indicates c i From p j The information entropy contained in the data you want to purchase; It is a parameter used to adjust the data quality or the emphasis of data transmission; j,i Indicates p j to c i Data transmission efficiency; i,j Indicates data transmission speed; f i,j Indicates the transmission cost per unit of data; C i,j is a constant, indicating the congestion status of the network; dte j,i Represents the mapping w j,i The result to (0-1), x i,j c i From p j The amount of data purchased, DP is the data provider, DC is the data consumer, and DA is the data agent; The data provider and the data consumer respectively calculate quotations according to the reputation value and send the quotations to the data agent; The data agent calculates the transaction data volume according to the quotation, and sends the transaction data volume to the data provider and the data consumer; According to the data volume of the transaction, the data provider and the data consumer respectively calculate new quotes and transmit them to the data agent; In response to determining that a change in the amount of data of the transaction calculated by submitting new quotations multiple times satisfies a preset threshold, a transaction plan is obtained, and the transaction plan is recorded on the blockchain; According to the transaction plan, the data provider sends the data product to the data consumer to complete the transaction.