CN103198427A - Multi-attribute closed bidding type online auction method based on qualitative bidding - Google Patents

Abstract

The invention discloses a multi-attribute closed bidding type online auction method based on qualitative bidding. The method comprises the following steps of: S1, acquiring a public key and a private key by terminal equipment of Party A and terminal equipment of Party B at trade; S2, establishing a preference ranking set by the Party A at the trade, and collecting the preference rankings; S2, establishing a bid set by the Party B at the trade, and establishing an interpolation polynomial through each bid, encrypting the parameters of the interpolation polynomial through a secret key, and publishing the encrypting parameters of the interpolation polynomial, wherein elements in the bid set are described into qualitative state; S4, operating the encrypting parameters of the interpolation polynomial of the Party B at the trade by the Party A at the trade, and publishing the operation result; S5, acquiring an operation structure of the Party A at the trade by Party B at the trade, operating at the second time, and publishing the operation result; and S6, determining the party winning the bid according to the result of the second operation. According to the multi-attribute closed bidding type online auction method based on the qualitative bidding, the multi-attribute auction process is realized through a qualitative model, and therefore the party winning the auction can be precisely determined.

Description

The online auction system of multiattribute sealing bid based on qualitative bid

Technical field

The present invention relates to a kind of online auction system of multiattribute sealing bid based on qualitative bid, belong to e-commerce field.

Background technology

The mathematical theory research of auction deep carrying out decades, online auction is no longer strange as a kind of novel electronic business model.As everyone knows, have many safety problems in the auction, auction needs to satisfy following safety requirements:

1. anonymity: the competitive bidding people can not be in auction identified identity;

2. trackability: the winner must be disclosed behind End of Auction;

3. do not fabricate: can not pretend to be other competitive bidding people;

4. unforgeable: can not forge an effectively bid;

5. non repudiation: the competitive bidding people can not deny bid;

6. fairness: must be by administrator authentication;

7. the open property verified: whether effectively the bid that everyone can check offerer's identity and can confirm them;

8. each auction of taking turns is not related: can not the same individual's bid in the auction of different bouts be connected.

Whether electronic auction can be divided into open bidding (open-bid auctions) and sealing bid (sealed-bid auctions) according to the opening of bidding, and the bid of sealing bid every bidders before the end of bidding is maintained secrecy always.From another angle, can be divided into monolateral auction (one-sided auction) and Double Auction (two-sided/double auction) again, a seller (buyer) accepts the bid from a plurality of buyers (seller) in the monolateral auction, is the form of " one-to-many "; A plurality of buyers and seller can bid and acceptance is bidded in Double Auction, are the forms of " multi-to-multi ".Monolateral sealed electronic auction protocol is studied accumulation and practice for a long time, obtained more achievement in research, very strong practicality and security guarantee are arranged, and increasing research begins to consider to utilize various cryptological technique means to guarantee the security of submitting a tender, such as zero-knowledge proof and safe calculating means etc. in many ways, these technology provide the open property verified than the stronger bid privacy of simple encryption technology and winner.

Existing auction technique all is single attribute auctions.For example, application number is that 200910131681.4 and 201110329533.0 Chinese invention patent application all is single attribute auction model.But along with deepening continuously of the market demand, the uniforma price attribute decides auction winner's auction technique no longer to satisfy the demand as decisive leading factor, the multiattribute auction is compared with the auction of uniforma price attribute, and both parties can both obtain more golden eggs in the multiattribute auction.The multiattribute auction becomes the focus of auction theoretical research gradually.These research focuses mainly concentrate on: the computation complexity problem that the winner determines, the buyer purchases the cost problem, seller's cost function problem, the structure of bid and allocation problem, aspects such as winner's problem of the number.The winner determined this model theory research key problem during these aspects were all auctioned round multiattribute basically, had 4 kinds of main modes in the prior art and determined the winner:

1. define various utility functions;

