Information processing method and device based on block chain, and electronic equipment

Abstract

The invention discloses an information processing method and device based on a block chain and electronic equipment, and relates to the technical field of block chains, and the information processing method comprises the steps: receiving a qualification pre-auditing file uploaded by each second-class participant, determining a second type of participants indicated by the qualified pre-auditing file passing the pre-auditing as second type of qualified participants, receiving bidding tuple data uploaded by each second type of qualified participants, and receiving a bidding hidden bit tuple calculated by each second type of qualified participants based on the first public array, and determining a second type of target participants from all the second type of qualified participants based on all the bidding hidden bit groups. According to the method and the device, the technical problem that the bid winner cannot be fairly determined due to the fact that the bid inviting program is managed and executed by depending on a concentrated third-party database and an authorized organization in the related technology is solved.

Description

Technical Field

[0001] The present invention relates to the field of blockchain technology, and in particular to a blockchain-based information processing method and device, and an electronic device. Background Art

[0002] Currently, project bidding methods are usually centralized and rely on the participation of third parties, which raises issues such as data security, transparency, and traceability. Specifically, the bidding process is an important stage in the project and occurs between the tenderer and the bidder. The bidder submits a project proposal to undertake a specific project, and the main goal of the bidding is to award the contract to the qualified contractor who provides the best proposal. The traditional bidding process relies on paper work and the participation of trusted parties, so the possibility of fraud and collusion cannot be completely ruled out. For example, bribery and manipulation may lead to the disclosure or tampering of the proposal content, and the evaluation process may also be unfair, thus affecting the openness of the contract award.

[0003] In related technologies, the bidding process can be accelerated and management costs can be reduced through electronic bidding systems. However, these systems rely on centralized third-party databases and authorized organizations to manage and execute procedures, which is prone to the risk of fraud, collusion, corruption and manipulation. For example, proposals may be revealed in advance or bidding information stored in centralized databases may be manipulated, leading to data security and traceability risks. Centralized data storage makes participants' sensitive data vulnerable to attacks. Therefore, there is an urgent need for a secure, immutable, traceable and transparent method to ensure the fairness of the entire bidding process.

[0004] To address the above-mentioned problems, no effective solution has been proposed yet. Summary of the invention

[0005] The embodiments of the present invention provide a blockchain-based information processing method and device, and an electronic device, so as to at least solve the technical problem in the related art that the successful bidder cannot be determined fairly due to reliance on a centralized third-party database and authorized organizations to manage and execute bidding procedures.

[0006] According to one aspect of an embodiment of the present invention, there is provided a blockchain-based information processing method, which is applied to a preset smart contract pre-deployed on a blockchain by a first-category participant, and includes: receiving a prequalification document uploaded by each second-category participant, and determining the second-category participant indicated by the prequalification document that has passed the prequalification as a second-category qualified participant; receiving bid tuple data uploaded by each second-category qualified participant, wherein the bid tuple data includes at least: a commitment value, a deposit value, a first public array, and a second public array; receiving a bid hidden byte calculated by each second-category qualified participant based on the first public array; and determining a second-category target participant from all second-category qualified participants based on all the bid hidden bytes.

[0007] Furthermore, before receiving the prequalification documents uploaded by each second-category participant, it also includes: receiving the prequalification standard score file and the preset qualification threshold uploaded by the first-category participant, wherein the prequalification standard score file includes: a score table corresponding to each prequalification standard.

[0008] Furthermore, the prequalification document includes: the actual number of each of the prequalification criteria, and after receiving the prequalification document uploaded by each second-category participant, it also includes: forwarding each of the prequalification documents to the first blockchain node corresponding to the first-category participant, wherein the first-category participant obtains the prequalification document from the first blockchain node and verifies the accuracy of the prequalification document; when the accuracy of the prequalification document is verified, determining the prequalification value of the prequalification standard based on the score table and the actual number of each prequalification standard; accumulating the prequalification values ​​of all the prequalification standards to obtain the prequalification total value of the prequalification document; when the prequalification total value is greater than the preset qualified threshold, determining that the prequalification document has passed the prequalification.

[0009] Furthermore, the step of receiving the bidding tuple data uploaded by each second-category qualified participant includes: receiving the deposit value uploaded by each second-category qualified participant, and inputting the preset byte length and the deposit value into the preset deployment function to generate generator parameters and a commitment random number; forwarding the generator parameters and the commitment random number to the second blockchain node corresponding to each second-category qualified participant, wherein each second-category qualified participant generates the commitment value based on the generator parameters, the bid price, the commitment random number and the encrypted random number; receiving the first public array and the second public array uploaded by each second-category qualified participant, wherein each first public number in the first public array is determined based on the first secret element in the secret element pair selected by the second-category qualified participant and the generator parameters, and each second public number in the second public array is determined based on the second secret element in the secret element pair selected by the second-category qualified participant and the generator parameters.

[0010] Furthermore, the bid price of each second-category qualified participant is represented in binary. Before receiving the bid hidden byte calculated by each second-category qualified participant based on the first public array, it also includes: each second-category qualified participant calculates the public parameter corresponding to each bit in the bid price based on the first public array of all other second-category qualified participants; each second-category qualified participant calculates the hidden bit of the bit based on the public parameter of the bit and the first secret element when the bit is 1; each second-category qualified participant calculates the hidden bit of the bit based on the public parameter of the bit and the second secret element when the bit is 0; each second-category qualified participant constructs the bid hidden byte based on the hidden bits of all the bits in the bid price.

[0011] Furthermore, each second-category qualified participant corresponds to a participation number, and each second-category qualified participant calculates the public parameter corresponding to each bit in the bid price based on the first public array of all other second-category qualified participants, including: for each second-category qualified participant, determine all first other second-category qualified participants with a participation number smaller than the second-category qualified participant and all second other second-category qualified participants with a participation number greater than the second-category qualified participant; based on the first public array of all the first other second-category qualified participants and the first public array of all the second other second-category qualified participants, calculate the public parameter corresponding to each bit in the bid price.

[0012] Furthermore, based on all the bid concealed bytes, the step of determining the second category target participants from all the second category qualified participants includes: multiplying the same-place concealed bits in all the bid concealed bytes to obtain the settlement bit of the bit; generating a settlement tuple based on all the settlement bits; calculating the absolute difference between each of the bid concealed bytes and the settlement tuple; and selecting the second category qualified participants corresponding to the bid concealed byte indicated by the minimum absolute difference to determine them as the second category target participants.

[0013] Furthermore, each of the second-category qualified participants uploads a verification public parameter array to the preset smart contract. After determining the second-category target participant from all the second-category qualified participants based on all the bidding hidden bytes, it also includes: when the second-category target participant successfully verifies the commitment value based on the encrypted random number, issuing a signing contract to the second-category target participant; when the second-category target participant signs the signing contract, verifying the deposit value of the second-category qualified participant based on the public parameter array; when the deposit value is verified, returning the deposit value to the second-category qualified participant.

[0014] According to another aspect of an embodiment of the present invention, there is also provided a blockchain-based information processing device, which is applied to a preset smart contract pre-deployed on a blockchain by a first-category participant, and includes: a first determination unit, for receiving a prequalification document uploaded by each second-category participant, and determining the second-category participant indicated by the prequalification document that has passed the prequalification as a second-category qualified participant; a first receiving unit, for receiving bid tuple data uploaded by each second-category qualified participant, wherein the bid tuple data includes at least: a commitment value, a deposit value, a first public array, and a second public array; a second receiving unit, for receiving a bid hidden byte calculated by each second-category qualified participant based on the first public array; and a second determination unit, for determining a second-category target participant from all second-category qualified participants based on all the bid hidden bytes.

[0015] Furthermore, the information processing device also includes: a first receiving module, which is used to receive the prequalification standard score file uploaded by the first category of participants and a preset qualification threshold before receiving the prequalification document uploaded by each second category of participants, wherein the prequalification standard score file includes: a score table corresponding to each prequalification standard.

[0016] Furthermore, the prequalification document includes: the actual number of each of the prequalification criteria, and the information processing device also includes: a first forwarding module, which is used to forward each of the prequalification documents uploaded by each second-category participant to the first blockchain node corresponding to the first-category participant after receiving the prequalification document uploaded by each second-category participant, wherein the first-category participant obtains the prequalification document from the first blockchain node and verifies the accuracy of the prequalification document; a first determination module, which is used to determine the prequalification value of the prequalification standard based on the score table and the actual number of each prequalification standard when the accuracy of the prequalification document is verified; a first accumulation module, which is used to accumulate the prequalification values ​​of all the prequalification standards to obtain the prequalification total value of the prequalification document; and a second determination module, which is used to determine that the prequalification of the prequalification document is passed when the prequalification total value is greater than the preset qualified threshold.

