CN112734541A - Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system - Google Patents

Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system Download PDF

Info

Publication number
CN112734541A
CN112734541A CN202110124778.3A CN202110124778A CN112734541A CN 112734541 A CN112734541 A CN 112734541A CN 202110124778 A CN202110124778 A CN 202110124778A CN 112734541 A CN112734541 A CN 112734541A
Authority
CN
China
Prior art keywords
supplier
bid
suppliers
bidding
score
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110124778.3A
Other languages
Chinese (zh)
Inventor
李莉
陈美成
韦鹏程
王兰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Education
Original Assignee
Chongqing University of Education
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University of Education filed Critical Chongqing University of Education
Priority to CN202110124778.3A priority Critical patent/CN112734541A/en
Publication of CN112734541A publication Critical patent/CN112734541A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/08—Auctions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Finance (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a privacy protection supported secret bidding and expert evaluation safe purchasing source searching system, and relates to the technical field of purchasing. The secret bidding method supporting privacy protection comprises the following steps: designing a scoring rule to select the most favorable supplier, specifically: (1) the bid price cannot exceed the established budget; (2) the prices of the various suppliers can be compared without guaranteeing leakage; (3) the quality scores that each supplier can obtain from different experts are aggregated; (4) after the bidding price order and the summary quality score order are obtained, the weights of the two indexes are designed, and finally the winner with the highest comprehensive score is selected as the winning supplier.

Description

Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system
Technical Field
The invention relates to the technical field of purchasing, in particular to a privacy protection supported secret bidding and expert evaluation safe purchasing source searching system.
Background
In various industries such as construction engineering, shipping, transportation and information technology, purchasing bidding is the most common business form and plays an important role in promoting the development of the world economy. The cloud storage procurement bidding system may be defined as exchanging funds and services between a cloud storage procurement manager and a cloud storage provider. When the transaction starts, the cloud storage purchasing manager issues quality lists such as budgets, minimum price, maximum price, bidding background (the purchasing manager is private and keeps secret to other entities) and supplier quality requirements according to different bidding scenes. Accordingly, cloud storage providers provide bidding papers including quotes and solutions based on project evaluation and past experience. At present, the purchase is taken as a core function of an enterprise, the cost of the purchase exceeds 50% of the total cost of the enterprise, and therefore, the selection of the supplier with the highest cost performance for a cloud storage manager is of great importance.
Generally, in conventional procurement bidding, a procurement manager will employ a trusted third party to establish a channel between the supplier and the procurement manager. However, its participation may result in unfairness because collusion with the provider that may exist by the trusted third party may result in the price being sold to the competitor by the trusted third party. Therefore, we propose to replace trusted third parties with blockchain techniques. The block chain has powerful functions and has the functions of transparency, tamper resistance and tracking. In view of the development trend, the purchasing organization abandons the third party and adopts a distributed mode to build the system. Therefore, we propose a block chain-based cloud storage procurement bidding system supporting secret bidding and expert assessment of provider quality.
Disclosure of Invention
Technical problem to be solved
Aiming at the defects of the prior art, the invention provides a secret bidding and expert evaluation safe purchasing source searching system supporting privacy protection, and solves the problem of unfair purchasing management.
(II) technical scheme
In order to achieve the purpose, the invention is realized by the following technical scheme: the privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system comprises the following steps: designing a scoring rule to select the most favorable supplier, specifically: (1) the bid price cannot exceed the established budget; (2) the prices of the various suppliers can be compared without guaranteeing leakage; (3) the quality scores that each supplier can obtain from different experts are aggregated; (4) after a bidding price size sequence and a summary quality score sequence are obtained, the weights of the two indexes are designed, and finally the winner with the highest comprehensive score is selected as a winning supplier, wherein the privacy protection needs to be realized as follows: (1) the cloud storage management organization cannot know the bid price of each cloud storage provider; (2) the supplier can safely compare the bid prices without knowing the exact competitor's bid price; (3) for fairness and prevention of collusion among assessment experts, each expert cannot know the quality scores of other experts in the process of assessing the quality of a supplier and scoring.
An expert evaluation secure procurement sourcing system for secret bidding supporting privacy protection specifically comprises four following different entities: the cloud storage management organization, the cloud storage suppliers, the assessment experts and the block chain are embodied in that the cloud storage management organization sets budgets, the fact that the bidding price of any cloud storage supplier is not higher than the budget is guaranteed through a verification algorithm, then the suppliers compare the quotes between the suppliers in pairs and publish the comparison results to the block chain, the assessment experts score the quality of the suppliers, the cloud storage suppliers accumulate the encrypted quality scores from different experts, the aggregated quality score of the supplier is obtained after decryption and published to the block chain, and the cloud storage management organization determines the winning supplier and publishes the result to the suppliers according to the bidding price sequence, the aggregated quality score and the preset weight, and the system comprises the following stages: a system Setup phase (Setup), a bid verification phase (bidvi), a bid comparison phase (BidComp), a quality assessment phase (QEval) and a winner declaration phase (WinDec).
Preferably, the system is constructedThe vertical phase generates the key pair and encryption vendor's bid through the Setup algorithm, which contains two parts: KeyGen and EncBid, in the KeyGen part, generating a private key sk and a public key pk required by each supplier and purchase management organization, ensuring the uniqueness of each supplier pk and sk, wherein the number of suppliers is ms, the number of assessment experts is me, and the execution time of Setup is set at T1In the interior of said container body,
the Setup algorithm is described in detail as follows:
the method comprises the following steps: current time T is less than or equal to T1；
The supplier end:
KeyGen part
Step two: parameter i from 0 to ms-1；
Step three: initializing two prime numbers piAnd q isiLet p stand fori＝qi＝3mod4，ni＝pi·qi；
Step four: if i is 0 then g is n-1, from the finite field
Figure BDA0002923235640000031
In (1) random selection of eiLet us order
Figure BDA0002923235640000032
Step five: if i ≠ 0, determining
Figure BDA0002923235640000033
If yes, order giN-1 from a finite field
Figure BDA0002923235640000034
In (1) random selection of eiLet us order
Figure BDA0002923235640000035
pki＝(ni,gi,ei,hi)；
Step six: repeating the first step to the sixth step;
step seven: repeating the second step to the fifth step;
and (3) purchasing an organization end:
step eight: initializing two prime numbers PpmAnd q ispmWherein n ispm＝ppm·qpm，gpm＝npm-1, from a finite field
Figure BDA0002923235640000036
In (1) random selection of epm(ii) a Order to
Figure BDA0002923235640000037
Figure BDA0002923235640000038
pkpm＝(npm,gpm,epm,hpm)；
EncBid
And (3) a buyer section:
step nine: parameter i from 0 to ms-1；
Step ten: computing ciphertext
Figure BDA0002923235640000041
Sending ciphertext CiInto a blockchain;
step eleven: return to
Figure BDA0002923235640000043
Preferably, the bid verification stage is based on ZKP technology, and verifies that the bid price of the supplier does not exceed a determined budget v through BidVal algorithm, and is provided with msBid price
Figure BDA0002923235640000044
The budget is V, so the budget V indicates V ═ V (V)0,v1,···vi) Wherein v isi＝[(v+2l-i)/2(l-i+1)]，l＝[log2v]The execution time of the bid comparison stage is between T1 and T2, and the core steps of the BidVal algorithm are as follows: (1) the individual bid prices are broken down into in-place representations,then for bid price xiWhich is represented by Xi＝(xi0,x1,···,xil)v(2) for each xijNeed to prove xijE {0,1} holds, (3) prove relationship
Figure BDA0002923235640000042
Is established, (4) to hide xiThe location of 0 or 1 is scrambled by using a function Shuffle (·), and if the condition is satisfied, the purchase management organization adds the public key pk of the supplieriThe authentication provider list Slist is entered into the authentication provider list.
Preferably, the bid comparison stage is a protocol based on the Fischlin protocol and not requiring third-party integer comparison, the BidComp algorithm is used for processing the situation that two or more suppliers bid the same, and the execution time of the BidComp is T2And T3In the meantime.
Preferably, the quality evaluation stage is to summarize quality evaluation scores obtained by various suppliers from different experts through a QEval algorithm, and in the process, ensure that each expert is not aware of the scores of other experts, and the QEval algorithm comprises three stages: EncQS, AggQS and DecQS, where each expert uses the public key pk of the supplier being evaluatediEncrypts the scores, then in the AggQS phase each supplier aggregates the scores obtained from different experts, finally in DecQS each supplier uses the private key skiDecrypting the aggregated score to obtain a final score, wherein the Qerval execution time is T3And T4In the meantime.
Preferably, the winner declaration phase finds the final winner by WinDec algorithm, the time of WinDec being at T4And T5Firstly, the purchase management organization obtains the final score of the supplier through the private key, and uses the private key skpmTo obtain the final scores of the respective suppliers
Figure BDA0002923235640000052
If it is
Figure BDA0002923235640000053
If yes, allowing the supplier to participate in the following process, otherwise, regarding that the supplier provides an unreal final score in the last stage, not allowing the supplier to participate in the following process, after verification, the procurement management organization obtains the size relationship of any two suppliers' bids and the quality evaluation score of each supplier from the block chain, then determines the winner, namely the winning supplier, according to the following process, firstly, according to the obtained bid comparison result and the quality evaluation score, the procurement management organization obtains two sorted lists, namely a bid sorted list BPlist and a quality score sorted list AQSlist, and then the procurement management organization allocates appropriate weight coefficients to the two lists, and the winner declares the rule as follows: (1) the lower the bid price in the BPlist is, the larger the element value is; (2) the higher the mass fraction in the AQSlist is, the larger the element value is; (3) use of
Figure BDA0002923235640000051
And (3) calculating the supplier with the highest score to become a final winner, and if two or more suppliers provide the same bid price or obtain the same quality evaluation score, the values of the elements in the BPlist or the AQSlist are equal, K is a constant, and w is a weight coefficient.
(III) advantageous effects
The invention provides a privacy protection supported secret bidding and expert evaluation safe purchase sourcing system. The method has the following beneficial effects:
the bidding method has the advantages of strong privacy, more scientific expert evaluation, high evaluation efficiency, and more fair and fair evaluation and bidding, and can realize on-line evaluation, save evaluation time and reduce evaluation cost.
Drawings
FIG. 1 is a schematic diagram of a system for an expert evaluation secure procurement sourcing system supporting privacy protection secret bidding according to the invention;
FIG. 2 is a schematic diagram of a bid verification stage calculation method of the expert evaluation secure procurement sourcing system for privacy-protected private bidding according to the invention;
FIG. 3 is a schematic diagram of a method for computing a quality evaluation stage of the expert-based secure procurement sourcing system for privacy bidding supporting privacy protection according to the invention;
fig. 4 is a schematic diagram of the winner declaration phase calculation of the expert evaluation secure procurement sourcing system supporting privacy protection secret bidding according to the invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example (b):
as shown in fig. 1-4, an embodiment of the present invention provides a privacy-protected private bidding and expert-evaluation secure procurement sourcing system, comprising the following steps: designing a scoring rule to select the most favorable supplier, specifically: (1) the bid price cannot exceed the established budget; (2) the prices of the various suppliers can be compared without guaranteeing leakage; (3) the quality scores that each supplier can obtain from different experts are aggregated; (4) after a bidding price size sequence and a summary quality score sequence are obtained, the weights of the two indexes are designed, and finally the winner with the highest comprehensive score is selected as a winning supplier, wherein the privacy protection needs to be realized as follows: (1) the cloud storage management organization cannot know the bid price of each cloud storage provider; (2) the supplier can safely compare the bid prices without knowing the exact competitor's bid price; (3) for fairness and prevention of collusion among assessment experts, each expert cannot know the quality scores of other experts in the process of assessing the quality of a supplier and scoring.
An expert evaluation secure procurement sourcing system for secret bidding supporting privacy protection specifically comprises four following different entities: the cloud storage management organization, the cloud storage suppliers, the assessment experts and the block chain are embodied in that the cloud storage management organization sets budgets, the fact that the bidding price of any cloud storage supplier is not higher than the budget is guaranteed through a verification algorithm, then the suppliers compare the quotes between the suppliers in pairs and publish the comparison results to the block chain, the assessment experts score the quality of the suppliers, the cloud storage suppliers accumulate the encrypted quality scores from different experts, the aggregated quality score of the supplier is obtained after decryption and published to the block chain, and the cloud storage management organization determines the winning supplier and publishes the result to the suppliers according to the bidding price sequence, the aggregated quality score and the preset weight, and the system comprises the following stages: a system Setup phase (Setup), a bid verification phase (bidvi), a bid comparison phase (BidComp), a quality assessment phase (QEval) and a winner declaration phase (WinDec).
The system Setup phase generates the key pair and encryption vendor bids through the Setup algorithm, which consists of two parts: KeyGen and EncBid, in the KeyGen part, generating a private key sk and a public key pk required by each supplier and purchase management organization, ensuring the uniqueness of each supplier pk and sk, wherein the number of suppliers is ms, the number of assessment experts is me, and the execution time of Setup is set at T1In the interior of said container body,
the Setup algorithm is described in detail as follows:
the method comprises the following steps: current time T is less than or equal to T1；
The supplier end:
KeyGen part
Step two: parameter i from 0 to ms-1；
Step three: initializing two prime numbers piAnd q isiLet p stand fori＝qi＝3mod4，ni＝pi·qi；
Step four: if i is 0 then g is n-1, from the finite field
Figure BDA0002923235640000081
In (1) random selection of eiLet us order
Figure BDA0002923235640000082
pki＝(ni,gi,ei,hi)；
Step five: if i ≠ 0, determining
Figure BDA0002923235640000089
If yes, order giN-1 from a finite field
Figure BDA0002923235640000083
In (1) random selection of eiLet us order
Figure BDA0002923235640000084
pki＝(ni,gi,ei,hi)；
Step six: repeating the first step to the sixth step;
step seven: repeating the second step to the fifth step;
and (3) purchasing an organization end:
step eight: initializing two prime numbers PpmAnd q ispmWherein n ispm＝ppm·qpm，gpm＝npm-1, from a finite field
Figure BDA0002923235640000085
In (1) random selection of epm(ii) a Order to
Figure BDA0002923235640000086
Figure BDA0002923235640000087
EncBid
And (3) a buyer section:
step nine: parameter i from 0 to ms-1；
Step ten: computing ciphertext
Figure BDA0002923235640000088
Sending ciphertext CiInto a blockchain;
step eleven: return to
Figure BDA00029232356400000810
The bid verification stage is based on ZKP technology, verifies that the bid price of the supplier does not exceed the determined budget v through BidVal algorithm, and is provided with msBid price
Figure BDA00029232356400000811
The budget is V, so the budget V indicates V ═ V (V)0,v1,···vi) Wherein v isi＝[(v+2l-i)/2(l-i+1)]，l＝[log2v]The execution time of the bid comparison stage is between T1 and T2, and the core steps of the BidVal algorithm are as follows: (1) decomposing each bid price into in-place representation, then for bid price xiWhich is represented by Xi＝(xi0,x1,···,xil)v(2) for each xijNeed to prove xijE {0,1} holds, (3) prove relationship
Figure BDA0002923235640000091
Is established, (4) to hide xiThe location of 0 or 1 is scrambled by using a function Shuffle (·), and if the condition is satisfied, the purchase management organization adds the public key pk of the supplieriThe authentication provider list Slist is entered into the authentication provider list.
The bid comparison stage is a protocol based on the Fischlin protocol and not requiring third-party integer comparison, the BidComp algorithm is used for processing the situation that two or more suppliers bid the same, and the execution time of the BidComp is T2And T3In the meantime.
The quality evaluation stage is to summarize quality evaluation scores obtained by various suppliers from different experts through a QEval algorithm, and ensure that each expert is not aware of the scores of other experts in the process, wherein the QEval algorithm comprises three stages: EncQS, AggQS and DecQS, where each expert usesPublic key pk of evaluated supplieriEncrypts the scores, then in the AggQS phase each supplier aggregates the scores obtained from different experts, finally in DecQS each supplier uses the private key skiDecrypting the aggregated score to obtain a final score, wherein the Qerval execution time is T3And T4In the meantime.
Winner declaration phase finding final winner by WinDec algorithm, time of WinDec at T4And T5Firstly, the purchase management organization obtains the final score of the supplier through the private key, and uses the private key skpmTo obtain the final scores of the respective suppliers
Figure BDA0002923235640000092
If it is
Figure BDA0002923235640000093
If yes, allowing the supplier to participate in the following process, otherwise, regarding that the supplier provides an unreal final score in the last stage, not allowing the supplier to participate in the following process, after verification, the procurement management organization obtains the size relationship of any two suppliers' bids and the quality evaluation score of each supplier from the block chain, then determines the winner, namely the winning supplier, according to the following process, firstly, according to the obtained bid comparison result and the quality evaluation score, the procurement management organization obtains two sorted lists, namely a bid sorted list BPlist and a quality score sorted list AQSlist, and then the procurement management organization allocates appropriate weight coefficients to the two lists, and the winner declares the rule as follows: (1) the lower the bid price in the BPlist is, the larger the element value is; (2) the higher the mass fraction in the AQSlist is, the larger the element value is; (3) use of
Figure BDA0002923235640000101
And (3) calculating the supplier with the highest score to become a final winner, and if two or more suppliers provide the same bid price or obtain the same quality evaluation score, the values of the elements in the BPlist or the AQSlist are equal, K is a constant, and w is a weight coefficient.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (7)