2. Fuzzy Multiple Attribute Decision Making algorithm;

3. pre-list price equation technology;

By calculate with the desirable degree of deviation of submitting a tender and with the least desirable degree of deviation of submitting a tender.

Present most researchers with all quantitative attributes and qualitatively attribute finally all change into numerical value and determine the winner by size relatively by linear effectiveness equation, be the method and system that the patented claim institute disclosed a kind of multiattribute of difference of US20120246020 and US2010324974A1 is auctioned as application number.But not all can be converted into numeric ratio by utility function fully based on quantitative attribute and the bid of attribute qualitatively.Such as, the multiattribute bid that defines in the prior art comprises price attribute and non-price attribute two parts, the following x of i supplier's bid structure _i=(x _I1, x _I2), x wherein _I1Contain M, contain price in each and quantity is right, as x _I1={ (p _I1, q _I1) ..., (p _Im, q _Im), P _IjBe price, q _IjBe corresponding quantity.Other K non-price attribute is described as x _I2={ x _I21..., x _I2k, this wherein the integer that all is defined between [1-10] of non-price attribute represent grade, 10 expressions are highest, 1 expression lowermost level.Have independence between relation between price and the quantity and the quantitative attributes, even can define the dependence between the quantitative attributes, but but be beyond expression the influence relation of quantitative attributes for qualitative attribute.In addition, because the peer-to-peer between some quantitative attributes, these quantitative attributes can not simply be divided into grade, and in actual conditions, the relation between the quantitative attributes is very complicated.Such as, in the A set 3 attribute a are arranged, b, c, these three attributes all are quantitative numerical value, each attribute has the weights (being equivalent to the importance in assessment) of oneself, the a* weights+b* weights+c* weights are this is linear, but the combination of a and b, how does the combination of b and c embody the influence of this assessment? how to calculate these weights? if under the situation of n attribute, the combination of 2 attributes, how does the influence of combination of 3 attributes etc. embody? these all can't accurately or be difficult to go to describe with the form that quantizes, and the assessment equation of this linearity can't resolve.

In addition, the research focus of multiattribute auction at present is mainly the income problem that economic angle is considered the buyer and the seller, computation complexity problem on the model is not considered other marketing characters of these multiattributes auction models and agreement, such as the information security characteristic.Though " Secure Multi-attribute Procurement Auction " proposed the multiattribute auction model of a safety, this model utilizes linear utility function to decide the winner, and utilizes homomorphic cryptography technology such as (homomorphic encryption) to realize the openly property confirmed of bid confidentiality and winner." a kind of multiattribute auction system of dark mark asked price " also proposed safe multiattribute auction scheme by the dark mark asked price multiattribute auction scheme (SAMAV) of improving safety, under the situation of the effectiveness of taking into account auction and strategy, utilize safety calculating in many ways and zero-knowledge proof to come the guarantee agreement security." A New Secure Protocol for Multiattribute Multi-round E-reverse Auction Using Online Trusted Third Party " utilizes ElGamal encryption system structure key chain to realize characteristics such as bid confidentiality in the multiattribute auction process, the winner's of being unrealized open checking." Anonymity and verifiability in multi-attribute reverse auction " utilized the Paillier homomorphic cryptography technology that provides in the Parkes auction model to realize the security of submitting a tender and the open property verified afterwards.But above these safe electronics multiattribute auction models all are that all bids of hypothesis can finally be converted into quantitative linear effectiveness equation; and utilized the character of homomorphic cryptography, the safest computational problem all is summed up as the comparison problem of quantized values under the homomorphic cryptography guard mode.And the safe account form that needs in the winner's deciding means based on qualitative bid determines that with utilizing the effectiveness equation model of quantitatively submitting a tender the safe account form that needs in winner's algorithm is different fully; be the safe account form that also needs for the winner's deciding means that solves based on qualitative bid in the prior art, to guarantee to seal the bid secret protection of qualitative bid and the open property verified.