[0017] Furthermore, the first receiving unit includes: a second receiving module, used to receive the deposit value uploaded by each second-category qualified participant, and input the preset byte length and the deposit value into the preset deployment function to generate generator parameters and a commitment random number; a second forwarding module, used to forward the generator parameters and the commitment random number to the second blockchain node corresponding to each second-category qualified participant, wherein each second-category qualified participant generates the commitment value based on the generator parameters, the bid price, the commitment random number and the encrypted random number; a third receiving module, used to receive the first public array and the second public array uploaded by each second-category qualified participant, wherein each first public number in the first public array is determined based on the first secret element in the secret element pair selected by the second-category qualified participant and the generator parameters, and each second public number in the second public array is determined based on the second secret element in the secret element pair selected by the second-category qualified participant and the generator parameters.

[0018] Furthermore, the bid price of each second-category qualified participant is expressed in binary, and the information processing device also includes: a first calculation module, used for, before receiving the bid hidden byte calculated by each second-category qualified participant based on the first public array, each second-category qualified participant calculates the public parameter corresponding to each bit in the bid price based on the first public array of all other second-category qualified participants; a second calculation module, used for each second-category qualified participant to calculate the hidden bit of the bit based on the public parameter of the bit and the first secret element when the bit is 1; a third calculation module, used for each second-category qualified participant to calculate the hidden bit of the bit based on the public parameter of the bit and the second secret element when the bit is 0; a first construction module, used for each second-category qualified participant to construct the bid hidden byte based on the hidden bits of all the bits in the bid price.

[0019] Furthermore, each second-category qualified participant corresponds to a participation number, and the first calculation module includes: a first determination submodule, used to determine, for each second-category qualified participant, all first other second-category qualified participants with a participation number smaller than the second-category qualified participant and all second other second-category qualified participants with a participation number greater than the second-category qualified participant; a first calculation submodule, used to calculate the public parameter corresponding to each bit in the bid price based on the first public array of all the first other second-category qualified participants and the first public array of all the second other second-category qualified participants.

[0020] Furthermore, the second determination unit includes: a first multiplication module, used to multiply the same-bit hidden bits in all the bid hidden bytes to obtain the settlement bit of the bit; a first generation module, used to generate a settlement tuple based on all the settlement bits; a fourth calculation module, used to calculate the absolute difference between each of the bid hidden bytes and the settlement tuple; and a first selection module, used to select the second-category qualified participants corresponding to the bid hidden bytes indicated by the minimum absolute difference and determine them as the second-category target participants.

[0021] Furthermore, each of the second-category qualified participants uploads a verification public parameter array to the preset smart contract, and the information processing device also includes: a first issuing module, which is used to determine the second-category target participant from all the second-category qualified participants based on all the bidding hidden bytes, and then issue a signing contract to the second-category target participant if the second-category target participant successfully verifies the commitment value based on the encrypted random number; a first verification module, which is used to verify the deposit value of the second-category qualified participant based on the public parameter array when the second-category target participant signs the signing contract; and a first refund module, which is used to refund the deposit value to the second-category qualified participant if the deposit value is verified successfully.

[0022] According to another aspect of an embodiment of the present invention, there is also provided an electronic device, comprising one or more processors and a memory, wherein the memory is used to store one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement any one of the above-mentioned blockchain-based information processing methods.

[0023] In the present invention, the prequalification documents uploaded by each second-category participant are received, and the second-category participants indicated by the prequalification documents that have passed the prequalification are determined as second-category qualified participants, the bidding tuple data uploaded by each second-category qualified participant is received, the bidding hidden bytes calculated by each second-category qualified participant based on the first public array are received, and based on all the bidding hidden bytes, the second-category target participants are determined from all second-category qualified participants.

[0024] In the present invention, the first-class participant (i.e., the tenderer) can pre-deploy a preset smart contract on the blockchain to receive the prequalification documents uploaded by each second-class participant (i.e., the bidder) through the preset smart contract, and determine the second-class participant that has passed the prequalification as the second-class qualified participant (i.e., the qualified bidder), and then receive the bidding tuple data and bidding hidden bytes uploaded by each second-class qualified participant, and determine the second-class target participant (i.e., the successful bidder) by processing all bidding hidden bytes. By executing the entire bidding process through the preset smart contract, a safe, transparent, and efficient bidding environment can be provided, reducing dependence on third parties, effectively avoiding fraud and corruption, and improving the fairness and transparency of the entire bidding process. The successful bidder can be determined fairly, thereby solving the technical problem in the related art that the successful bidder cannot be determined fairly due to reliance on centralized third-party databases and authorized organizations to manage and execute bidding procedures. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:

[0026] Figure 1 is a flowchart of an optional blockchain-based information processing method according to an embodiment of the present invention;

[0027] Figure 2 is a schematic diagram of an optional margin management business process according to an embodiment of the present invention;

[0028] Figure 3 is a schematic diagram of an optional blockchain bidding system according to an embodiment of the present invention;

[0029] Figure 4 is a schematic diagram of an optional bidding business process according to an embodiment of the present invention;

[0030] Figure 5 is a schematic diagram of an optional blockchain-based information processing device according to an embodiment of the present invention;

[0031] Figure 6 This is a hardware structure block diagram of an electronic device (or mobile device) for a blockchain-based information processing method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0032] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0033] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0034] Based on blockchain technology, the present invention proposes a decentralized bidding management system based on blockchain smart contracts. The bidding system deploys the entire bidding process in a smart contract on a decentralized public blockchain to eliminate human intervention and rebuild trust among bidding participants. The bidding system helps to provide a safe, transparent and efficient bidding environment, reduce dependence on third parties, avoid fraud and corruption, and improve the fairness and transparency of the entire bidding process.

[0035] In addition, the current bid bond processing usually requires a lot of manual operations (including: the collection, safekeeping and refund of funds), which is not only inefficient but also prone to errors. In traditional electronic processing systems, the refund of the bond relies on manual review and processing, which may cause unnecessary delays. It is usually difficult for bidders to understand the status of the bond and the progress of the processing in real time, and there is a lack of transparency. In addition, manual processing and traditional electronic processing also face security risks, such as illegal access or misappropriation of funds. Therefore, in response to the above problems, the present invention uses smart contracts to execute the collection, locking, liquidated damages, refund and other operations of the bid bond, which can improve the speed and accuracy of the bid bond processing and solve the problems of cumbersome manual processing and delays.

[0036] Since there is a need for a secure, immutable, traceable and transparent method to ensure the fairness of the entire bidding process, and the development of blockchain technology and smart contracts provides a solution for establishing a decentralized, secure, reliable and transparent bidding platform. Therefore, the present invention uses blockchain technology to solve the following technical problems existing in the current bidding method: (1) Centralization and dependence on third parties: The current bidding process is highly dependent on centralized organizers and third parties to execute and manage the process, which easily leads to problems with data security, transparency and traceability; (2) Fairness and security issues: Since bidders must trust organizers to ensure that the process is legal and fair, collusion, unfairness, insufficient bid confidentiality and information tampering may occur during the bidding process; (3) Limitations of electronic bidding systems: Although electronic bidding systems simplify the comparison process of bids and technical data, they still rely on centralized third-party databases and authorized organizations, and there are threats of fraud, collusion, corruption and manipulation. The privacy and security of centralized data storage are also vulnerable to attacks; (4) Inefficiency and risks in bid bond management: The current bid bond processing requires a lot of manual operations, which is inefficient and prone to errors. The refund of funds depends on manual review, which may lead to delays. In addition, manual processing and traditional electronic processing methods face security risks of illegal access or misappropriation of funds; (5) Lack of transparency: It is difficult for bidders to understand the status of the deposit and processing progress in real time, and there is a lack of transparency. This improves efficiency, transparency and security, and establishes a more fair and credible bidding system.

[0037] The present invention is described in detail below in conjunction with various embodiments.

[0038] Embodiment 1

[0039] According to an embodiment of the present invention, an embodiment of a blockchain-based information processing method is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in an order different from that shown here.

[0040] Figure 1 is a flowchart of an optional blockchain-based information processing method according to an embodiment of the present invention, such as Figure 1 As shown, the method comprises the following steps:

[0041] Step S101, receiving the prequalification documents uploaded by each second-category participant, and determining the second-category participants indicated by the prequalification documents that have passed the prequalification as second-category qualified participants.

