Auction transaction method and device and related equipment

Abstract

The invention provides an auction transaction method and device and related equipment, and is applied to a first node, and the method comprises the steps: transmitting a public key of the first node to a second node under the condition that the second node participates in an auction application request for an auction transaction issued by a third node; receiving first information sent by the second node for the auction transaction, wherein the first information comprises first ciphertext information; under the condition that the first ciphertext information is decrypted to obtain bidding information, second information is sent to a third node, and the second information comprises second ciphertext information of the bidding information and a public key of the first node; receiving third information sent by a third node, wherein the third information comprises third ciphertext information obtained by encrypting the auction price information by the third node based on the public key of the first node; and fourth ciphertext information is sent to the second node, the fourth ciphertext information comprises ciphertext information of a first auction result of the auction transaction, and the first auction result is determined by the first node based on the auction price information.

Description

Technical Field

[0001] This application relates to the field of blockchain technology, and in particular to an auction transaction method, apparatus and related equipment. Background Technology

[0002] With the rapid development of informatization and digitalization, the amount of data generated is also growing rapidly. How to process and trade this data has become an urgent problem to be solved. Currently, several data trading platforms have been established both domestically and internationally to promote the development of data trading. However, due to the uncertainty, scarcity, and diversity of data value, the market has lacked a unified and standardized pricing mechanism. A reasonable pricing mechanism is one of the important factors affecting the development of data trading.

[0003] Currently, data trading in the market typically involves direct transactions between data providers and buyers. However, data providers don't necessarily possess strong data product production capabilities, resulting in a limited variety of data products on the market and a lack of specialization in the problems they address. Often, a data buyer only needs a small portion of a particular data product's capabilities, but the overall price is too high, causing the buyer to abandon the purchase and reducing market activity.

[0004] Building upon this trading model, auctions can currently be used to price data. This method allows both buyers and sellers to participate in the data pricing process, resulting in more reasonable pricing outcomes. However, auctions still present several problems, such as the unreliability of third-party auctioneers, collusion between buyers, sellers, and auctioneers, and issues like price gouging and privacy breaches that can result in relatively poor fairness in data transactions. Summary of the Invention

[0005] This application provides an auction transaction method, apparatus, and related equipment, which can solve the technical problem of poor fairness in data transactions under auction transaction methods in related technologies.

[0006] In a first aspect, embodiments of this application provide an auction transaction method applied to a first node, the first node being used to process auction transactions, the method comprising:

[0007] Upon receiving an auction application request from the second node to participate in an auction transaction published by the third node, the public key of the first node is sent to the second node, where the second node is the node corresponding to the bidder in the auction transaction and the third node is the node corresponding to the auctioneer in the auction transaction.

[0008] The system receives first information sent by the second node for the auction transaction. The first information includes first ciphertext information, which is obtained by the second node encrypting the bidder's bid information for the auction transaction based on the first node's public key.

[0009] If the first ciphertext information is decrypted to obtain the bid information, the second information is sent to the third node. The second information includes the second ciphertext information of the bid information and the public key of the first node.

[0010] The third information sent by the third node includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node, wherein the auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information;

[0011] The fourth encrypted information is sent to the second node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction, which is determined by the first node based on the auction price information.

[0012] Secondly, embodiments of this application provide an auction transaction method applied to a second node, where the second node is the node corresponding to the bidder in the auction transaction. The method includes:

[0013] When initiating an auction application request to participate in an auction transaction published for a third node, the first node sends the public key of the first node, which is used to process the auction transaction, and the third node is the node corresponding to the auctioneer of the auction transaction.

[0014] The first information is sent to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node.

[0015] The system receives fourth encrypted information sent by the first node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction. The first auction result is determined by the first node based on the auction price information indicated by the third encrypted information in the third information sent by the third node. If the first encrypted information is decrypted to obtain the bid information, the system sends second information to the third node. The second information includes second encrypted information of the bid information and the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second encrypted information.

[0016] Thirdly, embodiments of this application provide an auction transaction method applied to a third node, wherein the third node is the node corresponding to the auctioneer in the auction transaction, and the method includes:

[0017] In the case of publishing an auction transaction, the system receives second information sent by the first node. The second information includes second ciphertext information of the bid information and the public key of the first node. The first information is sent by the second node to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The public key of the first node is sent by the first node to the second node when it receives the auction application request from the second node to participate in the auction transaction published by the third node. The first node is used to process the auction transaction, and the second node is the node corresponding to the bidder of the auction transaction.

[0018] The third information is sent to the first node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information. The auction price information is used to determine the first auction result of the auction transaction.

[0019] Fourthly, embodiments of this application provide an auction transaction apparatus applied to a first node, the first node being used to process auction transactions, the apparatus comprising:

[0020] The first sending module is used to send the public key of the first node to the second node when it receives an auction application request from the second node to participate in an auction transaction published by the third node. The second node is the node corresponding to the bidder in the auction transaction, and the third node is the node corresponding to the auctioneer in the auction transaction.

[0021] The first receiving module is used to receive the first information sent by the second node for the auction transaction. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node.

[0022] The second sending module is used to send second information to the third node after decrypting the first ciphertext information to obtain the bid information. The second information includes the second ciphertext information of the bid information and the public key of the first node.

[0023] The second receiving module is used to receive third information sent by the third node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information.

[0024] The third sending module is used to send fourth encrypted information to the second node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction, which is determined by the first node based on the auction price information.

[0025] Fifthly, embodiments of this application provide an auction transaction device applied to a second node, the second node being the node corresponding to the bidder in the auction transaction, the device comprising:

[0026] The third receiving module is used to receive the public key of the first node sent by the first node when an auction application request is initiated to participate in an auction transaction published for the third node. The first node is used to process the auction transaction, and the third node is the node corresponding to the auctioneer of the auction transaction.

[0027] The fourth sending module is used to send the first information to the first node. The first information includes the first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node.

[0028] The fourth receiving module is used to receive fourth encrypted information sent by the first node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction. The first auction result is determined by the first node based on the auction price information indicated by the third encrypted information in the third information sent by the third node. If the first encrypted information is decrypted to obtain the bid information, the module sends second information to the third node. The second information includes the second encrypted information of the bid information and the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second encrypted information.

[0029] Sixthly, embodiments of this application provide an auction transaction device applied to a third node, wherein the third node is the node corresponding to the auctioneer in the auction transaction, and the device includes:

[0030] The fifth receiving module is used to receive second information sent by the first node when an auction transaction is published. The second information includes second ciphertext information of the bid information and the public key of the first node. The first information is sent by the second node to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The public key of the first node is sent by the first node to the second node when it receives the auction application request from the second node to participate in the auction transaction published by the third node. The first node is used to process the auction transaction, and the second node is the node corresponding to the bidder of the auction transaction.

[0031] The fifth sending module is used to send third information to the first node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information. The auction price information is used to determine the first auction result of the auction transaction.

[0032] In a seventh aspect, embodiments of this application provide a node, including: a processor, a memory, and a program stored in the memory and executable on the processor, wherein when the program is executed by the processor, it implements the steps of the auction transaction method as described in the first aspect, or the steps of the auction transaction method as described in the second aspect, or the steps of the auction transaction method as described in the third aspect.

[0033] Eighthly, embodiments of this application provide a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the auction transaction method as described in the first aspect, or the steps of the auction transaction method as described in the second aspect, or the steps of the auction transaction method as described in the third aspect.

[0034] In a ninth aspect, embodiments of this application provide a computer program product, including computer instructions that, when executed by a processor, implement the steps of the auction transaction method as described in the first aspect, or the steps of the auction transaction method as described in the second aspect, or the steps of the auction transaction method as described in the third aspect.

[0035] In this embodiment, the auction transaction process is conducted at the first node. The bidder encrypts their bid information and transmits it to the first node via a secure communication channel. The first node decrypts the bid information, encrypts it again, and sends it to the auctioneer. The auctioneer determines the auction price and encrypts it before sending it to the first node. The first node executes the auction and obtains the auction result. Thus, all data transmissions related to the first node are encrypted before being transmitted via a secure communication channel, ensuring data security and preventing any third party from obtaining or tampering with the data. This addresses the issue of potential tampering with auction results and avoids collusion between the buyer, seller, and auctioneer, thereby improving the fairness of data transactions. Attached Figure Description

[0036] To more clearly illustrate the technical solutions of the embodiments of this application, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0037] Figure 1 This is one of the flowcharts of an auction transaction method provided in the embodiments of this application;

[0038] Figure 2 This is a schematic diagram illustrating the three auction transaction methods provided in the embodiments of this application;

[0039] Figure 3 This is a second flowchart of an auction transaction method provided in the embodiments of this application;

[0040] Figure 4 This is the third flowchart of an auction transaction method provided in the embodiments of this application;

[0041] Figure 5 This is an interactive flowchart of an auction transaction method in a specific example of an embodiment of this application;

[0042] Figure 6 This is one of the structural schematic diagrams of an auction trading device provided in the embodiments of this application;

[0043] Figure 7 This is a second schematic diagram of the structure of an auction trading device provided in the embodiments of this application;

[0044] Figure 8 This is the third schematic diagram of an auction trading device provided in the embodiments of this application;

[0045] Figure 9 This is a schematic diagram of the structure of a node provided in an embodiment of this application. Detailed Implementation

[0046] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0047] Currently, there are three main pricing methods for data transactions: The first method is seller-driven pricing. In this method, the seller is in a dominant position, unilaterally determining the data transaction price, which can easily inflate prices and reduce the enthusiasm of buyers to participate in the transaction. At the same time, since the value of data varies in the hands of different buyers, and the seller cannot reasonably assess the value of the data in actual use, the pricing they give is prone to deviating from a reasonable price, seriously affecting the activity of the transaction market.

