| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To make secret the combined bidding of two or more kinds of wealth other than bidding information even to the other bidders and bid opening persons. <P>SOLUTION: A price is expressed with vectors with E(1) and E(z) encrypted by a semi-uniform type E as components based on a number 1 and the other numbers z, and bidders x add E(z) corresponding to a bidding price b<SB>x</SB>to E<SB>0</SB>and E<SB>x</SB>among null function encrypted sentences E<SB>0'</SB>to E<SB>b</SB>whose number is larger than that of the number b of the bidders by one, and those respective bidders x carry out this processing in a preliminarily decided order. After this processing has been carried out by all the bidders x, the maximum value m in the components of E<SB>0</SB>is calculated, and the combination of wealth which is turned to be z at first by decoding the m-th components of E<SB>0</SB>is defined as optimal assignment A<SP>*</SP>, and the assignment number is defined as Q, and the component number which is turned to be z at first by decoding the Q-th components of those respective E<SB>x</SB>is defined as a payment sum p<SB>x</SB>. <P>COPYRIGHT: (C)2004,JPO&NCIPI</p> |