[0042] Step S102, receiving the bidding tuple data uploaded by each second-category qualified participant, wherein the bidding tuple data at least includes: a commitment value, a deposit value, a first public array, and a second public array.

[0043] Step S103, receiving the bid hidden bytes calculated by each second-category qualified participant based on the first public array.

[0044] Step S104, based on all bidding hidden bytes, determining the second category target participants from all the second category qualified participants.

[0045] Through the above steps, the prequalification documents uploaded by each second-category participant can be received, and the second-category participant indicated by the prequalification documents that have passed the prequalification can be determined as a second-category qualified participant, the bidding tuple data uploaded by each second-category qualified participant can be received, and the bidding hidden bytes calculated by each second-category qualified participant based on the first public array can be received. Based on all bidding hidden bytes, the second-category target participant is determined from all second-category qualified participants. In an embodiment of the present invention, the first-category participant (i.e., the tenderer) can pre-deploy a preset smart contract on the blockchain to receive the prequalification documents uploaded by each second-category participant (i.e., the bidder) through the preset smart contract, and determine the second-category participant that has passed the prequalification as a second-category qualified participant (i.e., a qualified bidder), and then receive the bidding tuple data and bidding hidden bytes uploaded by each second-category qualified participant, and determine the second-category target participant (i.e., the successful bidder) by processing all bidding hidden bytes. By pre-setting smart contracts to execute the entire bidding process, a safe, transparent and efficient bidding environment can be provided, which reduces dependence on third parties, effectively avoids fraud and corruption, improves the fairness and transparency of the entire bidding process, and can fairly determine the successful bidder, thereby solving the technical problem in related technologies that the successful bidder cannot be fairly determined due to reliance on centralized third-party databases and authorized organizations to manage and execute bidding procedures.

[0046] The embodiment of the present invention is described in detail below in combination with the above steps.

[0047] In the embodiment of the present invention, a decentralized bidding management system based on blockchain smart contracts is proposed. The system ensures the authenticity and immutability of data through blockchain technology, and can reduce human errors and operating costs by automatically monitoring bidding activities and executing deposit refunds, providing transparent and efficient services to bidding participants, and promoting the digitalization and intelligent development of the bidding process.

[0048] In the embodiment of the present invention, system users are divided into tendering parties (i.e., first-class participants) and bidders (i.e., second-class participants). The tendering party needs to pre-deploy a preset smart contract on the blockchain to execute the bidding process through the preset smart contract.

[0049] Optionally, before receiving the prequalification documents uploaded by each second-category participant, the process further includes: receiving a prequalification standard score file uploaded by the first-category participant and a preset qualification threshold, wherein the prequalification standard score file includes: a score table corresponding to each prequalification standard.

[0050] In the embodiment of the present invention, before the tenderer starts to execute the tender process in the preset smart contract, it needs to determine the tender prequalification standards related to the financial and technical capabilities required by the tenderer (i.e., the prequalification standard score file), and define the relevant numerical basic scores for each prequalification standard (the score table corresponding to each prequalification standard). Since these prequalification standards are included as codes in the preset smart contract, any potential ambiguity in the tender prequalification decision can be eliminated.

[0051] In an embodiment of the present invention, the pre-qualification criteria for financial and technical capabilities do not include information related to the bid price, but include general information, such as the minimum operating years, turnover, or minimum number of projects completed by the organization. These pre-qualification criteria and their corresponding scores, as well as the minimum score required to pass the bid prequalification stage (i.e., the preset qualified threshold) need to be uploaded to the preset smart contract in advance. That is, the preset smart contract needs to receive the pre-qualification criteria score file uploaded by the first category of participants (i.e., a file containing a score table corresponding to each pre-qualification criterion) and the preset qualified threshold.

[0052] In the embodiment of the present invention, the purpose of the bid prequalification is to exclude unqualified bidders from the bidding process. In the bid prequalification, the bidder can answer questions through the system and submit relevant documents (i.e., prequalification documents) to prove that it has the necessary qualities and capabilities required to execute the project. After that, the preset smart contract will select qualified bidders that meet the financial and technical capability requirements.

[0053] Step S101, receiving the prequalification documents uploaded by each second-category participant, and determining the second-category participants indicated by the prequalification documents that have passed the prequalification as second-category qualified participants.

[0054] In step S101, the preset smart contract can receive the prequalification documents uploaded by each second-category participant, and then pre-examine each prequalification document according to the pre-examination standard score file uploaded by the first-category participant and the preset qualification threshold, so as to select the pre-examination passed prequalification documents, thereby obtaining the second-category qualified participants (i.e., qualified bidders).

[0055] Optionally, the prequalification document includes: the actual number of each prequalification criterion, and after receiving the prequalification document uploaded by each second-category participant, it also includes: forwarding each prequalification document to the first blockchain node corresponding to the first-category participant, wherein the first-category participant obtains the prequalification document from the first blockchain node and verifies the accuracy of the prequalification document; when the accuracy of the prequalification document is verified, determining the prequalification value of the prequalification criterion based on the score table and the actual number of each prequalification criterion; accumulating the prequalification values ​​of all prequalification standards to obtain the prequalification total value of the prequalification document; when the prequalification total value is greater than a preset qualified threshold, determining that the prequalification document has passed the prequalification.

[0056] In the embodiment of the present invention, the prequalification document includes: the actual number of each prequalification criterion, for example, the actual value of the prequalification criterion of minimum operating years (such as 3 years).

[0057] In an embodiment of the present invention, a preset smart contract can forward the prequalification documents of the bidder to the tendering party to approve the accuracy of the information (that is, forward each prequalification document to the first blockchain node corresponding to the first category of participants, so that the first category of participants obtain the prequalification documents from the first blockchain node and verify the accuracy of the prequalification documents). If the tendering party confirms the accuracy of the prequalification documents (that is, when the accuracy of the prequalification documents is verified to be passed), the preset smart contract can determine the prequalification value of the prequalification standard based on the score table and the actual quantity of each prequalification standard, and accumulate the prequalification values ​​of all prequalification standards to obtain the total prequalification value of the prequalification document. If the total prequalification value is greater than the preset qualified threshold, it is determined that the prequalification document is pre-qualified, thereby determining the bidder who is qualified to participate in the project bidding.

[0058] In the embodiment of the present invention, it is assumed that there are n bidders, and the bidder is denoted as B. i , i∈[1,n]. Let b i Indicates B i The bid price is expressed in binary as b i1 b i2 …b ij …b il , b il Where l is the binary length of the bid price, b ij is the jth bid price, b ij ∈{0,1} is the bid price, i represents the i-th bidder, and j represents the j-th binary digit of the bid price.

[0059] For example, if a bidder's bid price is 13, which is 1101 in 4-bit binary, then the corresponding b i1 =1, b i2 =1, b i3 =0, b i4 =1. So b ij In the above figure, i specifies which bidder it is, and j specifies the j-th binary digit of the bid price of this bidder. This representation method can easily operate and compare each bit price of each bidder separately.

[0060] In the embodiment of the present invention, in order to constrain the behavior of the bidder, the tenderer is required to pay a deposit during the bid submission stage. In this embodiment, the Pedersen commitment algorithm can be used to freeze the deposit. The specific algorithm is as follows: Let h be the random number in the Pedersen commitment process (i.e., the commitment random number), and bList stores the address of the bidder (i.e., the bidder account address). Let clearingPrice and winnerID represent the bid closing fee and the winning bidder, respectively. At the same time, assuming t beginCommit and t finishCommit is the start time and end time when the bidder submits its commitment to the blockchain. Assume that TS and TM represent the transmission e ij and calculate E j time. Among them, e ij represents the encrypted value or commitment (i.e., hidden bit) submitted by the i-th bidder for the j-th binary digit of its bid price, E j All bidders (B i ) e at the jth position ij The cumulative value is

[0061] Step S102, receiving the bidding tuple data uploaded by each second-category qualified participant, wherein the bidding tuple data at least includes: a commitment value, a deposit value, a first public array, and a second public array.

[0062] In step S102, each second-class qualified participant needs to call the AddBidder(·) function to upload the bidding tuple data (including: commitment value combid i , deposit value deposit, first public array pX, second public array pS). Among them, the commitment value combid i Indicates bidder B i Submitted a bid commitment to the preset smart contract for bidding party B i After winning the bid, it is verified that it is indeed the winner; the deposit value deposit is used to indicate that the bidder has submitted a deposit; the first public array pX and the second public array pS are parameters disclosed to other bidders based on the secret element pairs selected by the bidder. In this way, the privacy of the bidder is protected, and these values ​​can be used to participate in subsequent cryptographic operations.