[0048] The second approach involves analyzing data features to identify historical transaction data with high feature similarity and providing recommended pricing. This method can offer some pricing reference information to buyers and sellers, but due to the diversity, uncertainty, and scarcity of data, it is difficult to extract and analyze data features. Furthermore, the same data can have vastly different values ​​in different industries and among different buyers, making it difficult for the calculated recommended pricing to actually meet market demands.

[0049] The third approach is to use auctions for pricing. This method allows both buyers and sellers to participate in the data pricing process, resulting in a more reasonable price. However, auctions currently have several problems, such as the unreliability of third-party auctioneers, collusion between buyers, sellers, and auctioneers, and the risks of price gouging and privacy breaches associated with public auctions.

[0050] To address the issue of untrustworthy auctioneers, some studies have proposed using blockchain for auctions, eliminating the centralized role of auctioneers and improving the credibility of auction results. To address problems such as price gouging and privacy breaches associated with auctions, some studies have proposed sealed-bid auctions, which hide the bidding process, preventing buyers from being influenced by other buyers' bids and ensuring that the bids are closer to what they are willing to accept. However, sealed-bid auctions introduce new challenges. Ensuring the fairness and credibility of the results is a major difficulty, and because the auction process is conducted in a sealed environment, collusion between buyers, sellers, and auctioneers becomes difficult to detect.

[0051] It is evident that the current data auction transaction method has the following shortcomings:

[0052] There is a lack of a reasonable data product production mechanism. In related technologies, transactions are usually conducted directly between data providers and data buyers. However, data providers do not necessarily possess strong data product production capabilities, and the data products they offer are often relatively simple, failing to meet diverse market demands and leading to excessively high prices for individual data products. Furthermore, some data buyers desire data products that integrate data from multiple providers to obtain a more valuable product. The current one-to-one transaction method cannot meet this need. Data buyers must purchase data products from multiple providers and then integrate them themselves. This method increases the total purchase price and usage costs, further reducing buyers' willingness to purchase data.

[0053] This approach cannot meet the needs of one-to-many auctions. In related technologies, auctions only generate one final buyer; multiple sales require multiple auctions, which is inefficient and can easily drive up prices. However, in actual data transactions, many sellers have one-to-many sales needs, and buyers do not want only the highest bidder to win each time. This would require buyers to wait for the next auction, and this method leads to higher final auction prices.

[0054] There is no truly secure and reliable sealed auction method. Achieving absolute sealing of auction data remains a significant challenge in related technologies. Some solutions encrypt the bids and then transmit them to a third-party node in the blockchain for decryption before the auction process. This method carries the risk of third-party nodes leaking bids and tampering with the results. Other solutions anonymize the bidders, but bid information can still be leaked.

[0055] To address the aforementioned technical problems, this application provides an auction transaction method, aiming to solve these problems.

[0056] It should be noted that the auction transaction method in this application embodiment is applied to an auction transaction system and relates to the technical fields of blockchain, etc. The auction transaction system may include a first node, a second node and a third node. The first node, the second node and the third node can transmit data to each other to implement the auction transaction method in this application embodiment.

[0057] See Figure 1 , Figure 1 This is one of the flowcharts of an auction transaction method provided in the embodiments of this application, applied to the first node, which is used to process auction transactions, such as... Figure 1 As shown, the method includes the following steps:

[0058] Step 101: Upon receiving an auction application request from the second node to participate in an auction transaction published by the third node, the public key of the first node is sent to the second node, where the second node is the node corresponding to the bidder in the auction transaction and the third node is the node corresponding to the auctioneer in the auction transaction.

[0059] Step 102: Receive the first information sent by the second node for the auction transaction. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node.

[0060] Step 103: If the first ciphertext information is decrypted to obtain the bid information, the second information is sent to the third node. The second information includes the second ciphertext information of the bid information and the public key of the first node.

[0061] Step 104: Receive third information sent by the third node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information.

[0062] Step 105: Send the fourth encrypted information to the second node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction. The first auction result is determined by the first node based on the auction price information.

[0063] In step 101, the auction object can be a physical object, a virtual object, or data. The following embodiment will use data as an example for illustration.

[0064] In some embodiments, the auction transaction system can be designed with four system roles: data provider (represented by DP), data developer (represented by DE), data buyer (represented by DU), and trusted node C. All four system roles are nodes in the blockchain.

[0065] Among them, the data provider DP will provide the original data D; the data developer DE will conduct secondary development based on the original data D provided by the data provider DP to produce data products; the trusted node C can be a blockchain node with a Trusted Execution Environment (TEE).

[0066] There are three types of auction transactions in this application: DP2DE, DE2DU, and DU2DE, as follows: Figure 2As shown. Among them, DP2DE, DE2DU, and DU2DE auctions can use the same auction transaction process. There are three roles in the auction transaction process: the auctioneer (represented by AP), the bidder (represented by BP), and the auctioneer (represented by BP). i (Representation), trusted nodes, where the bidder (BP) i The quantity is greater than or equal to 1, BP i This represents the i-th bidder.

[0067] The differences between DP2DE, DE2DU, and DU2DE auctions in the auction transaction process are as follows: the auctioneer (AP) and the bidder (BP) are... i The two processes differ in their corresponding system roles, auction content, bidding amounts, and auction algorithms, as detailed below:

[0068] The DP2DE auction is initiated by the data provider DP, meaning the auctioneer is the data provider DP. The auction item is the secondary development rights to the original data D provided by the data provider DP. Multiple data developers (DEs) can apply to participate in the auction, meaning the bidders are the data developers (DEs). The bids are based on a revenue-sharing ratio, and during the auction transaction process, bids are sorted in descending order (from highest to lowest). The revenue-sharing ratio refers to the percentage of revenue shared between the data developers (DEs) and the data providers (DPs) after the sale of the data products produced from the secondary development of the original data D provided by the data provider DP.

[0069] The reason why the data developer (DE) shares revenue with the data provider (DP) in the above design is that this approach motivates DE to actively protect the original data (D) from leakage, as any leakage would harm DE's long-term interests. Furthermore, this revenue-sharing arrangement ensures long-term benefits for the data provider (DP), increasing DP's incentive to provide the original data.

[0070] DE2DU: The DE2DU auction is initiated by the data developer DE, meaning the auctioneer is the data developer DE. The auctioned content is the data product produced after secondary development of the original data D. Multiple data buyers DU can apply to participate in the auction, meaning the bidders are the data buyers DU. The bidder's bid is the specific purchase price, and during the auction transaction process, the bids are sorted in descending order, i.e., from high to low.

[0071] DU2DE: The DU2DE auction is initiated by the data buyer (DU), meaning the auctioneer is the data buyer (DU). The auction content is the demand posted by the data buyer (DU), which describes the data products the data buyer (DU) wants to purchase. Multiple data developers (DEs) can apply to participate in the auction, meaning the bidders are the data developers (DEs). Each bidder's bid is the selling price of the data products they can provide. During the auction transaction process, bids are sorted in ascending order, from lowest to highest.

[0072] The reason for designing the DU2DE auction is that in actual data transaction scenarios, due to the large number and variety of data buyers' needs, existing data products may not be able to fully meet the needs. Therefore, this application embodiment designs that data buyers (DUs) can conduct auctions by publishing their needs, which can more comprehensively cover the needs of all data buyers (DUs).

[0073] The third node corresponding to the auctioning AP can initiate an auction transaction and publish the auction request A. Auction request A includes a description of the auction items, the auction start time T1, the bidding deadline T2, the maximum auction quantity N, and the auctioning AP's public key PK. p .

[0074] Wherein, the maximum auction quantity N represents the maximum number of bidders BP that the auctioneer AP expects to have in this auction transaction. i Auction successful. In the DP2DE and DE2DU auction transaction processes, N is greater than or equal to 1, while in the DU2DE process, N is always equal to 1.

[0075] A trusted node C, i.e., the first node, can be randomly selected to process the auction request A for this auction transaction. Trusted node C generates an encrypted public key PK within a Trusted Execution Environment (TEE). c and private key SKc.

[0076] Bidding party BP i The corresponding second node can query published auction transactions, select the auction transaction it wants to participate in, and apply to participate in the auction before the bidding deadline T2. Correspondingly, when trusted node C receives an auction application request from the second node to participate in an auction transaction published against the third node, trusted node C's Trusted Execution Environment (TEE) and the bidding party BP applying to participate in the auction... i A secure communication channel is established, and the Trusted Execution Environment (TEE) of Trusted Node C transmits the public key PK of Trusted Node C through the secure communication channel. c Transmit to the bidder BP iIt should be noted that, in this embodiment, the communication with the bidder is actually with the second node corresponding to the bidder, and the communication with the auctioneer is actually with the third node corresponding to the auctioneer.

[0077] Bidding party BP i You can bid on auction demand A for an auction transaction. The bidding method can vary depending on the type of auction transaction. For example, if the auction transaction is DP2DE, DE2DU, or DU2DE, the bidding method will be different. For instance, if the auction transaction is DP2DE, multiple data developers DE can apply to participate in the auction. The bidder is the data developer DE, and the bidder's bid is the revenue sharing ratio.

[0078] In some embodiments, the bidder BP i It can also generate random string R i and bid information P i Perform a hash calculation together to obtain the hash value PH. i That is, the second hash value, the bidder's BP. i Use the public key PK of trusted node C. c For bid information P i and random string R i Encryption is performed to obtain the bid ciphertext P. i That is, the first ciphertext and the random character ciphertext R. i That is, the sixth encrypted message.