In addition, document " A New Secure Protocol for Multi-attribute Multiround E-reverse Auction Using Online Trusted Third Party " and " Anonymity and verifiability in multi-attribute reverse auction " disclose a kind of based on quantitative multiattribute auction system respectively, but there is following defective in it:

Security is relatively poor, a little less than the bid secret protection, can not begin to finishing to remain the underground of bid from auction;

Do not support the mixing of quantitative and quantitative attributes, only support simple qualitative attribute auction;

Data processing time is longer, and efficient is lower.

Summary of the invention

The objective of the invention is to, a kind of online auction system of multiattribute sealing bid based on qualitative bid is provided, it can effectively solve problems of the prior art, especially in the auction of existing multiattribute with all quantitative attributes and qualitatively attribute finally all change into numerical value by linear effectiveness equation and by size decision winner relatively, because the combination of some quantitative attributes or quantitative attributes can't accurately or be difficult to go to describe with the form that quantizes, thereby can't adopt linear effectiveness equation fundamentally to come effectively to solve the problem of multiattribute auction.

For solving the problems of the technologies described above, the present invention adopts following technical scheme: a kind of online auction system of multiattribute sealing bid based on qualitative bid may further comprise the steps:

S1, transaction first, Party B terminal device obtains a PKI and respectively private key, according to the paillier algorithm for encryption from certification authority's server;

S2, transaction Party A terminal device make up the set of hobby rank according to takeing part in auction community set, and should like rank and gather and be sent to the bulletin board server;

S3, transaction Party B terminal device makes up the bid set

And make up an interpolation polynomial with each bid wherein

With the polynomial parameter of secret key encryption difference, and announce the encryption parameter of interpolation polynomial at the bulletin board server

Wherein, the element in the described bid set all is described as qualitatively S _iRepresent any one among a plurality of transaction Party B, t represents the gesture of bid set, Be a bid during wherein the Party B gathers arbitrarily, 1≤j≤t;

S4, transaction Party A terminal device makes up the bid set

Transaction Party A terminal device carries out computing to the encryption parameter of transaction Party B interpolation polynomial:

And announcement operation result information

Wherein, t is the gesture of bid set,

Be a bid during the Party B gathers arbitrarily, 1≤j≤t,

Be the random number of j element generation of Party A,

Be Party A's signature equation, the Hash equation that H () adopts for the Party A;

S5, transaction Party B terminal device obtains transaction Party A's computing structure from bulletin board, carries out the computing second time:

And announce operation result information at bulletin board:

Wherein, Be Party B's decrypting process, Decrypting process for the Party B;

S6, transaction Party A terminal device be according to the result of the computing second time, if

Then according to the hobby rank gather the auction winner.

Among the step S4, when transaction Party A terminal device carries out computing to the encryption parameter of transaction Party B interpolation polynomial, if given ciphertext c ₁=E (m ₁), c ₂=E (m ₂), ciphertext C then ^*=E (m ₁+ m ₂) can when having private key, not calculate; If given ciphertext c=E (m) and a random number r, ciphertext C ^*=E (rm) can not calculate when having private key; The character that transaction Party A terminal device utilizes homomorphic cryptography is carried out computing to the encryption parameter of seller's interpolation polynomial:

And announcement is to the operation result of the encryption parameter of transaction Party B interpolation polynomial

Adopt the TOPSIS method to like rank among the said method step S2.

Element in bid described in the above-mentioned steps S3 set is attribute or quantitative attribute or the combination of attribute and quantitative attribute qualitatively qualitatively, and quantitative attribute can be converted into attribute qualitatively.

If the element in the bid set is quantitative attribute or the combination of attribute and quantitative attribute qualitatively, then by the TOPSIS method quantitative attribute is converted into attribute qualitatively.

Describedly be converted into quantitative attribute qualitatively by the TOPSIS method that attribute specifically comprises:

A. evaluation index is given a mark, and the result that will give a mark is expressed as the math matrix form, sets up eigenmatrix:

$D=\left[\begin{array}{ccc}{x}_{11}L& x_{1j}L& x_{1\mathrm{jn}}\\ M& M& M\\ x_{i1}L& x_{\mathrm{ij}}L& x_{\mathrm{in}}\\ M& M& M\\ x_{m1}L& x_{\mathrm{mj}}L& x_{\mathrm{mm}}\end{array}\right]=\left[\begin{array}{c}{D}_1\left(x_1\right)\\ M\\ D_i\left(x_j\right)\\ M\\ D_m\left(x_n\right)\end{array}\right]$

$=[X_1\left(x_1\right),...,X_j\left(x_i\right),...,X_n\left(x_m\right)];$

B. eigenmatrix is carried out standardization processing, vectorial r obtains standardizing _IjFoundation is about the vectorial r that standardizes _IjThe standardization matrix; Wherein, eigenmatrix is carried out standardization processing, vectorial r obtains standardizing _IjMethod be:

$r_{\mathrm{ij}}=\frac{x_{\mathrm{ij}}}{\sqrt{{\mathrm{\Σ}}_{i=1}^m{x}_{\mathrm{ij}}^2}}$

i＝1,2,...,m,j＝1,2,...,n；

C. calculate weight normalized value v _Ij, and set up about weight standardization value v _IjWeight standardization matrix; Wherein, calculate weight normalized value v _IjMethod be:

v _ij＝w _jr _ij,i＝1,2,...,m,j＝1,2,...,n

Wherein, w _jRefer to the weight of j index;

D. according to weight normalized value v _IjDetermine ideal solution A ^*With anti-ideal solution A ^-:

$A^{*}=({\max }_i{v}_{\mathrm{ij}}/j\∈J_1),({\min }_i{v}_{\mathrm{ij}}/j\∈J_2),i=\mathrm{1,2},...,m=v_1^{*},v_2^{*},...,v_j^{*},...,v_n^{*}$

$A^{-}=({\min }_i{v}_{\mathrm{ij}}/j\∈J_1),({\max }_i{v}_{\mathrm{ij}}/j\∈J_2),i=\mathrm{1,2},...,m=v_1^{-},v_2^{-},...,v_j^{-},...,v_n^{-}$

Wherein, J ₁Refer to rentability index set, be illustrated in the 1st optimal value on the index; J ₂Refer to loss index set, be illustrated in the 2nd the most bad value on the index;

E. calculate the distance that each target arrives ideal solution and anti-ideal solution:

$S^{*}=\sqrt{\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{(V_{\mathrm{ij}}-v_j^{*})}^2}$

$S^{-}=\sqrt{\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{(V_{\mathrm{ij}}-v_j^{-})}^2}$

Wherein, i=1,2 ... m, S ^*The expression target is to ideal solution A ^*Distance, S ^-The expression target is to anti-ideal solution A ^-Distance;

With

Represent that respectively j target is to optimal objective and the distance of bad target, v _IjIt is the weight normalized value of j evaluation index of i target;

F. calculate the approach degree of ideal solution

$C_i^{*}=\frac{S_i^{*}}{(S_i^{*}+S_i^{-})},i=\mathrm{1,2},...m;$

In the formula,

When

The time, A _i=A ^-, represent that this target is the most bad target; When

The time, A _i=A ^*, represent that this target is optimal objective;

G. according to C ^*Value by order from small to large each evaluation objective is arranged.

Among the above-mentioned steps c, adopt Delphi method, logarithm least square method, analytical hierarchy process or entropy method to determine weight.

The transaction Party B passes through among the present invention Verify the winner.

Transaction Party A described in the present invention is the buyer or the seller, and the transaction Party B is the seller or the buyer, and auction model is one-to-many.

Compared with prior art, the present invention has following beneficial effect:

(1) by making up qualutative model, the process of multiattribute auction is solved with model qualitatively, thereby the association between can the Fuzzy Processing attribute determines to auction the winner more accurately;

(2) by utilizing " occuring simultaneously maintains secrecy calculates " this technology that the concrete condition in the auction is improved; thereby for the process of qualitative multiattribute auction provides safe bid secret protection and the open property verified, can guarantee to begin to remain the underground of bid to end from auction.Utilize at present more general safety analysis instrument that the online auction system of multiattribute sealing bid based on qualitative bid among the present invention is analyzed, the result shows that online auction system of the present invention is safe; The safety analysis report that obtains is as follows:

(3) the present invention can support based on online auction system quantitative and that quantitative attributes mixes, thereby applicability is stronger, and range of application is wider;

(4) compared with prior art, the data-handling efficiency of the online auction system of multiattribute sealing bid based on qualitative bid of the present invention has improved 75%.

Description of drawings

Fig. 1 is the structural representation of a kind of embodiment of the present invention.

The present invention is further illustrated below in conjunction with the drawings and specific embodiments.

Embodiment

Embodiments of the invention: a kind of online auction system of multiattribute sealing bid based on qualitative bid as shown in Figure 1, may further comprise the steps:

S1, transaction first, Party B terminal device obtains a PKI and respectively private key, according to the paillier algorithm for encryption from certification authority's server; S2, transaction Party A terminal device make up the set of hobby rank according to takeing part in auction community set, and should like rank and gather and be sent to the bulletin board server; S3, transaction Party B terminal device makes up the bid set

And make up an interpolation polynomial with each bid wherein

With the polynomial parameter of secret key encryption difference, and announce the encryption parameter of interpolation polynomial at the bulletin board server

Wherein, the element in the described bid set all is described as qualitatively, a Party A is arranged, a plurality of Party B S in the transaction ₁, S ₂..., S _i, S _iRepresent any one among a plurality of transaction Party B, t represents the gesture of bid set,

Be a bid during wherein the Party B gathers arbitrarily, 1≤j≤t, S4, transaction Party A terminal device makes up the bid set

Transaction Party A terminal device carries out computing to the encryption parameter of transaction Party B interpolation polynomial: $C_{s_{i,j}}=E_{{\mathrm{PK}}_{s_i}}(r_{s_{i,j}}.f_{s_i}\left(O_{c_j}\right)+r_{s_{i,j}}),$ And announcement operation result information

Wherein, t is the gesture of bid set,

Be a bid during the Party B gathers arbitrarily, 1≤j≤t,

Be the random number of j element generation of Party A, Be Party A's signature equation, the Hash equation that H () adopts for the Party A; S5, transaction Party B terminal device obtains transaction Party A's computing structure from bulletin board, carries out the computing second time: And announce operation result information at bulletin board:

Wherein,

Be Party B's decrypting process,

Decrypting process for the Party B; S6, transaction Party A terminal device be according to the result of the computing second time, if

Then according to the hobby rank gather the auction winner.Adopt the TOPSIS method to like rank among the step S2.Element in bid described in the step S3 set is attribute or quantitative attribute or the combination of attribute and quantitative attribute qualitatively qualitatively, and quantitative attribute all is converted into attribute qualitatively.The transaction Party B passes through among the present invention

Verify the winner.If the element in the bid set is quantitative attribute or the combination of attribute and quantitative attribute qualitatively, then by the TOPSIS method quantitative attribute is converted into attribute qualitatively.Describedly be converted into quantitative attribute qualitatively by the TOPSIS method that attribute specifically comprises:

A. evaluation index is given a mark, and the result that will give a mark is expressed as the math matrix form, sets up eigenmatrix:

$D=\left[\begin{array}{ccc}{x}_{11}L& x_{1j}L& x_{1\mathrm{jn}}\\ M& M& M\\ x_{i1}L& x_{\mathrm{ij}}L& x_{\mathrm{in}}\\ M& M& M\\ x_{m1}L& x_{\mathrm{mj}}L& x_{\mathrm{mm}}\end{array}\right]=\left[\begin{array}{c}{D}_1\left(x_1\right)\\ M\\ D_i\left(x_j\right)\\ M\\ D_m\left(x_n\right)\end{array}\right]$

$=[X_1\left(x_1\right),...,X_j\left(x_i\right),...,X_n\left(x_m\right)];$

B. eigenmatrix is carried out standardization processing, vectorial r obtains standardizing _IjFoundation is about the vectorial r that standardizes _IjThe standardization matrix; Wherein, eigenmatrix is carried out standardization processing, vectorial r obtains standardizing _IjMethod be:

$r_{\mathrm{ij}}=\frac{x_{\mathrm{ij}}}{\sqrt{{\mathrm{\Σ}}_{i=1}^m{x}_{\mathrm{ij}}^2}}$

i＝1,2,...,m,j＝1,2,...,n；

C. calculate weight normalized value v _Ij, and set up about weight standardization value v _IjWeight standardization matrix; Wherein, adopt Delphi method, logarithm least square method, analytical hierarchy process or entropy method to determine weight; Calculate weight normalized value v _IjMethod be:

v _ij＝w _jr _ij,i＝1,2,...,m,j＝1,2,...,n

Wherein, w _jRefer to the weight of j index;

D. according to weight normalized value v _IjDetermine ideal solution A ^*With anti-ideal solution A ^-:

$A^{*}=({\max }_i{v}_{\mathrm{ij}}/j\∈J_1),({\min }_i{v}_{\mathrm{ij}}/j\∈J_2),i=\mathrm{1,2},...,m=v_1^{*},v_2^{*},...,v_j^{*},...,v_n^{*}$

$A^{-}=({\min }_i{v}_{\mathrm{ij}}/j\∈J_1),({\max }_i{v}_{\mathrm{ij}}/j\∈J_2),i=\mathrm{1,2},...,m=v_1^{-},v_2^{-},...,v_j^{-},...,v_n^{-}$

Wherein, J ₁Refer to rentability index set, be illustrated in the 1st optimal value on the index; J ₂Refer to loss index set, be illustrated in the 2nd the most bad value on the index;

E. calculate the distance that each target arrives ideal solution and anti-ideal solution:

$S^{*}=\sqrt{\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{(V_{\mathrm{ij}}-v_j^{*})}^2}$

$S^{-}=\sqrt{\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{(V_{\mathrm{ij}}-v_j^{-})}^2}$

Wherein, i=1,2 ... m, S ^*The expression target is to ideal solution A ^*Distance, S ^-The expression target is to anti-ideal solution A ^-Distance;

With

Represent that respectively j target is to optimal objective and the distance of bad target, v _IjIt is the weight normalized value of j evaluation index of i target;

F. calculate the approach degree of ideal solution

$C_i^{*}=\frac{S_i^{*}}{(S_i^{*}+S_i^{-})},i=\mathrm{1,2},...m;$

In the formula,

When

The time, A _i=A ^-, represent that this target is the most bad target; When

The time, A _i=A ^*, represent that this target is optimal objective;

G. according to C ^*Value by order from small to large each evaluation objective is arranged.

The principle of work of embodiments of the invention: suppose that the community set that simply takes part in auction is:

Color { red, white, Huang, indigo plant }

Hard disk { 300G, 500G, 1T, 2T}

CPU{2Ghz，3Ghz，3Ghz}

Maintenance 1 year, and 2 years, 3 years }

The buyer lists 3 combination bid(according to the hobby power of oneself and differs and be decided to be 3, can be n), B1〉B2〉B3, (complicated hobby rank can adopt the TOPSIS method)

B1={ is red, 500G, 2Ghz, 1 year }

B2={ is white, 1T, 3Ghz, 1 year }

B3={ ... slightly }