[0063] In the embodiment of the present invention, the bidder B i After uploading the bidding tuple data, the preset smart contract authorizes bidder B i Participate in this bidding. If B i This is the first time to submit a combid i , then the preset smart contract will add the corresponding bidder address bList so that Bi Make subsequent bids as a legitimate bidder.

[0064] Optionally, the step of receiving the bidding tuple data uploaded by each second-class qualified participant includes: receiving the deposit value uploaded by each second-class qualified participant, and inputting the preset byte length and the deposit value into the preset deployment function to generate generator parameters and a commitment random number; forwarding the generator parameters and the commitment random number to the second blockchain node corresponding to each second-class qualified participant, wherein each second-class qualified participant generates a commitment value based on the generator parameters, the bid price, the commitment random number and the encrypted random number; receiving the first public array and the second public array uploaded by each second-class qualified participant, wherein each first public number in the first public array is determined based on the first secret element in the secret element pair selected by the second-class qualified participant and the generator parameters, and each second public number in the second public array is determined based on the second secret element in the secret element pair selected by the second-class qualified participant and the generator parameters.

[0065] In the embodiment of the present invention, a function Deploy(·) (i.e., a preset deployment function) is set, which takes the bit length l (i.e., the preset byte length) and the deposit deposit as input to generate some corresponding parameters (i.e., the generator parameter g and the commitment random number h). That is, after each second-class qualified participant uploads the deposit value to the preset smart contract, the preset smart contract can input the preset byte length and the deposit value into the preset deployment function to generate the generator parameter and the commitment random number, and forward the generator parameter and the commitment random number to the second blockchain node corresponding to each second-class qualified participant, so that each second-class qualified participant can generate the generator parameter g, the bid price b, and the bid price h. i , commitment random number h and encrypted random number comwit i , generate the commitment value combid i .

[0066] In the embodiment of the present invention, bidder B i A witness (random number) can be randomly selected as a witness i , and make a commitment, and calculate the corresponding commitment value

[0067] It should be noted that comwit i Bidder B i In order to hide the real bid price b i And a randomly selected value (random number) has only B i Know comwit i The specific value of the commitment value cannot be combined with other bidders iFrom b i information, thereby protecting B i When it is necessary to prove that a bidder is the final winner, the winner needs to publicly disclose the comwit i , other bidders can verify the bid commitments submitted by them i Whether it corresponds to the final winning bid price, but will not disclose the specific bids of other unsuccessful bidders. i It is a value randomly chosen by a bidder to hide the true bid price. It is used in the commitment stage. Only the winning bidder needs to disclose the opening price.

[0068] In the embodiment of the present invention, bidder B i The secret element pair needs to be randomly selected And calculate the public parameters For convenience, pX and pS are used to represent the first public number X. ij and the second public number S ij The array set (i.e., each first public array X in the first public array pX) ij is the first secret element x in a pair of secret elements selected by the second type of qualified participants ij and each second public number S in the second public array pS determined by the generator parameter g ij is the second secret element s in the secret element pair selected based on the second type of qualified participants ij Finally, bidder B i Call the function AddBidder(·) to upload the promise combid i To the preset smart contract.

[0069] It should be noted that Represents the first secret element x ij and the second secret element ij It's Z q Two random elements in a group (q is a prime number). Mathematical symbols Representative in Z q A two-dimensional vector space over a group, i.e., a pair of elements.

[0070] In the embodiment of the present invention, x ij and ij They have different cryptographic uses: when b ij = 1, finally use x ij Participate in zero-knowledge proof and calculation; when b ij = 0, the final use of s ij Participate in zero-knowledge proofs and computations.

[0071] In an embodiment of the present invention, after calculating the first public array and the second public array, the second type of qualified participants need to upload the first public array and the second public array to a preset smart contract.

[0072] In the embodiment of the present invention, bidder B i Need to be b i Each bit b ij Generate a pair (x ij ,s ij ), whose purpose is to prove certain properties through the participation of these elements in subsequent cryptographic operations without revealing the specific bid value, and ultimately to collaboratively complete the process of finding the minimum winning bid price.

[0073] For example, suppose there is a bidder B whose bid price is 11 (1011 in binary). According to the above method, bidder B needs to generate a pair of (x ij ,s ij ). Assume that group Z q The order q is 23, and the four pairs of random numbers generated by bidder B can be expressed as follows:

[0074] For the first bit b1=1, generate (x 11 ,s 11 ) = (5, 9);

[0075] For the second bit b2=0, generate (x 12 ,s 12 ) = (16, 3);

[0076] For the third bit b3=1, generate (x 13 ,s 13 ) = (7, 13);

[0077] For the fourth bit b4=1, generate (x 14 ,s 14 ) = (11, 6);

[0078] Bidder B will then transform these values ​​to obtain the public cryptographic parameters:

[0079] X 11 =g 5 mod q, S 11 =g 9 mod q;

[0080] X 12 =g 16 mod q, S 12 =g 3 mod q;

[0081] X 13 =g 7 mod q, S 13 =g 13 mod q;

[0082] X 14 =g 11 mod q, S 14 =g 6 mod q;

[0083] Where g is Z q Generators of a group.

[0084] It should be noted that bidder B only disclosed X ij and S ij , but no specific x is disclosed ij and ij In the subsequent zero-knowledge proof and calculation of the minimum value, when b ij =1, use x ij Participate in operations, such as x 11 , x 13 , x 14 When b ij = 0, use s ij Participate in operations, such as s 12 The other bidders do not know that the bidder B is using x ij Or s ij , nor can it be accessed from the public X ij and S ij The original bid price of bidder B is restored from 11. In this way, the privacy of the bidder is protected, and these values ​​can be used to participate in subsequent cryptographic operations.

[0085] In some optional embodiments, bidder B i A deposit must be paid. If the bid is not successful without breach of contract, the deposit will be returned. i Perform each operation fairly. It is worth emphasizing that any potential participant who does not complete this step will not be eligible for subsequent operations.

[0086] In some optional embodiments, during the project bidding process, bidders are usually required to provide a bid bond along with their bid proposals. The bid bond is a financial guarantee provided by the bidder to the tenderer, which is intended to protect the tenderer from losses caused by the bidder's arbitrary withdrawal of the bid during the bid validity period, or failure to perform the contract signing after winning the bid. The preset smart contract enables the amount of the bid bond to be locked until the end of the bidding process. Therefore, the bidder should also approve the bid bond to be locked in the smart contract during the bid submission step.

[0087] In some optional embodiments, after the bidder submits the bid, the preset smart contract can exclude bidders with abnormally low-cost proposals according to a preset margin value. An abnormally low-cost proposal refers to a proposal with a predetermined margin value lower than the estimated cost of the bidder.