[0079] Bidding party BP i The bid ciphertext P i '、Random character ciphertext R i The hash value PH is transmitted to the Trusted Execution Environment (TEE) of Trusted Node C via a secure communication channel. i Upload to the blockchain.

[0080] In some embodiments, the bidder BP i It can also transmit the bid type to trusted node C, which indicates whether the bidder is bidding exclusively for the auctioned object in the auction transaction. For example, if bidder BP... i To exclusively acquire auction items, an exclusive token OF can be transmitted to the Trusted Execution Environment (TEE) of trusted node C, and then uploaded to the blockchain. This exclusive token OF instructs bidders to exclusively bid on the auction items in the transaction.

[0081] The aforementioned bidder BP i For bid information P i and random string R i Perform hash processing to obtain the hash value PH iThe reason for uploading to the blockchain is to allow the Trusted Execution Environment (TEE) of the trusted node C to verify the bid information P before ranking the bids in the auction transaction process. i The completeness and accuracy of the bid information, and the mismatched bid information P i Remove directly. Also, if the bidder (BP)... i When making malicious complaints using different bids after the auction ends, the hash value PH can be used as the basis for the complaint. i Verification was conducted to identify malicious complaints.

[0082] In this case, a random string R is added. i The reason is the bid information P i It refers to a specific price or profit-sharing ratio, which has certain rules and ranges. There is a possibility of cracking the plaintext corresponding to the hash value by calculating the hash value through enumeration. Adding a random string R... i Performing hashing afterwards can prevent this risk from occurring.

[0083] In addition, the bidder BP i When transmitting data to the Trusted Execution Environment (TEE) of Trusted Node C via a secure communication channel, the bid information P... i and random string R i Encryption is performed before transmission because even with a secure communication channel established with a Trusted Execution Environment (TEE), transmitted data may still be vulnerable to external threats. To prevent malicious data theft, the design encrypts the transmitted data before transmission. In this application's embodiments, all parts involving data transmission via a secure communication channel are encrypted first to enhance data transmission security.

[0084] The aforementioned exclusive identifier OF refers to the bidder BP. i If you want to exclusively own the auction content of this auction request A, meaning that only you can successfully bid for it and the auction content of this auction request A cannot be auctioned to other parties, you need to send an exclusive identifier OF to the trusted node C. Finally, the auctioneer AP will decide whether to accept this exclusive request.

[0085] Correspondingly, the bidder BP i The first message can be sent to trusted node C. This first message may include first encrypted information, sixth encrypted information, and an exclusive identifier OF. In this way, the first node can receive the first message sent by the second node regarding the auction transaction.

[0086] In this context, trusted node C can use the private key SK generated by trusted node C within the trusted execution environment (TEE). c For all bidders (BP) i The transmitted bid ciphertext P iDecrypt to obtain the bid information P i .

[0087] In some embodiments, the trusted node C can also use the private key SK generated by the trusted node C in the trusted execution environment (TEE). c For random character ciphertext R i Decryption yields the random character R. i The auction transaction algorithm can then be executed in a Trusted Execution Environment (TEE).

[0088] The auction transaction algorithm can refer to processing bidding information and selecting the more favorable bidding information for the auctioneer. In some embodiments, before step 103, the method further includes:

[0089] Sort the bid information of the bidders;

[0090] The bidding results are determined, which include the top N bids. The second ciphertext information is the ciphertext information of the bids in the bidding results. N is the maximum number of auctioned items in the auction transaction, and N is a positive integer greater than or equal to 1.

[0091] In some embodiments, the auction object in the auction transaction is data, and the auction transaction includes any of the following:

[0092] The data provider is the auctioneer, and the data developer is the bidder;

[0093] The data developer is the auctioneer, and the data buyer is the bidder;

[0094] The data buyer is the auctioneer, and the data developer is the bidder;

[0095] Specifically, in the case where the data provider is the auctioneer and the data developer is the bidder; or in the case where the data developer is the auctioneer and the data buyer is the bidder, the bid information of the bidders is sorted in descending order; and in the case where the data buyer is the auctioneer and the data developer is the bidder, the bid information of the bidders is sorted in ascending order.

[0096] This embodiment addresses the lack of a reasonable data product production mechanism by designing three roles: data provider, data developer, and data buyer. The data provider licenses its raw data to the data developer for secondary development, generating rich data products. The data developer then sells these products to the data buyer. This solves the problem of data providers lacking strong data processing capabilities, providing a reasonable data product production mechanism. The data developer can further develop the raw data from the data provider based on different application scenarios and privacy levels, generating multiple data products. This increases the richness of the data products and improves the overall revenue of the data provider. It also addresses the issue of a single data product being unable to integrate data from multiple data providers.

[0097] Furthermore, data developers can integrate raw data from multiple data providers to deliver higher-quality data products. They can also generate multiple levels of data products from the same raw data based on different application scenarios and privacy requirements. This not only addresses the lack of robust data product generation capabilities among data providers but also significantly enhances the richness of data products and covers a wider range of market demands.

[0098] In some embodiments, the first information further includes a bid type, which indicates whether the bidder is bidding exclusively for the auctioned object in the auction transaction, and the sorting of the bidder's bid information includes:

[0099] Based on the bid type, the bid information of the bidder is classified to obtain an exclusive bid set and a non-exclusive bid set. The exclusive bid set includes bid information in an exclusive manner, and the non-exclusive bid set includes bid information not in an exclusive manner.

[0100] Sort the exclusive bid set and the non-exclusive bid set respectively;

[0101] The determined bid result includes:

[0102] Determine exclusive and non-exclusive results. The bidding results include both exclusive and non-exclusive results. The exclusive result is the bid information ranked first in the exclusive bidding set, and the non-exclusive result includes the bid information ranked among the top N in the non-exclusive bidding set.

[0103] The steps for trusted node C to execute the auction transaction algorithm in a trusted execution environment (TEE) can be as follows:

[0104] For bid information P i and random character R i Perform hash processing to obtain the first hash value, and verify that this first hash value matches the second hash value PH uploaded to the blockchain. iIf they are the same, and not the same, this bid information is removed, and the corresponding bidder (BP) is notified. i Auction fails; if bids are the same, bids are valid. In some embodiments, the first information further includes sixth ciphertext information, which is obtained by the second node encrypting a generated random string based on the first node's public key. Before step 103, the method further includes:

[0105] The bidding information obtained by decrypting the first ciphertext information and the random string obtained by decrypting the sixth ciphertext information are hashed to obtain the first hash value;

[0106] If the first hash value is different from the second hash value uploaded by the second node in the blockchain, the bidding information corresponding to the first hash value is removed, and it is determined that the bidder corresponding to the second node has failed the auction. The second hash value is obtained by the second node through hash calculation based on the bidder's bidding information for the auction transaction and the generated random string. The second information does not include the second ciphertext information of the bidding information corresponding to the first hash value.

[0107] For the remaining valid bids, the corresponding bidder's business plan (BP) can be used. i The system categorizes bids based on whether an exclusive bid flag (OF) is sent, resulting in exclusive bid sets and non-exclusive bid sets. The two bid sets are then sorted separately.

[0108] Obtain the top N bids from the sorted set of non-exclusive bids to generate a non-exclusive result NR. Obtain the top-ranked bid from the sorted set of exclusive bids to generate an exclusive result OR.

[0109] In the DP2DE and DE2DU auction processes, the sorting operation for the two bid sets is a descending order (from highest to lowest). In this case, the bids in the non-exclusive result NR are also arranged from highest to lowest, and the exclusive result OR is the highest bid in the exclusive bid set. However, in the DU2DE auction process, the sorting operation for the bid sets is an ascending order (from lowest to highest). Since the number of bids in the DU2DE auction process is N=1, the non-exclusive result NR contains only one bid, which is the lowest bid.

[0110] Correspondingly, trusted node C, within a trusted execution environment (TEE), can encrypt the selected bid information, i.e., the bid result, to obtain second ciphertext information, and then send this second information to the third node. Specifically, the non-exclusive result NR and the exclusive result OR can be encrypted separately to obtain the second ciphertext information.

[0111] In some embodiments, prior to step 103, the method further includes:

[0112] The bid information is digitally signed to obtain bid information carrying the signature information;

[0113] Based on the public key of the third node, the bid information carrying the signature information is encrypted to obtain the second ciphertext information.

[0114] In some embodiments, the non-exclusive result NR and the exclusive result OR can be digitally signed, and then the public key PK sent by the auctioneer AP can be used. p Encryption is performed to obtain a non-exclusive result ciphertext NR' and an exclusive result ciphertext OR'. The second ciphertext information may include the non-exclusive result ciphertext NR' and the exclusive result ciphertext OR'. The non-exclusive result ciphertext NR', the exclusive result ciphertext OR', and the public key PK generated by the Trusted Execution Environment (TEE) are then combined. c Send to the auctioneer, AP.

[0115] The digital signature processing for non-exclusive results NR and exclusive results OR is described in detail below:

[0116] Perform hash operations on the non-exclusive result NR and the exclusive result OR respectively to obtain hash values ​​NRH and ORH.

[0117] The private key SK generated using a Trusted Execution Environment (TEE) c The hash values ​​NRH and ORH are encrypted to generate digital signatures corresponding to the two hash values.

[0118] The reason for using digital signatures to process the non-exclusive result NR and the exclusive result OR is to prevent data from being tampered with when sent from a Trusted Execution Environment (TEE). Digital signatures can verify whether data has been tampered with during transmission. Furthermore, only the TEE possesses the corresponding private key SK. c Therefore, only a Trusted Execution Environment (TEE) can generate the correct digital signature, thus confirming that the data indeed comes from a Trusted Execution Environment (TEE).