1. A method for supporting privacy-preserving private bidding, comprising the steps of: designing a scoring rule to select the most favorable supplier, specifically: (1) the bid price cannot exceed the established budget; (2) the prices of the various suppliers can be compared without guaranteeing leakage; (3) the quality scores that each supplier can obtain from different experts are aggregated; (4) after a bidding price size sequence and a summary quality score sequence are obtained, the weights of the two indexes are designed, and finally the winner with the highest comprehensive score is selected as a winning supplier, wherein the privacy protection needs to be realized as follows: (1) the cloud storage management organization cannot know the bid price of each cloud storage provider; (2) the supplier can safely compare the bid prices without knowing the exact competitor's bid price; (3) for fairness and prevention of collusion among assessment experts, each expert cannot know the quality scores of other experts in the process of assessing the quality of a supplier and scoring.
2. An expert evaluation secure procurement sourcing system for secret bidding supporting privacy protection is characterized by specifically comprising four following different entities: the cloud storage management organization, the cloud storage suppliers, the assessment experts and the block chain are embodied in that the cloud storage management organization sets budgets, the fact that the bidding price of any cloud storage supplier is not higher than the budget is guaranteed through a verification algorithm, then the suppliers compare the quotes between the suppliers in pairs and publish the comparison results to the block chain, the assessment experts score the quality of the suppliers, the cloud storage suppliers accumulate the encrypted quality scores from different experts, the aggregated quality score of the supplier is obtained after decryption and published to the block chain, and the cloud storage management organization determines the winning supplier and publishes the result to the suppliers according to the bidding price sequence, the aggregated quality score and the preset weight, and the system comprises the following stages: a system Setup phase (Setup), a bid verification phase (bidvi), a bid comparison phase (BidComp), a quality assessment phase (QEval) and a winner declaration phase (WinDec).
3. The privacy-preserving-enabled secret-bidding and expert-evaluation secure-procurement sourcing system of claim 2, wherein the system set-up phase generates key-pair and encryption vendor bids through a Setup algorithm, Setup comprising two parts: KeyGen and EncBid, in the KeyGen part, generating a private key sk and a public key pk required by each supplier and purchase management organization, ensuring the uniqueness of each supplier pk and sk, wherein the number of suppliers is ms, the number of assessment experts is me, and the execution time of Setup is set at T1In the interior of said container body,
the Setup algorithm is described in detail as follows:
the method comprises the following steps: current time T is less than or equal to T1；
The supplier end:
KeyGen part
Step two: parameter i from 0 to ms-1；
Step three: initializing two prime numbers piAnd q isiLet p stand fori＝qi＝3mod4，ni＝pi·qi；
Step four: if i is 0 then g is n-1, from the finite field
Figure FDA0002923235630000021
In (1) random selection of eiLet us order
Figure FDA0002923235630000022
pki＝(ni,gi,ei,hi)；
Step five: if i ≠ 0, determining
Figure FDA0002923235630000028
If yes, order giN-1 from a finite field
Figure FDA0002923235630000023
In (1) random selection of eiLet us order
Figure FDA0002923235630000024
pki＝(ni,gi,ei,hi)；
Step six: repeating the first step to the sixth step;
step seven: repeating the second step to the fifth step;
and (3) purchasing an organization end:
step eight: initializing two prime numbers PpmAnd q ispmWherein n ispm＝ppm·qpm，gpm＝npm-1, from a finite field
Figure FDA0002923235630000025
In (1) random selection of epm(ii) a Order to
Figure FDA0002923235630000026
Figure FDA0002923235630000027
pkpm＝(npm,gpm,epm,hpm)；
EncBid
And (3) a buyer section:
step nine: parameter i from 0 to ms-1；
Step ten: computing ciphertext
Figure FDA0002923235630000031
Sending ciphertext CiInto a blockchain;
step eleven: return to
Figure FDA0002923235630000032
4. The expert-evaluating secure procurement sourcing system for private-bidding-supported secret bidding according to claim 2, wherein the bid verification stage is based on ZKP technology, verifies through the bidvi algorithm that the bid price of the supplier does not exceed a certain budget v, provided with msBid price
Figure FDA0002923235630000033
The budget is V, so the budget V indicates V ═ V (V)0,v1,···vi) Wherein v isi＝[(v+2l-i)/2(l-i+1)]，l＝[log2v]The execution time of the bid comparison stage is between T1 and T2, and the core steps of the BidVal algorithm are as follows: (1) decomposing each bid price into in-place representation, then for bid price xiWhich is represented by Xi＝(xi0,x1,···,xil)v(2) for each xijNeed to prove xijE {0,1} holds, (3) prove relationship
Figure FDA0002923235630000034
Is established, (4) to hide xiThe location of 0 or 1 is scrambled by using a function Shuffle (·), and if the condition is satisfied, the purchase management organization adds the public key pk of the supplieriThe authentication provider list Slist is entered into the authentication provider list.
5. The expert-evaluation safe-procurement sourcing system supporting privacy-protected secret bidding according to claim 2, wherein the bid comparison stage is a Fischlin-protocol-based protocol that does not require third-party integer comparison, and wherein two or more suppliers who bid the same are processed by a BidComp algorithm, the execution time of the BidComp being T2And T3In the meantime.
6. The expert evaluation secure procurement sourcing system supporting privacy-protected secret bidding according to claim 2, wherein the quality evaluation phase is to aggregate quality evaluation scores obtained by various suppliers from different experts through a QEval algorithm, and in the process, ensure that each expert is not aware of the scores of other experts, and wherein the QEval algorithm comprises three phases: EncQS, AggQS and DecQS, where each expert uses the public key pk of the supplier being evaluatediEncrypts the scores, then in the AggQS phase each supplier aggregates the scores obtained from different experts, finally in DecQS each supplier uses the private key skiDecrypting the aggregated score to obtain a final score, wherein the Qerval execution time is T3And T4In the meantime.
7. The expert evaluation secure procurement sourcing system for privacy-preserving private bidding support according to claim 2, wherein the winner declaration phase finds the final winner by a WinDec algorithm, the WinDec having a time at T4And T5Firstly, the purchase management organization obtains the final score of the supplier through the private key, and uses the private key skpmTo obtain the final scores of the respective suppliers
Figure FDA0002923235630000042
If it is
Figure FDA0002923235630000043
If yes, allowing the supplier to participate in the following process, otherwise, regarding that the supplier provides an unreal final score in the last stage, not allowing the supplier to participate in the following process, after verification, the purchasing management organization obtains the size relationship of any two suppliers' bids and the quality evaluation score of each supplier from the block chain, then determines the winner according to the process that the supplier wins the bid, and firstly, according to the obtained bid comparison result and the quality evaluation score, the purchasing management organization obtains two winning suppliersThe ranked list is the bid ranked list BPlist and the quality score ranked list AQSlist, and the procurement management organisation then assigns appropriate weighting factors to these two lists, with the winner declaration rules as follows: (1) the lower the bid price in the BPlist is, the larger the element value is; (2) the higher the mass fraction in the AQSlist is, the larger the element value is; (3) use of
Figure FDA0002923235630000041
And (3) calculating the supplier with the highest score to become a final winner, and if two or more suppliers provide the same bid price or obtain the same quality evaluation score, the values of the elements in the BPlist or the AQSlist are equal, K is a constant, and w is a weight coefficient.
CN202110124778.3A 2021-01-29 2021-01-29 Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system Pending CN112734541A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110124778.3A CN112734541A (en) 2021-01-29 2021-01-29 Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110124778.3A CN112734541A (en) 2021-01-29 2021-01-29 Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system