[0088] In some optional embodiments, a deposit management business process is proposed. When the bidder pays the bid deposit to the designated account on the blockchain according to the requirements of the bidding documents, the funds are actually temporarily frozen. Specifically, the bidder initiates a transfer with the bidder as the payee in the system, and selects a specific business type such as "bid deposit". The funds are automatically frozen (locked) after being transferred from the bidder's (blockchain) account, instead of directly entering the bidder's available funds account. Once the deposit is frozen, the bidder can only initiate an unfreezing application through the financial institution system after meeting specific conditions (such as the bidder's winning bid or the bidding process is terminated). For example, when the winning bid result is announced, the system automatically generates an application document for the qualified bidder, and after being reviewed and approved by the guarantee management application, the approval result verification is performed using a smart contract. Once the verification result is correct, the message is fed back to the financial institution, and the deposit is unfrozen and converted into the bidder's available funds, or returned to the bidder who did not win the bid. Similarly, the performance bond paid by the winning bidder is also managed in a similar freezing manner to ensure that the funds are used for their intended purposes. Once the successful bidder breaches the contract, the tendering party may apply for deduction of the frozen performance guarantee as compensation. After the smart contract verifies the application result, the remaining funds will be returned to the successful bidder.

[0089] It should be noted that each participant must pay a deposit for their bidding operation, and the smart contract will automatically return the deposit to the winning bidder. If a malicious bidder submits false data, the bidder will not receive the refunded deposit. All interactions with smart contracts must be completed by sending transactions to the blockchain.

[0090] Figure 2 is a schematic diagram of an optional margin management business process according to an embodiment of the present invention, such as Figure 2As shown, the guarantee management application is an application set up on the blockchain, and a regulatory account can be set up in the financial institution system to obtain a deposit account. On the ECP (Electronic Contracting Pla atform, i.e., the electronic bidding platform), after the tenderer publishes the bidding announcement, the supplier bids, and the bidding information can be manually synchronized / imported to the guarantee management application, so that the financial institution system can freeze the deposit according to the bidding information, and the deposit freezing information can be chained to the guarantee management application for deposit management. The guarantee management application can manually synchronize / import information related to the deposit management to the ECP so that the participants can understand the deposit management process. The winning bid announcement on the ECP can be manually synchronized / imported to the guarantee management application for winning bid management. If there is a breach of contract before the winning bid is announced in the deposit management, or if the bid is not won in the bid management, there will be a breach of contract, then the penalty will be deducted and the deposit will be unfrozen. After approval, the result will be verified through the smart contract, and the penalty will be deducted after the verification, and the deposit will be unfrozen until the unfreezing is completed; if after the winning bid is announced in the bid management, the unfreezing application document is automatically generated if the conditions are met, the unfreezing will be initiated and approved. If the approval is not agreed, the process will return to the unfreezing initiation step. If the approval is agreed, the result will be verified with the smart contract execution, and the deposit will be unfrozen after the verification until the unfreezing is completed.

[0091] In some optional embodiments, at the beginning of the bidding, the bidder defines the estimated cost of the project so that the contract can identify unusually low proposals and exclude these accordingly in the evaluation step. The estimated cost of the project is embedded in the smart contract and remains private to the bidders until the end of the bidding.

[0092] Optionally, the bid price of each second-class qualified participant is expressed in binary. Before receiving the bid hidden byte calculated by each second-class qualified participant based on the first public array, it also includes: each second-class qualified participant calculates the public parameter corresponding to each bit in the bid price based on the first public array of all other second-class qualified participants; when the bit is 1, each second-class qualified participant calculates the hidden bit of the bit based on the public parameter of the bit and the first secret element; when the bit is 0, each second-class qualified participant calculates the hidden bit of the bit based on the public parameter of the bit and the second secret element; each second-class qualified participant constructs a bid hidden byte based on the hidden bits of all bits in the bid price.

[0093] In the embodiment of the present invention, in order to ensure anonymous scoring, zero-knowledge proof is used to privately determine the winning bid price.

[0094] In an embodiment of the present invention, participants interact with a preset smart contract to track the bid prices of all verified bidders bit by bit, starting from the highest position, and calculate the hidden bit e respectively. ij , then the smart contract will all e ij Multiply them to get the settlement value of the jth digit. In this way, the bidding information can be prevented from being leaked, even if the vast majority of the bidders collude with a specific party. The specific process is as follows:

[0095] (1) Each legal bidder B i First, based on the first public array of all other second-category qualified participants, calculate the public parameter T corresponding to each bit in the bid price ij .

[0096] (2) Based on b ij The corresponding hidden bit e is calculated from the value of ij , where e ij Hide b ij The specific information and meet the following conditions: or e ij The specific calculation method is (that is, when the bit of each second-class qualified participant is 1, the public parameter T based on the bit ij And the first secret element x ij , calculate the hidden bit of the bit; when the bit of each second-class qualified participant is 0, based on the public parameter T of the bit ij And the second secret element ij , calculate the hidden bit of the bit):

[0097]

[0098] Among them, u ij is the random number x of the other bidders kj and kj (i.e., a linear combination of the first secret element and the second secret element).

[0099] Furthermore, each second-category qualified participant may construct a bidding hidden byte group based on the hidden bits of all bits in the bid price.

[0100] In some optional embodiments, B i Need to publish e with zero-knowledge proof ij , prove that ij It is formed according to certain rules. The zero-knowledge proof is constructed as follows: Assume Bidder B i Randomly select c,k1,h1∈Z q (c, k1, h1 are all random numbers), and Bidder Calculation: w2=w c , h2=h-h1,k2=cs ij h2. Each bidder B i Send the verification public parameter array (w1,w2,k1,k2,h1,h2) to the preset smart contract to verify e ij The correctness of the condition is to check whether the following conditions are met. If so, it means that e ij is correct.

[0101]

[0102] h=h1+h2;

[0103]

[0104] In this embodiment, through the method of zero-knowledge proof, it is possible to ij or ij In this case, prove that ij Is (When b ij =1) or (When b ij =0) is correctly calculated.

[0105] In the embodiment of the present invention, by introducing random numbers, the prover can convince the verifier that the ij It is indeed calculated according to the rules, not arbitrarily forged. ij It can be subject to public verification while protecting privacy, which enhances the credibility of the protocol.

[0106] Optionally, each second-class qualified participant corresponds to a participation number, and each second-class qualified participant calculates the public parameter corresponding to each bit in the bid price based on the first public array of all other second-class qualified participants, including: for each second-class qualified participant, determine all first other second-class qualified participants with a participation number smaller than that of the second-class qualified participant and all second other second-class qualified participants with a participation number greater than that of the second-class qualified participant; calculate the public parameter corresponding to each bit in the bid price based on the first public array of all first other second-class qualified participants and the first public array of all second other second-class qualified participants.

[0107] In the embodiment of the present invention, a participation number may be set for each second-category qualified participant.

[0108] In the embodiment of the present invention, the public parameter corresponding to each bit in the bid price can be calculated based on the first public array of all other second-category qualified participants. in, Indicates that from X 1j To X (i-1)j The product of the consecutive numbers of the bidders with numbers less than i is the first public number X. kj and multiply; Indicates the calculation from X (i+1)j To X nj The product of the consecutive numbers of the bidders with numbers greater than i is the first public number X. kj and multiply them (i.e., for each second-class qualified participant, first determine all first-class other second-class qualified participants with a participation number less than that of the second-class qualified participant and all second-class other second-class qualified participants with a participation number greater than that of the second-class qualified participant, and then calculate the public parameter corresponding to each bit in the bid price based on the first public array of all first-class other second-class qualified participants and the first public array of all second-class other second-class qualified participants). Therefore, T ij Only open to other bidders X kj related to the bidder's own X kj No relation. ij It is a cryptographic parameter calculated by the bidder and used to generate the hidden bid bit b ij The true value of the ciphertext e ij .

[0109] In the embodiment of the present invention, T ij It plays a "mask" role in form, making the final e ij It also contains u j 、x ij (or s ij ) information, but cannot obtain a single value, thus protecting the privacy of the bidder. ij The calculation of only needs the public data of other bidders and does not require any private information. In actual implementation, each bidder can calculate its own set of T ij value, combined with its own x ij or ij Generate ij , the whole process does not require direct communication between bidders. Therefore, T ij It is a key intermediate parameter that protects privacy while enabling decentralized bidders to collaborate on subsequent cryptographic operations and jointly find the final winning bid price.

[0110] In some optional embodiments, according to It can be seen that uij Actually, it is the random number x of other bidders. kj The linear combination of

[0111] Step S103, receiving the bid hidden bytes calculated by each second-category qualified participant based on the first public array.

[0112] In step S103, the preset smart contract is capable of receiving the bid hidden bytes calculated by each second-category qualified participant based on the first public array, so as to select the second-category target participant from all second-category qualified participants according to these bid hidden bytes.

[0113] Step S104, based on all bidding hidden bytes, determining the second category target participants from all the second category qualified participants.

[0114] In step S104, the preset smart contract processes all bidding hidden bytes and can determine the second category target participants from all second category qualified participants according to the processing results.

[0115] Optionally, the step of determining the second category target participants from all the second category qualified participants based on all the bid hidden bytes includes: multiplying the same-position hidden bits in all the bid hidden bytes to obtain the settlement bit of the bit; generating a settlement tuple based on all the settlement bits; calculating the absolute difference between each bid hidden byte and the settlement tuple; and selecting the second category qualified participants corresponding to the bid hidden byte indicated by the smallest absolute difference to determine them as the second category target participants.

[0116] In an embodiment of the present invention, the preset smart contract may multiply the same hidden bits in all bid hidden bytes to obtain the settlement bit of the bit (e.g., the jth bit). For example, the preset smart contract receives all e ij After that, all e ij Multiply and output a value, which is one of {0,1}, which is the jth bit of the bid settlement price. Then, based on all settlement bits, a settlement tuple is generated, and then the bid hidden byte closest to the settlement tuple is determined, and the second-class qualified participants corresponding to the bid hidden byte are determined as the second-class target participants (i.e., the absolute difference between each bid hidden byte and the settlement tuple is calculated, and the second-class qualified participants corresponding to the bid hidden byte indicated by the minimum absolute difference are selected as the second-class target participants). In this way, the second-class target participant (i.e., the winning bidder) with the best bid price can be obtained.

[0117] Optionally, each second-category qualified participant uploads a verified public parameter array to a preset smart contract. After determining the second-category target participant from all second-category qualified participants based on all bidding hidden bytes, it also includes: when the second-category target participant successfully verifies the commitment value based on the encrypted random number, issuing a signing contract to the second-category target participant; when the second-category target participant signs the signing contract, verifying the deposit value of the second-category qualified participant based on the public parameter array; when the deposit value verification is passed, refunding the deposit value to the second-category qualified participant.

[0118] In an embodiment of the present invention, each second-category qualified participant needs to upload a verification public parameter array (i.e., (w1, w2, k1, k2, h1, h2)) to the preset smart contract to verify the correctness of the bid made by the winning bidder.

[0119] In the embodiment of the present invention, all bidders already know whether their bids are optimal (i.e., the lowest). The final winner needs to provide its commitment witness to convince other bidders that its bid is the lowest. Malicious participants cannot pretend to be the winner because the security of the Pederson commitment ensures that it is difficult to forge a correct witness to pass the decommitment.

[0120] In the embodiment of the present invention, the winning bidder calls the function WinnerDeclare(·) to publicly declare that it has won the bid. This function takes comwit (i.e., a cryptographic random number) as input and verifies g clearingPrice h comwit ==combid i Is it established, among which, combid i It is the commitment value of the successful bidder stored in the contract. If the verification is successful, the signing contract will be issued to the successful bidder (that is, if the second type of target participant successfully verifies the commitment value based on the encrypted random number, the signing contract will be issued to the second type of target participant).

[0121] In an embodiment of the present invention, after a contract is awarded, the information of the selected winning bidder and all information of all bidders will be publicly disclosed through the system. This information includes the bidder's award score, address, company name, cost proposal, and estimated cost of the project. Bidders will also be able to access the bidding transactions (history) executed throughout the process, making the bidding and contract award process highly transparent.

[0122] In an embodiment of the present invention, if the contract is awarded, the selected successful bidder shall sign the project contract according to the predetermined contract signing deadline. The successful bidder's approval of the contract signing will trigger the smart contract to return the locked bid deposit amount to the bidder's account address.

[0123] In the embodiment of the present invention, after the winning bid is announced, the deposits of all bidders are uniformly refunded after the contract is signed. The system automatically generates a deposit unfreezing application form for the bidder. The system uses smart contracts to perform deposit unfreezing result verification, that is, to verify the e ij That is, check whether the following three equations hold: h=h1+h2; If established, the approval result verification is successful and the deposit is agreed to be refunded (that is, when the second-category target participant signs the contract, the deposit value of the second-category qualified participant is verified based on the public parameter array, and when the deposit value verification is passed, the deposit value is refunded to the second-category qualified participant).

[0124] In the embodiment of the present invention, after receiving the message that the verification result is correct, the tendering party calls the function Refund(·) to return the deposit to the account addresses of the remaining bidders. In order to avoid repeated refunds of the deposit, the function checks the state of the variable hasRefund and only returns the deposit when the variable is FALSE. After all refund operations are completed, the variable state will be set to TRUE.

[0125] In this embodiment of the present invention, if the selected bidder refuses to sign the contract, the system will award the contract to the bidder with the second highest award score and transfer the bid deposit amount of the previously selected bidder to the account address of the tenderer as compensation. This process will be repeated until the selected bidder signs the contract.

[0126] In an embodiment of the present invention, the smart contract conditions are unique to each tender and should include the evaluation criteria for evaluating proposals, the deadline for bidders to participate in the tender prequalification step, the deadline for technical and cost proposal submissions, the final date for the tenderer and the selected bidder to sign the contract, the amount of the bid deposit required to be locked until the tender process is completed, and the minimum score required to pass the tender prequalification step. The estimated cost of the project, as well as the marginal value used to exclude abnormally low proposals and the formula that the system will use to calculate the award score should also be included in the smart contract.

[0127] Another optional specific implementation is described in detail below.

[0128] In the embodiment of the present invention, a decentralized bidding management system based on blockchain smart contracts is proposed. Its purpose is to simplify the current bidding process and improve efficiency and security. The system uses blockchain technology to ensure that the data is authentic and cannot be tampered with, and automatically executes bidding supervision and deposit management through smart contracts to reduce human errors and reduce operating costs. The system provides transparent and efficient services to all bidding parties and promotes the digital and intelligent development of the bidding process.

[0129] Figure 3 is a schematic diagram of an optional blockchain bidding system according to an embodiment of the present invention, such as Figure 3 As shown in the figure, the blockchain bidding system is used to perform steps such as bid prequalification, bid submission and deposit locking, bid evaluation and awarding, contract signing and deposit refund. Each step is subject to the deadline determined by the tenderer. These deadlines serve as conditions of the smart contract, and the system allows bidders to take corresponding actions within the predefined period.

[0130] exist Figure 3 In the bidding prequalification, the tenderer determines the deadline for each step in the bidding process, the required deposit amount, the estimated project cost, and submits the bidding documents; the bidder uploads its financial and technical documents to the blockchain bidding system. Accordingly, the system execution process includes: selecting qualified bidders with sufficient financial and technical capabilities; sending the documents submitted by the bidder to the tenderer for validity check; storing the files in IPFS (InterPlanetaryFile System), and recording the relevant hash value (CID) and transaction data on the blockchain.

[0131] exist Figure 3 In the bidding submission and deposit locking process, the bidder submits project proposals, cost and technical solutions, etc. The bidder transfers the deposit to the designated blockchain account and agrees to lock the deposit on the chain. Accordingly, the system execution process includes: starting the bid deposit locking process until the end of the process; storing the bidding information in the contract in a private manner.

[0132] exist Figure 3 In the bid evaluation and awarding process, the tenderer calls the system to perform bid evaluation and awarding. Accordingly, the system execution process includes: eliminating abnormally low-price bids; assigning scores to technical proposals and cost proposals; calculating the total evaluation score; selecting the bidder with the highest score and awarding the contract.

[0133] exist Figure 3 In the contract signing and deposit refund, the tenderer calls the system to sign the contract; the deposit is refunded to the bidder's account on the chain. Accordingly, the system execution process includes: refunding the locked bid deposit to the bidder's blockchain address.

[0134] Figure 4 is a schematic diagram of an optional bidding business process according to an embodiment of the present invention, such as Figure 4 As shown, it includes four steps: pre-qualification of bidders, bid submission and deposit locking, bid evaluation and awarding, contract signing and deposit refund.

[0135] Among them, for the prequalification of bidders: the bidder needs to submit the bidding documents (such as specifications, preliminary drawings, project information, special requirements, etc.) to the smart contract of the blockchain, submit the deadlines for the prequalification, bid submission, award and contract signing steps, submit the required bid guarantee amount, and submit the estimated cost of the project to store this information in a distributed manner (IPFS). Bidders download the bidding documents through the IPFS hyperlink (CID), submit the required documents, and answer questions about financial and technical capabilities through the system. The smart contract verifies whether the qualified bidder meets the predefined scoring terms of the smart contract and stores the file hash generated by IPFS. The smart contract then determines whether the bidder's total score is higher than the minimum score. If not, the unqualified bidder will be rejected by the smart contract. If so, the bidder checks whether the bidding documents are accurate. If not, the unqualified bidder will be rejected by the smart contract.

[0136] For bid submission and bond locking: If the bidding documents are accurate, qualified bidders are identified. Once the pre-qualification period is over, the system enables the selected bidders to participate in the bid submission step, that is, the bidders need to submit cost proposals, approve the bid bond amount to be locked in the smart contract, feedback on cost-based technical issues, and then each participant’s bid bond amount will be locked and held by the smart contract.

[0137] For Bid Evaluation and Award: Once bid submissions are closed, the system will: eliminate abnormally low bids, calculate cost and technical scores, calculate the award score for each bidder, select the bidder with the highest award score, announce the winning contractor, and display all bidders’ technical and cost scores, company names, submitted costs, and the employer’s estimated cost information.

[0138] For contract signing and deposit refund: the tenderer determines whether the project contract signing has not been completed. If so, the bid guarantee amount of the selected contractor is transferred to the tenderer's account, and the next qualified contractor with the highest award score is selected. The tenderer continues to determine whether the project contract signing has been completed. If not, the locked guarantee amount is released and re-transferred to the bidder's wallet, ending the bidding process.

[0139] In the bidding business process, the collection, locking, liquidated damages, and refund of the bid deposit are all automatically executed by the smart contract code without manual intervention. The conditions, time, and amount of all fund flows are pre-set in the smart contract terms. Once triggered, they are automatically executed and cannot be changed or terminated, achieving a high degree of automation, transparency, and security in the management of the deposit. All participants can view the changes in the balance of the smart contract account in real time, effectively eliminating the hidden dangers of moral risks such as misappropriation of funds. At the same time, the system will publicly record the identity information, quotations, scoring results, capital inflows and outflows of all bidders through the blockchain network, so as to achieve traceability and high transparency of the entire bidding process.

[0140] In the embodiment of the present invention, the entire bidding process is treated as a smart contract deployed on a decentralized public blockchain, eliminating human intervention, improving the efficiency, transparency and security of the entire bidding process, and achieving the following beneficial effects: (1) Automated processing: The smart contract automatically executes the collection, custody and refund of the deposit, reducing human intervention, improving processing speed and accuracy, and solving the problem of cumbersome and delayed manual processing; (2) Enhanced transparency: All transaction records are open and transparent on the blockchain, and bidders can view the deposit status and transaction history in real time, solving the problem of insufficient transparency of the current bidding system; (3) Improved security: The encryption technology of the blockchain ensures the security of transaction data, prevents unauthorized access and tampering, and solves security issues; (4) Reduced delays: The automated process reduces the need for manual review and shortens the time for deposit refund.

[0141] The following is a detailed description in conjunction with another embodiment.

[0142] Embodiment 2

[0143] A blockchain-based information processing device provided in this embodiment includes multiple implementation units, each implementation unit corresponding to each implementation step in the above-mentioned embodiment one.

[0144] Figure 5 is a schematic diagram of an optional blockchain-based information processing device according to an embodiment of the present invention, such as Figure 5 As shown, the information processing device may include: a first determining unit 50, a first receiving unit 51, a second receiving unit 52, and a second determining unit 53.

[0145] The first determination unit 50 is used to receive the prequalification documents uploaded by each second-category participant, and determine the second-category participant indicated by the prequalification document that has passed the prequalification as the second-category qualified participant;

[0146] The first receiving unit 51 is used to receive the bidding tuple data uploaded by each second-category qualified participant, wherein the bidding tuple data at least includes: a commitment value, a deposit value, a first public array, and a second public array;

[0147] The second receiving unit 52 is used to receive the bid hidden bytes calculated by each second-category qualified participant based on the first public array;

[0148] The second determination unit 53 is used to determine the second category target participants from all the second category qualified participants based on all the bidding hidden bytes.

[0149] The above-mentioned information processing device can receive the prequalification documents uploaded by each second-class participant through the first determination unit 50, and determine the second-class participant indicated by the prequalification document that has passed the prequalification as the second-class qualified participant, receive the bidding tuple data uploaded by each second-class qualified participant through the first receiving unit 51, receive the bidding hidden bytes calculated by each second-class qualified participant based on the first public array through the second receiving unit 52, and determine the second-class target participant from all second-class qualified participants based on all bidding hidden bytes through the second determination unit 53. In an embodiment of the present invention, the first-class participant (i.e., the tenderer) can pre-deploy a preset smart contract on the blockchain to receive the prequalification documents uploaded by each second-class participant (i.e., the bidder) through the preset smart contract, and determine the second-class participant that has passed the prequalification as the second-class qualified participant (i.e., the qualified bidder), and then receive the bidding tuple data and bidding hidden bytes uploaded by each second-class qualified participant, and determine the second-class target participant (i.e., the successful bidder) by processing all bidding hidden bytes. By pre-setting smart contracts to execute the entire bidding process, a safe, transparent and efficient bidding environment can be provided, which reduces dependence on third parties, effectively avoids fraud and corruption, improves the fairness and transparency of the entire bidding process, and can fairly determine the successful bidder, thereby solving the technical problem in related technologies that the successful bidder cannot be fairly determined due to reliance on centralized third-party databases and authorized organizations to manage and execute bidding procedures.

[0150] Optionally, the information processing device also includes: a first receiving module, used to receive the prequalification standard score file uploaded by the first category of participants and a preset qualification threshold before receiving the prequalification document uploaded by each second category of participants, wherein the prequalification standard score file includes: a score table corresponding to each prequalification standard.

[0151] Optionally, the prequalification document includes: the actual number of each prequalification criterion, and the information processing device also includes: a first forwarding module, which is used to forward each prequalification document to the first blockchain node corresponding to the first category of participants after receiving the prequalification document uploaded by each second category of participants, wherein the first category of participants obtains the prequalification document from the first blockchain node and verifies the accuracy of the prequalification document; a first determination module, which is used to determine the prequalification value of the prequalification criterion based on the score table and the actual number of each prequalification criterion when the accuracy of the prequalification document is verified; a first accumulation module, which is used to accumulate the prequalification values ​​of all prequalification standards to obtain the prequalification total value of the prequalification document; and a second determination module, which is used to determine that the prequalification document is prequalified when the prequalification total value is greater than a preset qualified threshold.

[0152] Optionally, the first receiving unit includes: a second receiving module, used to receive the deposit value uploaded by each second-class qualified participant, and input the preset byte length and the deposit value into a preset deployment function to generate generator parameters and a commitment random number; a second forwarding module, used to forward the generator parameters and the commitment random number to the second blockchain node corresponding to each second-class qualified participant, wherein each second-class qualified participant generates a commitment value based on the generator parameters, the bid price, the commitment random number and the encrypted random number; a third receiving module, used to receive the first public array and the second public array uploaded by each second-class qualified participant, wherein each first public number in the first public array is determined based on the first secret element in the secret element pair selected by the second-class qualified participant and the generator parameters, and each second public number in the second public array is determined based on the second secret element in the secret element pair selected by the second-class qualified participant and the generator parameters.

[0153] Optionally, the bid price of each second-class qualified participant is expressed in binary, and the information processing device also includes: a first calculation module, which is used to calculate the public parameter corresponding to each bit in the bid price based on the first public array of all other second-class qualified participants before receiving the bid hidden byte calculated by each second-class qualified participant based on the first public array; a second calculation module, which is used for each second-class qualified participant to calculate the hidden bit of the bit based on the public parameter of the bit and the first secret element when the bit is 1; a third calculation module, which is used for each second-class qualified participant to calculate the hidden bit of the bit based on the public parameter of the bit and the second secret element when the bit is 0; a first construction module, which is used for each second-class qualified participant to construct a bid hidden byte based on the hidden bits of all bits in the bid price.

[0154] Optionally, each second-category qualified participant corresponds to a participation number, and the first calculation module includes: a first determination submodule, used to determine, for each second-category qualified participant, all first other second-category qualified participants whose participation numbers are smaller than that of the second-category qualified participant and all second other second-category qualified participants whose participation numbers are greater than that of the second-category qualified participant; a first calculation submodule, used to calculate the public parameter corresponding to each bit in the bid price based on the first public array of all first other second-category qualified participants and the first public array of all second other second-category qualified participants.

[0155] Optionally, the second determination unit includes: a first multiplication module, used to multiply the same-position hidden bits in all bidding hidden bytes to obtain the settlement bit of the bit; a first generation module, used to generate a settlement tuple based on all settlement bits; a fourth calculation module, used to calculate the absolute difference between each bidding hidden byte and the settlement tuple; a first selection module, used to select the second category of qualified participants corresponding to the bidding hidden byte indicated by the minimum absolute difference and determine it as the second category of target participants.

[0156] Optionally, each second-category qualified participant uploads a verified public parameter array to a preset smart contract, and the information processing device also includes: a first issuing module, which is used to determine the second-category target participant from all second-category qualified participants based on all bidding hidden bytes, and if the second-category target participant successfully verifies the commitment value based on the encrypted random number, the signing contract is issued to the second-category target participant; a first verification module, which is used to verify the deposit value of the second-category qualified participant based on the public parameter array when the second-category target participant signs the signing contract; and a first refund module, which is used to refund the deposit value to the second-category qualified participant when the deposit value verification is successful.

[0157] The above-mentioned information processing device may also include a processor and a memory. The above-mentioned first determination unit 50, first receiving unit 51, second receiving unit 52, second determination unit 53, etc. are all stored in the memory as program units, and the processor executes the above-mentioned program units stored in the memory to realize corresponding functions.

[0158] The processor includes a kernel, which retrieves the corresponding program unit from the memory. The kernel can be set to one or more, and the kernel parameters can be adjusted to determine the second type of target participants from all the second type of qualified participants based on all the bidding hidden bytes.

[0159] The above-mentioned memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM, and the memory includes at least one storage chip.

[0160] The present invention also provides a computer program product, which, when executed on a data processing device, is suitable for executing an initialization program having the following method steps: receiving prequalification documents uploaded by each second-category participant, and determining the second-category participants indicated by the prequalification documents that have passed the prequalification as second-category qualified participants, receiving bidding tuple data uploaded by each second-category qualified participant, receiving bidding hidden bytes calculated by each second-category qualified participant based on a first public array, and determining second-category target participants from all second-category qualified participants based on all bidding hidden bytes.

[0161] According to another aspect of an embodiment of the present invention, a computer-readable storage medium is also provided, the computer-readable storage medium including a stored computer program, wherein when the computer program is running, the device where the computer-readable storage medium is located is controlled to execute the above-mentioned blockchain-based information processing method.

[0162] According to another aspect of an embodiment of the present invention, there is also provided an electronic device, comprising one or more processors and a memory, wherein the memory is used to store one or more programs, wherein when the one or more programs are executed by one or more processors, the one or more processors implement the above-mentioned blockchain-based information processing method.

[0163] Figure 6 1 is a hardware structure block diagram of an electronic device (or mobile device) for a blockchain-based information processing method according to an embodiment of the present invention. Figure 6 As shown, the electronic device may include one or more processors (e.g., Figure 6 The processor 602a, processor 602b, ..., processor 602n, etc., which may include but are not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA, etc.), a memory 604 for storing data. In addition, it may also include: a display, an input / output interface (I / O interface), a universal serial bus (USB) port (which may be included as one of the ports of the I / O interface), a network interface, a keyboard, a power supply and / or a camera. It can be understood by those skilled in the art that Figure 6 The structure shown is only for illustration and does not limit the structure of the above electronic device. Figure 6 More or fewer components as shown, or with Figure 6 Different configurations are shown.

[0164] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.

[0165] The embodiments or examples of the present disclosure are not exhaustive, but are only illustrative of some embodiments or examples, and are not intended to be specific limitations on the scope of protection of the present disclosure. In the absence of contradiction, each step in a certain embodiment or example can be implemented as an independent example, and the steps can be combined arbitrarily. For example, the scheme after removing some steps in a certain embodiment or example can also be implemented as an independent example, and the order of the steps in a certain embodiment or example can be arbitrarily exchanged. In addition, the optional methods or optional examples in a certain embodiment or example can be combined arbitrarily; in addition, the various embodiments or examples can be combined arbitrarily, for example, some or all steps of different embodiments or examples can be combined arbitrarily, and a certain embodiment or example can be combined arbitrarily with the optional methods or optional examples of other embodiments or examples.

[0166] In the above embodiments of the present invention, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0167] In the several embodiments provided by the present invention, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of the units can be a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0168] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0169] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0170] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk and other media that can store program codes.