[0119] After processing the non-exclusive result NR and the exclusive result OR using digital signatures, the public key PK sent by the auctioneer AP is then used. p Encryption is used to enhance transmission security and prevent data from being maliciously stolen during transmission.

[0120] Accordingly, the auctioneer AP can use the public key PK. p The corresponding private key SK p Decrypting the non-exclusive result ciphertext NR' and the exclusive result ciphertext OR' yields the digitally signed non-exclusive result NR and exclusive result OR. This can be achieved using the public key PK sent by the Trusted Execution Environment (TEE) of Trusted Node C. cDecrypt the digital signature to obtain hash values ​​NRH and ORH. Perform hash calculations on the non-exclusive result NR and the exclusive result OR, and compare the calculated hash values ​​with the NRH and ORH obtained from decrypting the digital signature. If they match, it indicates that the non-exclusive result ciphertext NR and the exclusive result OR are complete and accurate.

[0121] The auctioneer (AP) examines the non-exclusive result (NR) and the exclusive result (OR), and chooses to receive either exclusive or non-exclusive results. If non-exclusive is selected, the price ranked Mth in the non-exclusive result (NR) is chosen as the final auction price information (FP). If exclusive is selected, the final auction price information (FP) is set to OR. The public key (PK) is sent using the Trusted Execution Environment (TEE) of the trusted node (C). c The final auction price information FP is encrypted to obtain the ciphertext of the final auction price information FP, which is the third ciphertext information. The ciphertext of the final auction price information FP, the result of whether to select exclusive or not, and the ranking M (if non-exclusive is selected, it is sent) are sent to the Trusted Execution Environment (TEE) of the trusted node C through a secure communication channel.

[0122] Correspondingly, in step 104, the first node can receive the third information sent by the third node.

[0123] The design described above, which allows the auctioneer AP to select the Mth ranked bid from the N bids in the non-exclusive result NR, is intended to prevent excessively high auction prices that could reduce market activity. In this case, if the auctioneer AP wants to bid high, it must accept the risk that the number of successful bidders will be lower than N. Conversely, choosing a lower bid may result in a higher total auction price.

[0124] The aforementioned bidder BP i The design of sending an Exclusive Request (OF) can improve usability. In practical applications, some bidders (BPs)... i There may be a need to exclusively acquire certain auction items. In such cases, the design of providing an exclusive acquisition offer can meet this need. In this situation, the bid for an exclusive acquisition offer is usually higher than the bid for a non-exclusive acquisition offer, and the final choice rests with the auctioneer (AP).

[0125] Trusted node C uses its own private key SK in a Trusted Execution Environment (TEE). c The ciphertext of the final auction price information FP sent by the auctioneer AP is decrypted to obtain the final auction price information FP. Further processing is then performed based on the result of the auctioneer AP's selection of exclusive rights or not:

[0126] If the auctioneer AP chooses to accept non-exclusivity, then based on the final auction price information FP and ranking M, the top M bidders BP in the non-exclusivity results NR will be selected. iThe auction was successful. The auction price information is the final auction price information FP, and the remaining auction quantity is NM.

[0127] If the auctioneer AP chooses to accept the exclusive bid, the exclusive result OR the corresponding bidder BP i Auction successful, remaining auction quantity is 0.

[0128] For all bidders BP i Use each bidder's BP i Provided public key PK bi The final auction price information FP is encrypted, and the results are obtained using the public key PK. bi The encrypted final auction price information FP, along with the remaining auction quantity and the auction deadline T3, is sent to each corresponding bidder BP. i The encrypted information of the first auction result of the auction transaction may include the encrypted information of the final auction price (FP), and may also include the encrypted information of whether the auction was successful.

[0129] In some embodiments, the auction price information is determined from the non-exclusive result obtained by the third node from the second ciphertext information, and the third information also includes the ranking of the auction price information in the non-exclusive result. After step 105, the method further includes:

[0130] Based on the ranking and maximum auction quantity of the auction price information in the non-exclusive results, the remaining auction quantity of the auction object in the auction transaction is determined.

[0131] If the remaining auction quantity is greater than or equal to 1, and an auction application request for the auction price information is received from the second node corresponding to the bidder who failed the auction, it is determined that the bidder has successfully auctioned the auction transaction, and the remaining auction quantity of the auction object in the auction transaction is updated.

[0132] If the remaining auction quantity is zero or the auction time expires, the fifth encrypted information is sent to the third node. The fifth encrypted information includes the encrypted information of the second auction result of the auction transaction, which is an updated auction result based on the first auction result.

[0133] For each unsuccessful bidder (BP) in the auction... i Use public key PK bi The corresponding private key SK bi Decrypt the ciphertext of the final auction price information FP to obtain the final auction price information FP. If the remaining auction quantity is greater than 0, then the bidders BP who did not win the auction are considered unsuccessful bidders. iYou can choose whether to accept this price and continue participating in the auction. If you accept, you will send your application to participate in the auction to the Trusted Execution Environment (TEE) of Trusted Node C before the auction deadline T3.

[0134] The Trusted Execution Environment (TEE) of Trusted Node C receives each bid from a bidder (BP) who failed to complete the auction. i Each successful bid will reduce the remaining auction quantity by 1 until the auction quantity reaches 0 or the auction time ends at T3, at which point the auction will end. The final auction price information (FP) and the successful bidder's (BP) information will also be provided. i The set of IDs (denoted by IDS) is digitally signed, and then the public key provided by the auctioneer (AP) is used to PK the IDs. p Encryption is performed to obtain the ciphertext PFP' of the final auction price information FP and the ciphertext of the successful bidder BP. i The ciphertext PIDS' of the ID set, the fifth ciphertext information may include the ciphertext PFP' of the final auction price information FP and the ciphertext of the successful bidder BP. i The encrypted PIDS' of the ID set is transmitted to the auctioneer AP.

[0135] Auctioneer AP uses private key SK p The ciphertext PFP' of the final auction price information FP and the ciphertext of the successful bidder BP. i The ciphertext PIDS' of the ID set is decrypted to obtain the final auction price information FP, which contains the digital signature, and the successful bidder BP. i The encrypted IDs (IDS) of the ID set are then processed. After verifying the digital signature, the FOF (Fund of Funds) identifier indicating whether the auction is exclusive (i.e., the auction type) is uploaded to the blockchain.

[0136] For the final auction price information FP and the successful bidder BP i The purpose of digitally signing the ID set IDS is to ensure its integrity and accuracy, and at the same time, to ensure that the data has not been tampered with in the subsequent complaint process.

[0137] This embodiment solves the problem of not being able to meet the needs of one-to-many auctions. In the sealed auction transaction method, when the auctioneer publishes the auction request, they also publish the maximum quantity N they wish to sell. When sorting and calculating all bids, a set of the top N bids is generated. After the result set is sent to the auctioneer, the auctioneer selects the price ranked M as the final auction price. The bidder ranked in the top M immediately wins the auction, and the final auction price is sent to all bidders. At the same time, the auctioneer is notified that there are NM auction slots remaining. At this point, all bidders who did not win the auction can decide whether to accept this price and continue participating in the auction. Each time a bidder accepts, the remaining auction slots are immediately reduced by one, and that bidder wins the auction. The auction ends when there are 0 remaining auction slots or the auction time expires. This allows for one-to-many auctions while hiding the bidders' bids.

[0138] Furthermore, it supports one-to-many and exclusive auction processes. When an auctioneer publishes an auction request, they simultaneously publish the maximum quantity N they wish to sell. When a bidder places a bid, they simultaneously choose whether to apply for exclusive rights to the auction. During the auction algorithm execution, the sets of bids for exclusive rights and those for non-exclusive rights are sorted separately, and the auctioneer chooses whether to accept an exclusive or non-exclusive auction. If an exclusive auction is accepted, only one bidder will be successful, and the auctioned item cannot be auctioned to other parties. If a non-exclusive auction is accepted, the auctioneer will select the price ranked M from the top N non-exclusive bids as the final auction price. This design avoids the problem of price inflation caused by auctions. If the auctioneer wants to achieve a higher unit price, they must accept the risk that the auctioned quantity may be less than N; if they choose a lower price, they may achieve a higher total auction price. Therefore, this design can make the final auction price more reasonable and increase market activity. In addition, the design that allows bidders to apply for exclusive rights to the auction can cover more auction requests and improve the scalability of the auction process.

[0139] Simultaneously, it addresses the lack of a secure and reliable sealed auction method by placing the sealed auction process within a Trusted Execution Environment (TEE). Bidders encrypt their bids and other information, transmitting them to the TEE via a secure communication channel. The TEE decrypts the data and executes the auction algorithm to obtain the result. The TEE design ensures absolute sealing of auction data and absolute trustworthiness of the auction algorithm execution process, preventing third-party nodes from accessing or tampering with the auction data. Furthermore, all data transmissions related to the TEE are encrypted before being transmitted through a secure communication channel, guaranteeing data transmission security. Additionally, the auction algorithm calculation results are digitally signed and encrypted before being transmitted to the auctioneer, ensuring the integrity and accuracy of the results and mitigating the possibility of tampering.

[0140] Furthermore, this embodiment implements sealed auctions through a Trusted Execution Environment (TEE). All data transmissions between bidders, auctioneers, and the TEE are encrypted before being transmitted via a secure communication channel. This design ensures data transmission security; even if the secure communication channel fails and data is intercepted, the plaintext information will not be leaked, enabling a secure and reliable sealed auction method. After data is transmitted to the TEE, decryption and execution of the auction algorithm occur within the TEE, guaranteeing data confidentiality and fairness in the auction algorithm execution process. Even the trusted node hosting the TEE cannot access the data within the TEE and cannot tamper with it.