Publications (1)

Publication Number Publication Date
CN112734541A true CN112734541A (en) 2021-04-30

Family

ID=75594707

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110124778.3A Pending CN112734541A (en) 2021-01-29 2021-01-29 Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system

Country Status (1)

Country Link
CN (1) CN112734541A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117592458A (en) * 2024-01-19 2024-02-23 辽宁省网联数字科技产业有限公司 Digital bidding document blind box analysis method and system based on artificial intelligence

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117592458A (en) * 2024-01-19 2024-02-23 辽宁省网联数字科技产业有限公司 Digital bidding document blind box analysis method and system based on artificial intelligence
CN117592458B (en) * 2024-01-19 2024-04-05 辽宁省网联数字科技产业有限公司 Digital bidding document blind box analysis method and system based on artificial intelligence

Similar Documents

Publication Publication Date Title
Lavi et al. Redesigning bitcoin’s fee market
Harkavy et al. Electronic auctions with private bids.
Lavi et al. Competitive analysis of incentive compatible on-line auctions
Li et al. Credit-based payments for fast computing resource trading in edge-assisted Internet of Things
CN107392743B (en) McAfe two-way auction privacy protection method and auction method
Atallah et al. Secure supply-chain protocols
Heimbach et al. Sok: Preventing transaction reordering manipulations in decentralized finance
Porter et al. On cheating in sealed-bid auctions
Kikuchi (M+ 1) st-price auction protocol
CN111402043B (en) Block chain-based internet of vehicles data transaction method
CN110570274B (en) Logistics order optimal distribution system and method with privacy protection function
Li et al. FAPS: a fair, autonomous and privacy-preserving scheme for big data exchange based on oblivious transfer, ether cheque and smart contracts
CN107241806B (en) Auction and privacy protection based bidirectional heterogeneous spectrum allocation method
Micali et al. Cryptography miracles, secure auctions, matching problem verification
US7240198B1 (en) Honesty preserving negotiation and computation
Li et al. Secure multi‐unit sealed first‐price auction mechanisms
CN116545773A (en) Method, medium and electronic equipment for processing privacy data
CN112734541A (en) Privacy protection supported secret bidding and expert evaluation safe purchasing sourcing system
Huang et al. Profit sharing for data producer and intermediate parties in data trading over pervasive edge computing environments
Milionis et al. A framework for single-item nft auction mechanism design
CN112819594A (en) Privacy protection dynamic spectrum auction method based on alliance chain
Chen et al. Privacy-preserving spectrum auction design: challenges, solutions, and research directions
Trevathan Security, anonymity and trust in electronic auctions
Peng et al. Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing
Shih et al. A secure reverse Vickrey auction scheme with bid privacy

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20210430