[0171] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principle of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A blockchain-based information processing method, characterized in that: Applicable to the preset smart contracts pre-deployed on the blockchain by the first type of participants, including: receiving the prequalification documents uploaded by each second-category participant, and determining the second-category participant indicated in the prequalification document that has passed the prequalification as the second-category qualified participant; Receiving bidding tuple data uploaded by each of the second-category qualified participants, wherein the bidding tuple data at least includes: a commitment value, a deposit value, a first public array, and a second public array; Receiving the bid hidden bytes calculated by each of the second-category qualified participants based on the first public array; Based on all of the bid concealed bytes, a second category of target participants is determined from all of the second category of qualified participants.

2. The information processing method according to claim 1, characterized in that: Prior to receiving the prequalification documents uploaded by each Category II participant, it also includes: Receive a pre-qualification standard score file and a preset qualification threshold uploaded by the first category of participants, wherein the pre-qualification standard score file includes: a score table corresponding to each pre-qualification standard.

3. The information processing method according to claim 2, characterized in that: The prequalification documents include: the actual number of each of the prequalification criteria, and after receiving the prequalification documents uploaded by each second category participant, also include: forwarding each of the prequalification documents to a first blockchain node corresponding to the first category of participants, wherein the first category of participants obtains the prequalification documents from the first blockchain node and verifies the accuracy of the prequalification documents; If the accuracy of the prequalification document is verified, determining the prequalification value of the prequalification criterion based on the score table and the actual number of each prequalification criterion; Accumulating the prequalification values ​​of all the prequalification standards to obtain a total prequalification value of the prequalification document; When the total pre-qualification value is greater than the preset qualified threshold, it is determined that the pre-qualification document has passed the pre-qualification.