[0141] In some embodiments, after step 105, the method further includes:

[0142] Upon receiving a complaint request from the second node regarding the second auction result, the public key of the first node is sent to both the second and third nodes.

[0143] The system receives the seventh ciphertext information sent by the second node and the eighth ciphertext information sent by the third node. The seventh ciphertext information is obtained by the second node encrypting the bidder's bid information based on the first node's public key, and the eighth ciphertext information is obtained by the third node encrypting the auction price information of the auctioneer based on the first node's public key.

[0144] The bidding information obtained by decrypting the seventh ciphertext is compared with the auction price information obtained by decrypting the eighth ciphertext to obtain the first comparison result.

[0145] Based on the first comparison result, the complaint result is determined and fed back to the second node.

[0146] In some embodiments, before sending the public key of the first node to the second node and the third node respectively, the method further includes:

[0147] Based on the bid types stored by each bidder in the blockchain, determine the bid type of the bidder corresponding to the second node that initiated the complaint request;

[0148] Obtain the auction type stored in the third node corresponding to the auctioneer in the blockchain. The auction type indicates whether the auctioneer is auctioning the auction object in an exclusive manner.

[0149] The bid type of the bidder corresponding to the second node that initiated the complaint request is compared with the auction type to obtain the second comparison result;

[0150] The step of sending the public key of the first node to the second and third nodes respectively includes:

[0151] If the second comparison result indicates that the bid type of the bidder corresponding to the second node that initiated the complaint request is consistent with the auction type, the public key of the first node is sent to the second node and the third node respectively.

[0152] In this embodiment, if there is a bidder BP who did not succeed in the auction... i If you have any questions about the auction results (such as the first auction result or the second auction result), you can file a complaint.

[0153] Another trusted node C2, different from the trusted node C, can be randomly selected. The questioning bidder BP can then be obtained from the blockchain. i Whether an exclusive token OF was sent in this auction will be compared with the exclusive token FOF uploaded to the blockchain by the auctioneer AP. If the two are inconsistent, the appeal will be rejected immediately.

[0154] If they agree, then separate agreements will be established with the auctioneer (AP) and the challenging bidder (BP). i The secure communication channel between the second node (the bidder corresponding to the one that initiated the complaint request) and the trusted execution environment (TEE) of trusted node C2 generates the public key PK used for this complaint processing. c2 and private key SK c2 .

[0155] The Trusted Execution Environment (TEE) of the trusted node C2 transmits the public key PK through a secure communication channel. c2 Transmitted to the BP who raised the objection i BP, the bidder that raised the objection i Use the public key PK of trusted node C2 c2 Regarding the bidding information P in the above auction process i and random string Ri Encryption is performed to obtain the bid information P. i The ciphertext and random string R i The encrypted text is transmitted to the Trusted Execution Environment (TEE) of the trusted node C2 through a secure communication channel.

[0156] The Trusted Execution Environment (TEE) of the trusted node C2 transmits the encrypted public key PK through a secure communication channel. c2 The key is transmitted to the auctioneer AP, which uses the public key PK of the trusted node C2. c2 The final auction price information FP received by the auctioneer AP, which contains the digital signature of the trusted node C, is encrypted to obtain the ciphertext of the final auction price information FP containing the digital signature. This ciphertext is then transmitted to the trusted execution environment (TEE) of the trusted node C2 through a secure communication channel.

[0157] Trusted node C2 uses private key SK in a Trusted Execution Environment (TEE) c2 The ciphertext of the final auction price information FP, which contains the digital signature of trusted node C, transmitted by the auctioneer AP, is decrypted to obtain the final auction price information FP containing the digital signature of trusted node C. Then, the public key PK of trusted node C is used... c Digital signature verification is performed; if the verification passes, it means that the auctioneer AP transmitted genuine data.

[0158] Use the private key SK of trusted node C2 c2 BP, the bidder that raised the objection i The bid information P sent i The ciphertext and random string R i Decrypt the ciphertext to obtain the bid information P. i and random string R i Obtain the BP of the bidder who raised the objection. i The bid information P uploaded to the blockchain i The corresponding hash value PH i If the comparison is successful and the bids match, it indicates that the party raising the objection was the bidder (BP). i The data being transmitted is real data.

[0159] In a Trusted Execution Environment (TEE), the bid information P i The final auction price information (FP) is compared with that of the bidder (BP) who raised the objection. i If the auction is unsuccessful, the complaint will be rejected and the complaint will fail. If the comparison results do not match those of the challenging bidder (BP), the complaint will be dismissed. i If the auction is unsuccessful, the complaint is successful, the auction result for auction request A becomes invalid, and a new auction will be held.

[0160] In the auction transaction process of DP2DE and DE2DU, the bid information P i If the auction price (FP) is greater than or equal to the final auction price, but the auction fails, it is deemed that the bidder (BP) who raised the objection does not meet the requirements. i The auction was unsuccessful. In the DU2DE auction process, the bid information P... i If the auction price information FP is less than or equal to the final auction price, but the auction fails, it is deemed that the bidder BP who raised the objection does not meet the requirements. i The auction was unsuccessful.

[0161] The aforementioned bidder BP i The inclusion of a complaint mechanism is designed to further enhance the credibility of the auction results. While a Trusted Execution Environment (TEE) provides a highly secure environment, to ensure the absolute credibility of the auction results, it is advisable to include a clause allowing all bidders (BPs) to challenge the results. i Complaints can be filed to further reduce the risk of incorrect auction results.

[0162] In this embodiment, all bidders can be required to upload the hash value corresponding to their bid to the blockchain. This allows the Trusted Execution Environment (TEE) to verify the integrity and accuracy of the bids during both the auction and complaint processes, ensuring the credibility of the auction and complaint verification results. When a bidder who did not win the auction questions the result, they can file a complaint, further enhancing the credibility of the auction results. During complaint processing, the hash value corresponding to the bid uploaded to the blockchain during the auction transaction process is used to verify the bid, ensuring that the data calculated in the complaint is true and accurate, and making the complaint judgment more credible.

[0163] Furthermore, when calculating the hash value of bids, the characteristics of bidding in the auction process—namely, bids being specific prices or profit-sharing ratios—lead to certain rules and ranges for bids. This creates a risk that the hash value could be hashed using enumeration, thereby revealing the plaintext corresponding to the hash value. Therefore, a randomly generated string is added during the hash calculation of bids to ensure the hash value cannot be cracked, further guaranteeing the secrecy of the auction.

[0164] See Figure 3 , Figure 3 This is a second flowchart of an auction transaction method provided in this application embodiment, applied to the second node, where the second node is the node corresponding to the bidder in the auction transaction, such as... Figure 3 As shown, the method includes the following steps:

[0165] Step 301: In the case of initiating an auction application request to participate in an auction transaction published for a third node, the first node sends the public key of the first node, which is used to process the auction transaction, and the third node is the node corresponding to the auctioneer of the auction transaction.

[0166] Step 302: Send the first information to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node.

[0167] Step 303: Receive fourth encrypted information sent by the first node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction. The first auction result is determined by the first node based on the auction price information indicated by the third encrypted information in the third information sent by the third node. If the first encrypted information is decrypted to obtain the bid information, send second information to the third node. The second information includes the second encrypted information of the bid information and the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second encrypted information.

[0168] Optionally, the first information further includes sixth ciphertext information, which is obtained by the second node encrypting a generated random string based on the public key of the first node. Before step 302, the method further includes:

[0169] The generated random string and bid information are hashed to obtain a second hash value;

[0170] The second hash value is uploaded to the blockchain, and the second hash value is used by the first node to verify the authenticity of the bidding information in the first information.

[0171] Optionally, the first information further includes the bid type, which indicates whether the bidder is making an exclusive bid for the auctioned object in the auction transaction. Before step 302, the method further includes:

[0172] The bid type is uploaded to the blockchain; wherein,

[0173] The bid type is used by the third node to determine the auction type of the auctioneer. The auction type indicates whether the auctioneer is auctioning the auction object in an exclusive manner, and is also used by the first node to process the complaint request initiated by the second node.

[0174] The specific process of the second-node-side auction transaction method provided in this embodiment has been described in detail in the above embodiments, and will not be repeated here.

[0175] See Figure 4 , Figure 4 This is the third flowchart of an auction transaction method provided in this application embodiment, applied to the third node, where the third node is the node corresponding to the auctioneer in the auction transaction, such as... Figure 4 As shown, the method includes the following steps:

[0176] Step 401: In the case of publishing an auction transaction, receive second information sent by the first node. The second information includes second ciphertext information of the bid information and the public key of the first node. The first information is sent by the second node to the first node. The first information includes first ciphertext information. The first ciphertext information is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The public key of the first node is sent by the first node to the second node when it receives the auction application request from the second node to participate in the auction transaction published by the third node. The first node is used to process the auction transaction, and the second node is the node corresponding to the bidder of the auction transaction.

[0177] Step 402: Send the third information to the first node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information. The auction price information is used to determine the first auction result of the auction transaction.

[0178] Optionally, before step 402, the method further includes:

[0179] The second ciphertext information is decrypted based on the private key of the third node to obtain the bid information carrying the signature information;

[0180] The signature information is designed based on the public key of the first node to obtain a third hash value;

[0181] The decrypted bid information is hashed to obtain a fourth hash value;

[0182] The third hash value and the fourth hash value are compared to obtain the third comparison result;

[0183] Step 402 specifically includes:

[0184] If the third comparison result indicates that the third hash value and the fourth hash value are consistent, the third information is sent to the first node.

[0185] Optionally, after step 402, the method further includes:

[0186] The system receives fifth encrypted information sent by the first node. This fifth encrypted information includes encrypted information of the second auction result of the auction transaction, where the second auction result is the first auction result, or an auction result updated based on the first auction result.

[0187] When the auction price information is determined from the non-exclusive result obtained by the third node from the decryption of the second ciphertext information, the second auction result is an auction result updated based on the first auction result. The non-exclusive result includes the top N bids in the non-exclusive bid set, where N is the maximum number of auctioned items in the auction transaction and is a positive integer greater than 1. The non-exclusive bid set includes bids that are not exclusive. The third information also includes the ranking of the auction price information in the non-exclusive result. When the first node determines that the remaining number of auctions is greater than or equal to 1 based on the ranking of the auction price information in the non-exclusive result and the maximum number of auctions, and receives an auction application request from the second node corresponding to the bidder whose auction failed, the first auction result is updated.

[0188] The specific process of the third-node side auction transaction method provided in this embodiment has been described in detail in the above embodiments, and will not be repeated here.

[0189] The following is a specific example illustrating the auction transaction method in the embodiments of this application.

[0190] Figure 5 This is an interactive flowchart of an auction transaction method in a specific example of an embodiment of this application, such as... Figure 5 As shown, this interaction method includes three types of nodes: trusted nodes, auctioneers, and bidders. The interaction method follows the following... Figure 5 The steps labeled 1-17 are interactive. Figure 5 In this context, the result set NR is the non-exclusive result NR.

[0191] The embodiments of this application have the following technical advantages:

[0192] It has a reasonable data product production mechanism.

[0193] The design incorporates three roles: data provider, data developer, and data buyer. Data providers license their raw data to data developers for secondary development, generating richer data products, which are then sold to data buyers. Data developers can integrate raw data from multiple providers to offer higher-quality data products. They can also generate multiple levels of data products from the same raw data based on different application scenarios and privacy requirements. This design will increase the richness and quality of data products in the trading market, and the richness and quality of data products are crucial factors in enhancing the activity of the trading market.

[0194] It can meet the needs of one-to-many auctions.

[0195] In the auction process, when the auctioneer publishes an auction request, they also publish the maximum quantity N they wish to sell. When executing the auction algorithm, for non-exclusive auctions, the auctioneer selects the price ranked Mth from the top N non-exclusive bids as the final auction price. This design avoids the problem of inflated prices due to the auction. If the auctioneer wants to achieve a higher unit price, they must accept the risk that the auctioned quantity may be less than N; if they choose a lower price, they may achieve a higher total auction price. Therefore, this design helps to make the final auction price more reasonable and increases market activity.

[0196] It features a secure and reliable sealed auction method.

[0197] Sealed auctions are implemented through a Trusted Execution Environment (TEE). Secure data transmission is achieved through encryption during data transmission and the design of secure communication channels. Furthermore, the data decryption and auction algorithm execution are performed within the TEE, ensuring that no third party can obtain or tamper with the data.

[0198] In addition, adding a complaint mechanism can further enhance the credibility of auction results. Bidders who have doubts about the results can file a complaint, and the judgment of the complaint is also implemented by the Trusted Execution Environment (TEE), which increases the credibility of the complaint judgment results.

[0199] Furthermore, the data used in the complaint process is verified for authenticity and accuracy using the hash value or data signature of the blockchain uploaded during the auction transaction process, ensuring the correctness of the data used to determine the complaint. Moreover, the hash value of the uploaded blockchain used for verification is generated by adding a random string, further enhancing data security and ensuring the confidentiality of the auction.

[0200] The embodiments of this application have the following commercial value:

[0201] The state attaches great importance to the data trading market and has successively introduced a series of policies, including the "Opinions on Building a More Complete System and Mechanism for Market-Based Allocation of Factors of Production", the "Opinions on Building a Data Infrastructure System to Better Leverage the Role of Data Elements", the "Interim Provisions on Accounting Treatment Related to Enterprise Data Resources", the "Guiding Opinions on Strengthening Data Asset Management", and the "Three-Year Action Plan for 'Data Elements ×' (2024-2026)", which have promoted the rapid development of the data trading market.

[0202] In the data trading market, a reasonable pricing mechanism is one of the key factors influencing its development. However, to date, there is no unified and standardized pricing mechanism in the market. This application proposes a pricing method that can provide a fair and reasonable pricing mechanism, thereby promoting the development of the data trading market.

[0203] See Figure 6 , Figure 6 This is one of the structural schematic diagrams of an auction transaction device provided in this application embodiment, applied to a first node, the first node being used to process auction transactions, such as... Figure 6 As shown, the auction transaction device 600 includes:

[0204] The first sending module 601 is used to send the public key of the first node to the second node when it receives an auction application request from the second node to participate in an auction transaction published by the third node. The second node is the node corresponding to the bidder in the auction transaction, and the third node is the node corresponding to the auctioneer in the auction transaction.

[0205] The first receiving module 602 is used to receive the first information sent by the second node for the auction transaction. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node.

[0206] The second sending module 603 is used to send second information to the third node after decrypting the first ciphertext information to obtain the bid information. The second information includes the second ciphertext information of the bid information and the public key of the first node.

[0207] The second receiving module 604 is used to receive third information sent by the third node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information.

[0208] The third sending module 605 is used to send fourth encrypted information to the second node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction, which is determined by the first node based on the auction price information.

[0209] Optionally, the device further includes:

[0210] The sorting module is used to sort the bid information of the bidders;

[0211] The first determining module is used to determine the bidding results, which include the bidding information of the top N bids. The second ciphertext information is the ciphertext information of the bidding information in the bidding results. N is the maximum number of auction objects in the auction transaction, and N is a positive integer greater than or equal to 1.

[0212] Optionally, the auction object in the auction transaction is data, and the auction transaction includes any of the following:

[0213] The data provider is the auctioneer, and the data developer is the bidder;

[0214] The data developer is the auctioneer, and the data buyer is the bidder;

[0215] The data buyer is the auctioneer, and the data developer is the bidder;

[0216] Specifically, in the case where the data provider is the auctioneer and the data developer is the bidder; or in the case where the data developer is the auctioneer and the data buyer is the bidder, the bid information of the bidders is sorted in descending order; and in the case where the data buyer is the auctioneer and the data developer is the bidder, the bid information of the bidders is sorted in ascending order.

[0217] Optionally, the first information further includes the bid type, which indicates whether the bidder is making an exclusive bid for the auction object in the auction transaction. The sorting module is specifically used for:

[0218] Based on the bid type, the bid information of the bidder is classified to obtain an exclusive bid set and a non-exclusive bid set. The exclusive bid set includes bid information in an exclusive manner, and the non-exclusive bid set includes bid information not in an exclusive manner.

[0219] Sort the exclusive bid set and the non-exclusive bid set respectively;

[0220] The first determining module is specifically used for:

[0221] Determine exclusive and non-exclusive results. The bidding results include both exclusive and non-exclusive results. The exclusive result is the bid information ranked first in the exclusive bidding set, and the non-exclusive result includes the bid information ranked among the top N in the non-exclusive bidding set.

[0222] Optionally, the device further includes:

[0223] The digital signature module is used to digitally sign the bid information to obtain bid information carrying the signature information;

[0224] The encryption module is used to encrypt the bid information carrying the signature information based on the public key of the third node to obtain the second ciphertext information.

[0225] Optionally, the auction price information is determined from the non-exclusive result obtained by the third node from the second ciphertext information, and the third information also includes the ranking of the auction price information in the non-exclusive result. The device further includes:

[0226] The second determining module is used to determine the remaining auction quantity of the auction object in the auction transaction based on the ranking and maximum auction quantity of the auction price information in the non-exclusive results.

[0227] The third determining module is used to determine that the bidder has successfully bid for the auction transaction and update the remaining auction quantity of the auction object in the auction transaction when the remaining auction quantity is greater than or equal to 1 and the second node corresponding to the bidder who failed the auction has received an auction application request for the auction price information.

[0228] The sixth sending module is used to send the fifth encrypted information to the third node when the remaining auction quantity is zero or the auction time expires. The fifth encrypted information includes encrypted information of the second auction result of the auction transaction, which is an updated auction result based on the first auction result.

[0229] Optionally, the device further includes:

[0230] The seventh sending module is used to send the public key of the first node to the second node and the third node respectively when it receives a complaint request from the second node regarding the second auction result;

[0231] The sixth receiving module is used to receive the seventh ciphertext information sent by the second node and the eighth ciphertext information sent by the third node. The seventh ciphertext information is obtained by the second node encrypting the bidder's bid information based on the first node's public key, and the eighth ciphertext information is obtained by the third node encrypting the auction price information of the auctioneer based on the first node's public key.

[0232] The first comparison module is used to compare the bid information obtained by decrypting the seventh ciphertext information with the auction price information obtained by decrypting the eighth ciphertext information to obtain the first comparison result.

[0233] The fourth determining module is used to determine and report the complaint result to the second node based on the first comparison result.

[0234] Optionally, the device further includes:

[0235] The fifth determination module is used to determine the bid type of the bidder corresponding to the second node that initiated the complaint request, based on the bid type stored by each bidder in the blockchain when making a bid.

[0236] The acquisition module is used to acquire the auction type stored in the third node corresponding to the auctioneer in the blockchain. The auction type indicates whether the auctioneer is auctioning the auction object in an exclusive manner.

[0237] The second comparison module is used to compare the bid type of the bidder corresponding to the second node that initiated the complaint request with the auction type to obtain the second comparison result;

[0238] The seventh sending module is specifically used for:

[0239] If the second comparison result indicates that the bid type of the bidder corresponding to the second node that initiated the complaint request is consistent with the auction type, the public key of the first node is sent to the second node and the third node respectively.