Seller 1 lists 3 combination bid

S11={ ... slightly }

S12={ ... slightly }

S13={ ... slightly }

Seller 2 lists 3 combination bid

S21={ ... slightly }

S22={ ... slightly }

S23={ ... slightly }

Seller 1 will make up 3 bid{S11 among the bid, S12, and S13} is as interpolation calculation polynomial expression (seller 2 similar sellers 1 omit) herein

F (x)=(x-S11) (x-S12) (x-S13) and encrypts multinomial coefficient E (a11), E (a12), E (a13);

The buyer checks the multinomial coefficient E (a11) of the encryption that seller 1 announces, E (a12), and E (a13), and calculate with these coefficients:

C11=E(r1＊f(B1)+r1)

C12=E(r1＊f(B2)+r1)

C13=E(r1＊f(B3)+r1)

The buyer announces C11, C12, C13, and H(r1) (H() be the Hash equation);

Seller 1 checks the C11 that the buyer announces, C12, C13, and H(r1), be decrypted calculating: N11=D (C11);

The buyer is H(N11 relatively) whether equal H(r1), if equate, B1=S11 then.

Through similarly calculating relatively, net result is that the buyer only knows that with the seller it is identical which bid is arranged, and different bid do not expose mutually, have finally finished the mutual consultation under the bid confidential state; And buyer's bid sorts according to its hobby, and finally among the buyer bid that mates according to seller 1 and seller 2, which hobby rank is higher then to be the winner.

Claims (7)

1. the online auction system of multiattribute sealing bid based on qualitative bid is characterized in that, may further comprise the steps:

S1, transaction first, Party B terminal device obtains a PKI and respectively private key, according to the paillier algorithm for encryption from certification authority's server;

S2, transaction Party A terminal device make up the set of hobby rank according to takeing part in auction community set, and should like rank and gather and be sent to the bulletin board server;

S3, transaction Party B terminal device makes up the bid set

And make up an interpolation polynomial with each bid wherein

With the polynomial parameter of secret key encryption difference, and announce the encryption parameter of interpolation polynomial at the bulletin board server Wherein, the element in the described bid set all is described as qualitatively S _iRepresent any one among a plurality of transaction Party B, t represents the gesture of bid set,

Be a bid during wherein the Party B gathers arbitrarily, 1≤j≤t;

S4, transaction Party A terminal device makes up the bid set

Transaction Party A terminal device carries out computing to the encryption parameter of transaction Party B interpolation polynomial:

And announcement operation result information

Wherein, t is the gesture of bid set, Be a bid during the Party B gathers arbitrarily, 1≤j≤t,

Be the random number of j element generation of Party A,

Be Party A's signature equation, the Hash equation that H () adopts for the Party A;

S5, transaction Party B terminal device obtains transaction Party A's computing structure from bulletin board, carries out the computing second time:

And announce operation result information at bulletin board:

Wherein,

Be Party B's decrypting process,

Decrypting process for the Party B;

S6, transaction Party A terminal device be according to the result of the computing second time, if

Then according to the hobby rank gather the auction winner.

2. the online auction system of multiattribute sealing bid based on qualitative bid according to claim 1 is characterized in that, adopts the TOPSIS method to like rank among the step S2.

3. the online auction system of multiattribute sealing bid based on qualitative bid according to claim 2 is characterized in that, the element in the bid set described in the step S3 is attribute or quantitative attribute or the combination of attribute and quantitative attribute qualitatively qualitatively.

4. the multiattribute based on qualitative bid according to claim 3 seals the online auction system of bid, it is characterized in that, if the element in the bid set is quantitative attribute or the combination of attribute and quantitative attribute qualitatively, then by the TOPSIS method quantitative attribute is converted into attribute qualitatively.

5. the online auction system of multiattribute sealing bid based on qualitative bid according to claim 1 is characterized in that, describedly is converted into quantitative attribute qualitatively by the TOPSIS method that attribute specifically comprises:

A. evaluation index is given a mark, and the result that will give a mark is expressed as the math matrix form, sets up eigenmatrix:

$D=\left[\begin{array}{ccc}{x}_{11}L& x_{1j}L& x_{1\mathrm{jn}}\\ M& M& M\\ x_{i1}L& x_{\mathrm{ij}}L& x_{\mathrm{in}}\\ M& M& M\\ x_{m1}L& x_{\mathrm{mj}}L& x_{\mathrm{mm}}\end{array}\right]=\left[\begin{array}{c}{D}_1\left(x_1\right)\\ M\\ D_i\left(x_j\right)\\ M\\ D_m\left(x_n\right)\end{array}\right]$

$=[X_1\left(x_1\right),...,X_j\left(x_i\right),...,X_n\left(x_m\right)];$

B. eigenmatrix is carried out standardization processing, vectorial r obtains standardizing _IjFoundation is about the vectorial r that standardizes _IjThe standardization matrix; Wherein, eigenmatrix is carried out standardization processing, vectorial r obtains standardizing _IjMethod be:

$r_{\mathrm{ij}}=\frac{x_{\mathrm{ij}}}{\sqrt{{\mathrm{\Σ}}_{i=1}^m{x}_{\mathrm{ij}}^2}}$

i＝1,2,...,m,j＝1,2,...,n；

C. calculate weight normalized value v _Ij, and set up about weight standardization value v _IjWeight standardization matrix; Wherein, calculate weight normalized value v _IjMethod be:

v _ij＝w _jr _ij,i＝1,2,...,m,j＝1,2,...,n

Wherein, w _jRefer to the weight of j index;

D. according to weight normalized value v _IjDetermine ideal solution A ^*With anti-ideal solution A ^-:

$A^{*}=({\max }_i{v}_{\mathrm{ij}}/j\∈J_1),({\min }_i{v}_{\mathrm{ij}}/j\∈J_2),i=\mathrm{1,2},...,m=v_1^{*},v_2^{*},...,v_j^{*},...,v_n^{*}$

$A^{-}=({\min }_i{v}_{\mathrm{ij}}/j\∈J_1),({\max }_i{v}_{\mathrm{ij}}/j\∈J_2),i=\mathrm{1,2},...,m=v_1^{-},v_2^{-},...,v_j^{-},...,v_n^{-}$

Wherein, J ₁Refer to rentability index set, be illustrated in the 1st optimal value on the index; J ₂Refer to loss index set, be illustrated in the 2nd the most bad value on the index;

E. calculate the distance that each target arrives ideal solution and anti-ideal solution:

$S^{*}=\sqrt{\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{(V_{\mathrm{ij}}-v_j^{*})}^2}$

$S^{-}=\sqrt{\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{(V_{\mathrm{ij}}-v_j^{-})}^2}$

Wherein, i=1,2 ... m, S ^*The expression target is to ideal solution A ^*Distance, S ^-The expression target is to anti-ideal solution A ^-Distance;

With

Represent that respectively j target is to optimal objective and the distance of bad target, v _IjIt is the weight normalized value of j evaluation index of i target;

F. calculate the approach degree of ideal solution

$C_i^{*}=\frac{S_i^{*}}{(S_i^{*}+S_i^{-})},i=\mathrm{1,2},...m;$

In the formula,

When The time, A _i=A ^-, represent that this target is the most bad target; When

The time, A _i=A ^*, represent that this target is optimal objective;

G. according to C ^*Value by order from small to large each evaluation objective is arranged.

6. the online auction system of multiattribute sealing bid based on qualitative bid according to claim 5 is characterized in that, among the step c, adopts Delphi method, logarithm least square method, analytical hierarchy process or entropy method to determine weight.

7. the online auction system of multiattribute sealing bid based on qualitative bid according to claim 1 is characterized in that transaction the Party B pass through

Verify the winner.

Images