4. The information processing method according to claim 1, characterized in that: The step of receiving the bidding tuple data uploaded by each of the second-category qualified participants comprises: Receive the deposit value uploaded by each of the second-category qualified participants, and input the preset byte length and the deposit value into the preset deployment function to generate generator parameters and a commitment random number; Forwarding the generator parameters and the commitment random number to the second blockchain node corresponding to each second-category qualified participant, wherein each second-category qualified participant generates the commitment value based on the generator parameters, the bid price, the commitment random number and the encrypted random number; Receive the first public array and the second public array uploaded by each of the second-category qualified participants, wherein each first public number in the first public array is determined based on the first secret element in the secret element pair selected by the second-category qualified participant and the generator parameter, and each second public number in the second public array is determined based on the second secret element in the secret element pair selected by the second-category qualified participant and the generator parameter.

5. The information processing method according to claim 4, characterized in that: The bid price of each second-category qualified participant is represented by binary, and before receiving the bid hidden byte calculated by each second-category qualified participant based on the first public array, the method further includes: Each of the second-category qualified participants calculates the public parameter corresponding to each bit in the bid price based on the first public arrays of all other second-category qualified participants; Each of the second-category qualified participants calculates the hidden bit of the bit based on the public parameter of the bit and the first secret element when the bit is 1; Each of the second-category qualified participants calculates the hidden bit of the bit based on the public parameter of the bit and the second secret element when the bit is 0; Each of the second-category qualified participants constructs the bid concealed byte group based on the concealed bits of all the bits in the bid price.