[0240] Optionally, the first information further includes sixth ciphertext information, which is obtained by the second node encrypting a generated random string based on the public key of the first node. The device further includes:

[0241] The first hash processing module is used to perform hash processing on the bid information obtained by decrypting the first ciphertext information and the random string obtained by decrypting the sixth ciphertext information to obtain the first hash value;

[0242] The verification module is used to remove the bidding information corresponding to the first hash value and determine that the bidder corresponding to the second node has failed the auction if the first hash value is different from the second hash value uploaded by the second node in the blockchain. The second hash value is obtained by the second node through hash calculation based on the bidder's bidding information for the auction transaction and a generated random string. The second information does not include the second ciphertext information of the bidding information corresponding to the first hash value.

[0243] The auction transaction device 600 can implement all the processes implemented in the above-mentioned first node-side auction transaction method embodiment and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0244] See Figure 7 , Figure 7 This is a second schematic diagram of an auction transaction device provided in this application embodiment, applied to a second node, where the second node is the node corresponding to the bidder in the auction transaction. The auction transaction device 700 includes:

[0245] The third receiving module 701 is used to receive the public key of the first node sent by the first node when initiating an auction application request to participate in an auction transaction published for the third node. The first node is used to process the auction transaction, and the third node is the node corresponding to the auctioneer of the auction transaction.

[0246] The fourth sending module 702 is used to send the first information to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node.

[0247] The fourth receiving module 703 is used to receive fourth encrypted information sent by the first node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction. The first auction result is determined by the first node based on the auction price information indicated by the third encrypted information in the third information sent by the third node. If the first encrypted information is decrypted to obtain the bid information, the module sends second information to the third node. The second information includes the second encrypted information of the bid information and the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second encrypted information.

[0248] Optionally, the first information further includes sixth ciphertext information, which is obtained by the second node encrypting a generated random string based on the public key of the first node. The device further includes:

[0249] The second hash processing module is used to perform hash calculations on the generated random string and bid information to obtain the second hash value;

[0250] The first upload module is used to upload the second hash value to the blockchain. The second hash value is used by the first node to verify the authenticity of the bidding information in the first information.

[0251] Optionally, the first information further includes a bid type, which indicates whether the bidder is making an exclusive bid for the auctioned object in the auction transaction. The device further includes:

[0252] The second upload module is used to upload the bid type to the blockchain; wherein,

[0253] The bid type is used by the third node to determine the auction type of the auctioneer. The auction type indicates whether the auctioneer is auctioning the auction object in an exclusive manner, and is also used by the first node to process the complaint request initiated by the second node.

[0254] The auction transaction device 700 can implement all the processes implemented in the above-described second-node side auction transaction method embodiment and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0255] See Figure 8 , Figure 8 This is the third structural schematic diagram of an auction transaction device provided in this application embodiment, applied to the third node, which is the node corresponding to the auctioneer in the auction transaction, such as... Figure 8 As shown, the auction transaction device 800 includes:

[0256] The fifth receiving module 801 is used to receive second information sent by the first node when an auction transaction is published. The second information includes second ciphertext information of the bid information and the public key of the first node. The first information is sent by the second node to the first node. The first information includes first ciphertext information. The first ciphertext information is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The public key of the first node is sent by the first node to the second node when it receives the auction application request from the second node to participate in the auction transaction published by the third node. The first node is used to process the auction transaction, and the second node is the node corresponding to the bidder of the auction transaction.

[0257] The fifth sending module 802 is used to send third information to the first node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information. The auction price information is used to determine the first auction result of the auction transaction.

[0258] Optionally, the device further includes:

[0259] The decryption module is used to decrypt the second ciphertext information based on the private key of the third node to obtain the bid information carrying the signature information;

[0260] The designing module is used to design the signature information based on the public key of the first node to obtain a third hash value;

[0261] The third hash processing module is used to perform hash calculations on the decrypted bid information to obtain the fourth hash value;

[0262] The third comparison module is used to compare the third hash value and the fourth hash value to obtain the third comparison result;

[0263] The fifth sending module 802 is specifically used to send third information to the first node when the third comparison result indicates that the third hash value and the fourth hash value are consistent.

[0264] Optionally, the device further includes:

[0265] The seventh receiving module is configured to receive the fifth encrypted information sent by the first node. The fifth encrypted information includes encrypted information of the second auction result of the auction transaction, wherein the second auction result is the first auction result, or an auction result updated based on the first auction result; wherein...

[0266] When the auction price information is determined from the non-exclusive result obtained by the third node from the decryption of the second ciphertext information, the second auction result is an auction result updated based on the first auction result. The non-exclusive result includes the top N bids in the non-exclusive bid set, where N is the maximum number of auctioned items in the auction transaction and is a positive integer greater than 1. The non-exclusive bid set includes bids that are not exclusive. The third information also includes the ranking of the auction price information in the non-exclusive result. When the first node determines that the remaining number of auctions is greater than or equal to 1 based on the ranking of the auction price information in the non-exclusive result and the maximum number of auctions, and receives an auction application request from the second node corresponding to the bidder whose auction failed, the first auction result is updated.

[0267] The auction transaction device 800 can implement all the processes implemented in the above-mentioned third-node side auction transaction method embodiment and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0268] See Figure 9 The figure shows a schematic diagram of the node structure provided in an embodiment of the present invention. Figure 9 As shown, node 900 includes: processor 901, memory 902, user interface 903, and bus interface 904. This node can be a first node, a second node, or a third node.

[0269] Processor 901 is used to read the program in memory 902 and execute the steps of the auction transaction method on any of the nodes.

[0270] exist Figure 9 In this context, the bus architecture can include any number of interconnected buses and bridges, specifically linking various circuits of one or more processors represented by processor 901 and memory represented by memory 902 together. The bus architecture can also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. Bus interface 904 provides an interface. For different user devices, user interface 903 can also be an interface capable of connecting external or internal devices, including but not limited to keypads, displays, speakers, microphones, joysticks, etc.

[0271] The processor 901 is responsible for managing the bus architecture and general processing, while the memory 902 can store the data used by the processor 901 when performing operations.

[0272] Preferably, this embodiment of the invention also provides a node 900, including a processor 901, a memory 902, and a computer program stored in the memory 902 and executable on the processor 901. When the computer program is executed by the processor 901, it implements the various processes of the first node-side auction transaction method embodiment described above, or the various processes of the second node-side auction transaction method embodiment described above, or the various processes of the third node-side auction transaction method embodiment described above, and can achieve the same technical effect. To avoid repetition, it will not be described again here.

[0273] This invention also provides a readable storage medium storing a computer program. When executed by a processor, this computer program implements the various processes of the auction transaction methods described above for the first node side, second node side, or third node side, and achieves the same technical effects. To avoid repetition, these processes will not be described again here. The readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0274] This application also provides a computer program product, including computer instructions. When executed by a processor, these computer instructions implement the various processes of the above-described first node-side, second node-side, or third node-side auction transaction method embodiments and achieve the same technical effects. To avoid repetition, these instructions will not be described again here.

[0275] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0276] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0277] In the embodiments provided in this application, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the system embodiments described above are merely illustrative. For instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interfaces, devices, or units, and may be electrical, mechanical, or other forms.

[0278] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of the embodiments of the present invention, depending on actual needs.

[0279] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0280] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, essentially, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

[0281] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. An auction transaction method, characterized in that, Applied to a first node, which processes auction transactions, the method includes: Upon receiving an auction application request from the second node to participate in an auction transaction published by the third node, the public key of the first node is sent to the second node, where the second node is the node corresponding to the bidder in the auction transaction and the third node is the node corresponding to the auctioneer in the auction transaction. The system receives first information sent by the second node for the auction transaction. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. If the first ciphertext information is decrypted to obtain the bid information, the second information is sent to the third node. The second information includes the second ciphertext information of the bid information and the public key of the first node. The third information sent by the third node includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node, wherein the auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information; The fourth encrypted information is sent to the second node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction, which is determined by the first node based on the auction price information.

2. The method according to claim 1, characterized in that, Before sending the second information to the third node, the method further includes: Sort the bid information of the bidders; The bidding results are determined, which include the top N bids. The second ciphertext information is the ciphertext information of the bids in the bidding results. N is the maximum number of auctioned items in the auction transaction, and N is a positive integer greater than or equal to 1.

3. The method according to claim 2, characterized in that, The auction object in the auction transaction is data, and the auction transaction includes any of the following: The data provider is the auctioneer, and the data developer is the bidder; The data developer is the auctioneer, and the data buyer is the bidder; The data buyer is the auctioneer, and the data developer is the bidder; Specifically, in the case where the data provider is the auctioneer and the data developer is the bidder; or in the case where the data developer is the auctioneer and the data buyer is the bidder, the bid information of the bidders is sorted in descending order; and in the case where the data buyer is the auctioneer and the data developer is the bidder, the bid information of the bidders is sorted in ascending order.

4. The method according to claim 2, characterized in that, The first information also includes the bid type, which indicates whether the bidder is bidding exclusively for the auction object in the auction transaction. The sorting of the bidders' bid information includes: Based on the bid type, the bid information of the bidder is classified to obtain an exclusive bid set and a non-exclusive bid set. The exclusive bid set includes bid information in an exclusive manner, and the non-exclusive bid set includes bid information not in an exclusive manner. Sort the exclusive bid set and the non-exclusive bid set respectively; The determined bid result includes: Determine exclusive and non-exclusive results. The bidding results include both exclusive and non-exclusive results. The exclusive result is the bid information ranked first in the exclusive bidding set, and the non-exclusive result includes the bid information ranked among the top N in the non-exclusive bidding set.

5. The method according to claim 1, characterized in that, Before sending the second information to the third node, the method further includes: The bid information is digitally signed to obtain bid information carrying the signature information; Based on the public key of the third node, the bid information carrying the signature information is encrypted to obtain the second ciphertext information.

6. The method according to claim 4, characterized in that, The auction price information is determined by the third node from the non-exclusive result obtained by decrypting the second ciphertext information. The third information also includes the ranking of the auction price information in the non-exclusive result. After sending the fourth ciphertext information to the second node, the method further includes: Based on the ranking and maximum auction quantity of the auction price information in the non-exclusive results, the remaining auction quantity of the auction object in the auction transaction is determined. If the remaining auction quantity is greater than or equal to 1, and an auction application request for the auction price information is received from the second node corresponding to the bidder who failed the auction, it is determined that the bidder has successfully auctioned the auction transaction, and the remaining auction quantity of the auction object in the auction transaction is updated. If the remaining auction quantity is zero or the auction time expires, the fifth encrypted information is sent to the third node. The fifth encrypted information includes the encrypted information of the second auction result of the auction transaction, which is an updated auction result based on the first auction result.

7. The method according to claim 6, characterized in that, After sending the fourth ciphertext information to the second node, the method further includes: Upon receiving a complaint request from the second node regarding the second auction result, the public key of the first node is sent to both the second and third nodes. The system receives the seventh ciphertext information sent by the second node and the eighth ciphertext information sent by the third node. The seventh ciphertext information is obtained by the second node encrypting the bidder's bid information based on the first node's public key, and the eighth ciphertext information is obtained by the third node encrypting the auction price information of the auctioneer based on the first node's public key. The bidding information obtained by decrypting the seventh ciphertext is compared with the auction price information obtained by decrypting the eighth ciphertext to obtain the first comparison result. Based on the first comparison result, the complaint result is determined and fed back to the second node.

8. The method according to claim 7, characterized in that, Before sending the public key of the first node to the second and third nodes respectively, the method further includes: Based on the bid types stored by each bidder in the blockchain, determine the bid type of the bidder corresponding to the second node that initiated the complaint request; Obtain the auction type stored in the third node corresponding to the auctioneer in the blockchain. The auction type indicates whether the auctioneer is auctioning the auction object in an exclusive manner. The bid type of the bidder corresponding to the second node that initiated the complaint request is compared with the auction type to obtain the second comparison result; The step of sending the public key of the first node to the second and third nodes respectively includes: If the second comparison result indicates that the bid type of the bidder corresponding to the second node that initiated the complaint request is consistent with the auction type, the public key of the first node is sent to the second node and the third node respectively.

9. The method according to claim 1, characterized in that, The first information also includes sixth ciphertext information, which is obtained by the second node encrypting a generated random string based on the public key of the first node. Before sending the second information to the third node, the method further includes: The bidding information obtained by decrypting the first ciphertext information and the random string obtained by decrypting the sixth ciphertext information are hashed to obtain the first hash value; If the first hash value is different from the second hash value uploaded by the second node in the blockchain, the bidding information corresponding to the first hash value is removed, and it is determined that the bidder corresponding to the second node has failed the auction. The second hash value is obtained by the second node through hash calculation based on the bidder's bidding information for the auction transaction and the generated random string. The second information does not include the second ciphertext information of the bidding information corresponding to the first hash value.

10. An auction transaction method, characterized in that, Applied to a second node, which is the node corresponding to the bidder in the auction transaction, the method includes: When initiating an auction application request to participate in an auction transaction published for a third node, the first node sends the public key of the first node, which is used to process the auction transaction, and the third node is the node corresponding to the auctioneer of the auction transaction. The first information is sent to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The system receives fourth encrypted information sent by the first node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction. The first auction result is determined by the first node based on the auction price information indicated by the third encrypted information in the third information sent by the third node. If the first encrypted information is decrypted to obtain the bid information, the system sends second information to the third node. The second information includes second encrypted information of the bid information and the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second encrypted information.

11. The method according to claim 10, characterized in that, The first information also includes sixth ciphertext information, which is obtained by the second node encrypting a generated random string based on the public key of the first node. Before sending the first information to the first node, the method further includes: The generated random string and bid information are hashed to obtain a second hash value; The second hash value is uploaded to the blockchain, and the second hash value is used by the first node to verify the authenticity of the bidding information in the first information.

12. The method according to claim 10 or 11, characterized in that, The first information also includes a bid type, which indicates whether the bidder is making an exclusive bid for the auction object in the auction transaction. Before sending the first information to the first node, the method further includes: The bid type is uploaded to the blockchain; wherein, The bid type is used by the third node to determine the auction type of the auctioneer. The auction type indicates whether the auctioneer is auctioning the auction object in an exclusive manner, and is also used by the first node to process the complaint request initiated by the second node.

13. An auction transaction method, characterized in that, Applied to a third node, which is the node corresponding to the auctioneer in the auction transaction, the method includes: In the case of publishing an auction transaction, the system receives second information sent by the first node. The second information includes second ciphertext information of the bid information and the public key of the first node. The first information is sent by the second node to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The public key of the first node is sent by the first node to the second node when it receives the auction application request from the second node to participate in the auction transaction published by the third node. The first node is used to process the auction transaction, and the second node is the node corresponding to the bidder of the auction transaction. The third information is sent to the first node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information. The auction price information is used to determine the first auction result of the auction transaction.

14. The method according to claim 13, characterized in that, Before sending the third information to the first node, the method further includes: The second ciphertext information is decrypted based on the private key of the third node to obtain the bid information carrying the signature information; The signature information is designed based on the public key of the first node to obtain a third hash value; The decrypted bid information is hashed to obtain a fourth hash value; The third hash value and the fourth hash value are compared to obtain the third comparison result; Sending the third information to the first node includes: If the third comparison result indicates that the third hash value and the fourth hash value are consistent, the third information is sent to the first node.

15. The method according to claim 13, characterized in that, After sending the third information to the first node, the method further includes: The system receives fifth encrypted information sent by the first node. This fifth encrypted information includes encrypted information of the second auction result of the auction transaction, where the second auction result is the first auction result, or an auction result updated based on the first auction result. When the auction price information is determined from the non-exclusive result obtained by the third node from the decryption of the second ciphertext information, the second auction result is an auction result updated based on the first auction result. The non-exclusive result includes the top N bids in the non-exclusive bid set, where N is the maximum number of auctioned items in the auction transaction and is a positive integer greater than 1. The non-exclusive bid set includes bids that are not exclusive. The third information also includes the ranking of the auction price information in the non-exclusive result. When the first node determines that the remaining number of auctions is greater than or equal to 1 based on the ranking of the auction price information in the non-exclusive result and the maximum number of auctions, and receives an auction application request from the second node corresponding to the bidder whose auction failed, the first auction result is updated.

16. An auction transaction device, characterized in that, Applied to a first node for processing auction transactions, the apparatus includes: The first sending module is used to send the public key of the first node to the second node when it receives an auction application request from the second node to participate in an auction transaction published by the third node. The second node is the node corresponding to the bidder in the auction transaction, and the third node is the node corresponding to the auctioneer in the auction transaction. The first receiving module is used to receive the first information sent by the second node for the auction transaction. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The second sending module is used to send second information to the third node after decrypting the first ciphertext information to obtain the bid information. The second information includes the second ciphertext information of the bid information and the public key of the first node. The second receiving module is used to receive third information sent by the third node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information. The third sending module is used to send fourth encrypted information to the second node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction, which is determined by the first node based on the auction price information.

17. An auction transaction device, characterized in that, Applied to a second node, which is the node corresponding to the bidder in the auction transaction, the device includes: The third receiving module is used to receive the public key of the first node sent by the first node when an auction application request is initiated to participate in an auction transaction published for the third node. The first node is used to process the auction transaction, and the third node is the node corresponding to the auctioneer of the auction transaction. The fourth sending module is used to send the first information to the first node. The first information includes the first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The fourth receiving module is used to receive fourth encrypted information sent by the first node. The fourth encrypted information includes encrypted information of the first auction result of the auction transaction. The first auction result is determined by the first node based on the auction price information indicated by the third encrypted information in the third information sent by the third node. If the first encrypted information is decrypted to obtain the bid information, the module sends second information to the third node. The second information includes the second encrypted information of the bid information and the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second encrypted information.

18. An auction transaction device, characterized in that, Applied to a third node, which is the node corresponding to the auctioneer in the auction transaction, the device includes: The fifth receiving module is used to receive second information sent by the first node when an auction transaction is published. The second information includes second ciphertext information of the bid information and the public key of the first node. The first information is sent by the second node to the first node. The first information includes first ciphertext information, which is obtained by the second node encrypting the bid information of the bidder for the auction transaction based on the public key of the first node. The public key of the first node is sent by the first node to the second node when it receives the auction application request from the second node to participate in the auction transaction published by the third node. The first node is used to process the auction transaction, and the second node is the node corresponding to the bidder of the auction transaction. The fifth sending module is used to send third information to the first node. The third information includes: third ciphertext information obtained by the third node encrypting the auction price information based on the public key of the first node. The auction price information is determined by the third node from the bid information obtained by decrypting the second ciphertext information. The auction price information is used to determine the first auction result of the auction transaction.

19. A node, characterized in that, include: A processor, a memory, and a program stored in the memory and executable on the processor, wherein the program, when executed by the processor, implements the steps of the auction transaction method as described in any one of claims 1 to 15.

20. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the auction transaction method as described in any one of claims 1 to 15.

21. A computer program product, characterized in that, It includes computer instructions that, when executed by a processor, implement the steps of the auction transaction method as described in any one of claims 1 to 15.

Images