6. The information processing method according to claim 5, characterized in that: Each second-category qualified participant has a corresponding participation number, and each second-category qualified participant calculates the public parameter corresponding to each bit in the bid price based on the first public array of all other second-category qualified participants, including: For each of the second-category qualified participants, determine all first other second-category qualified participants having a participation number smaller than the second-category qualified participant and all second other second-category qualified participants having a participation number greater than the second-category qualified participant; Based on the first public arrays of all the first other second-category qualified participants and the first public arrays of all the second other second-category qualified participants, the public parameter corresponding to each bit in the bid price is calculated.

7. The information processing method according to claim 1, characterized in that: The step of determining the second type of target participants from all the second type of qualified participants based on all the bid concealed bytes comprises: Multiplying the same hidden bit in all the bid hidden bytes to obtain the settlement bit of the bit; Generate a settlement tuple based on all settlement bits; Calculating the absolute difference between each of the bid concealed bytes and the settlement tuple; The second-category qualified participants corresponding to the bid concealed byte indicated by the minimum absolute difference are selected and determined as the second-category target participants.

8. The information processing method according to claim 1, characterized in that: Each of the second type of qualified participants uploads a verification public parameter array to the preset smart contract, based on all the bid hidden bytes, After determining the second category of target participants from all the second category of qualified participants, the method further includes: When the second-category target participant successfully verifies the commitment value based on the encrypted random number, issuing a signing contract to the second-category target participant; When the second-category target participant signs the contract, verifying the deposit value of the second-category qualified participant based on the public parameter array; In the event that the deposit value is verified, the deposit value will be returned to the second category of qualified participants.

9. An information processing device based on blockchain, characterized in that: Applicable to the preset smart contracts pre-deployed on the blockchain by the first type of participants, including: A first determination unit is configured to receive the prequalification documents uploaded by each second-category participant, and determine the second-category participant indicated by the prequalification document that has passed the prequalification as a second-category qualified participant; A first receiving unit is used to receive the bidding tuple data uploaded by each of the second-category qualified participants, wherein the bidding tuple data at least includes: a commitment value, a deposit value, a first public array, and a second public array; A second receiving unit, configured to receive a bid hidden byte calculated by each of the second-category qualified participants based on the first public array; The second determination unit is used to determine the second category target participants from all the second category qualified participants based on all the bidding hidden bytes.

10. An electronic device, characterized in that: The invention comprises one or more processors and a memory, wherein the memory is used to store one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the blockchain-based information processing method as described in any one of claims 1 to 8.

Images