# US 2009/0276325 A1 · System and method for quantitative competition and recording medium having recorded thereon program for implementing the method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2009/0276325 A1
- Document ID: US20090276325A1
- Status: Published application
- Kind: A1
- Application number: 12/488,980
- Filed: 2009-06-22
- Published: 2009-11-05
- Earliest claimed: 1999-07-19
- Assignees: Nippon Telegraph and Telephone Corporation
- Inventors: Kunio Kobayashi; Hikaru Morita; Koutarou Suzuki
- Web page: https://patentgrep.com/patent/US20090276325A1

## CPC

- G06Q 30/06: Buying, selling or leasing transactions
- G06Q 30/0601: Electronic shopping [e-shopping]
- G06Q 30/08: Auctions
- G06Q 40/00: Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q 40/04: Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
- 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

## Abstract

A bid-opening device 20 receives from each bidding device 10m a bidding price index γm=g(hk(IVm)) (where IVm is an initial value, hk indicates k-times processing with a one-way function h and g is a one-way function) and its identifier IDm. The received information is stored on a common bulletin board 25. Dm=hk(IVm) (where Dm=g(Dm) is generated with k set as the upper limit value K of the bidding price. The bulletin board 25 is checked for γm which matches this Dm. If no match is found, m is incremented by one, and the check for γm-Dm matching is made for each of m bidding devices. Upon completion of the matching for all the bidding devices, k is decremented by one, and a check is made for γm which matches Dm=g(hk(IVm)), and the index k for which they match is determined as the highest price bid. The bid-opening device 20 outputs that k and the identifier IDm of γm.

## Claims

### Claim 1

A quantitative competition method for a system in which a plurality of participant devices send their secret aimed values to a server device and said server device determines which of said plurality of participant devices has offered the maximum or minimum one of said aimed values received, and in which there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, and m=1, 2, . . . , M, M being an integer equal to or greater than 2; said method comprising the steps wherein:
(a) each of said participant devices processes, with a predetermined one-way function h and through the use of said conversion table, information k(+)bm(k)(+)Rm(k), which contains each index k equal to or larger than an index km corresponding to said aimed value, select information bm(k) indicating whether said index k corresponds to said aimed value, and a random number Rm(k), to generate at least K−km+1 pieces of aimed value information h(k(+)bm(k)(+)Rm(k)), and sends these pieces of aimed value information to said server device, A(+)B representing a predetermined arbitrary operation;
(b) said server device publishes its received aimed value information on a bulletin board accessible from all of said participant devices;
(c) said server device obtains said random number Rm corresponding to each of said sequence of indexes k;
(d) letting a be a predetermined value with which said select information bm(k) indicates said aimed value, said server device calculates h(k(+)a(+)Rm(k));
(e) said server device checks said aimed values on said bulletin board for matching with said calculated h(k(+)a(+)Rm(k)); and
(f) if a match is detected in said step (e), said server device decides that the aimed value of the aimed value information of a participant device having sent said random number Rm(k) at that time is the maximum or minimum value.

### Claim 2 (depends on 1)

The method of claim 1, further comprising a step wherein if a match is detected in said step (d), said server device repeats said steps (c), (d) and (e) for the next value of said index k.

### Claim 3 (depends on 2)

The method of claim 2, wherein said step (c) includes the steps wherein: said server device requests said each participant device to send said random number Rm(k) corresponding to said index k; said each participant device sends said requested random number Rm(k) to said server device; and said server device receives said random number Rm(k).

### Claim 4 (depends on 2)

The method of claim 2, wherein:
said step (a) includes a step wherein said each participant device sends said aimed value information h(k(+)bm(k)(+)Rm(k)) to said server device together with said random number Rm(k);
said step (b) includes a step wherein said server device stores said random number Rm(k) in a nonpublic memory; and
said step (c) includes the steps wherein: said server device requests said each participant device to send said random number Rm(k) corresponding to said index k; said each participant device sends said requested random number Rm(k) to said server device; and said server device receives said random number Rm(k).

### Claim 5 (depends on 1)

The method of claim 1 wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in the same direction, and in said step (c) said server device determines the maximum aimed value.

### Claim 6 (depends on 1)

The method of claim 1, wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in opposite directions, and in said step (c) said server device determines the minimum aimed value.

### Claim 7 (depends on 1)

The method of claim 1, wherein let an arbitrary aimed value be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said index k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0;
said step (a) includes a step wherein, letting said aimed value PRm of said each participant device m be represented by PRm=F(km)+Qm, said each participant device m generates said aimed value information by processing said initial value with said one-way function h by the number of times corresponding to km, sends said aimed value information to said server device together with said fraction Qm, where m=1, 2, . . . , M, M being an integer equal to or greater than 2;
said step (b) includes a step wherein said server device publishes said aimed value information and said fraction Qm on a bulletin board accessible from all of said participant devices;
said step (c) includes a step where said server device makes a check for matching between said updated initial value and said aimed value information for each index value in an ascending or descending order of said fraction Qm where m=1, 2, . . . , M; and
said step (d) includes a step wherein upon first detection of a match in said step (c), said server device finishes said check and determines, from km and m at the time of detecting the match, that PRm=F(km)+Qm is said maximum or minimum aimed value.

### Claim 8 (depends on 1)

The method of claim 1, further comprising the steps wherein:
(0-1) said each participant device m sends its identifier IDm to a provisional identifier registration device;
(0-2) said provisional identifier registration device issues a provisional identifier AIDm for said identifier IDm, and stores said identifier IDm and said provisional identifier AIDm in pair form in storage means;
(0-3) said provisional identifier registration device sends said provisional identifier AIDm to said each participant device; and
(0-4) said each participant device m sends said provisional identifier AIDm as said identifier to said server device, together with said aimed value information.

### Claim 9

A participant device for a system in which M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, said participant device comprising:
aimed value generating means;
aimed value transforming means which processes said aimed value with a predetermined one-way function by the number of times corresponding to said aimed value to obtain aimed value information; and
sending means for sending to said server device said aimed value information and an identifier specifying said participant device.

### Claim 10 (depends on 9)

The participant device of claim 9, wherein said aimed value transforming means comprises:
a conversion table for converting said aimed value PRm to the corresponding index km;
a one-way function h processor which processes an initial value IVm inherent to said participant device with a one-way function h by the number of times corresponding to said index km to obtain an output hkm(IVm); and
a one-way function g processor which processes said output from said one-way function h processor with a one-way function g to obtain said aimed value information.

### Claim 11 (depends on 10)

The participant device of claim 10, further comprising verification information generating means which generates Cm=hK+1(IVm) as verification information by processing said initial value IVm with said one-way function h K+1 times and sends said verification information Cm to said server device.

### Claim 12 (depends on 9)

The participant device of claim 9, wherein said aimed value information transforming means comprises:
a memory in which there is stored a conversion table which defines the relationships between a sequence of monotone varying values selectable as aimed values and a sequence of indexes, for converting said aimed value PRm to the corresponding index km;
a one-way function h processor which processes an initial value inherent to said participant device with a one-way function h by the number of time corresponding to said index km and outputs hkm(IVm); and
a one-way function g processor which processes the output from said one-way function h processor with a one-way function g to obtain said aimed value information.

### Claim 13 (depends on 9)

The participant device of claim 9, which further comprises: a random generator for generating a random number Rm; an operating device for operating said random number Rm and said aimed value PRm to obtain PRm(+)Rm; one-way function h processing means for processing said PRm(+)Rm with a one-way function h to obtain h(PRm(+)Rm); and verification information generating means for processing said initial value IVm with said one-way function h K+1 times to generate Cm=hK+1(IVm); and wherein said h(PRm(+)Rm) and said verification information are sent to said server device together with said aimed value information.

### Claim 14 (depends on 9)

The participant device of claim 9, wherein said aimed value transformer comprises:
a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values;
a select information generator which generates select information bm(k) indicating whether to select an aimed value corresponding to each of said indexes k=1, 2, . . . , K;
a random generator which generates a random number Rm(k) inherent to said participant device m and said index k;
an operating device which receives said index k, said random number Rm(k) and said select information bm(k) and performs an operation k(+)bm(k)(+)Rm(k);
a one-way function h processor which processes said k(+)bm(k)(+)Rm(k) with a one-way function h to obtain h(k(+)bm(k)(+)Rm(k)); and
a control device which computes said h(k(+)bm(k)(+)Rm(k)) for each of said indexes k and provides the k pieces information as said aimed value information.

### Claim 15 (depends on 9)

The participant device of claim 9, wherein said aimed value transformer comprises:
a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values, for converting said aimed value PRm to the corresponding index km;
initial value updating means which, for each index k, processes an initial value with a one-way function h and adds the processed initial value with select information bm(k) for said index k to obtain an updated initial value and repeats this processing until k=K is reached, thereby generating Hm(K);
select information generator which generates said select information bm(k) whether said aimed value corresponds to each index k from at least km to K;
a one-way function h processor which processes said initial value with said one-way function h;
a concatenator which concatenates said Hm(k−1) and said select information to generate Hmk=h(Hm(k−1)∥bm(k));
a buffer which temporarily holds the output from said concatenator and outputs said output for the next value of said index k; and
a storage part which, for each value of said index k, stores Hm(k) corresponding thereto; and
wherein said sending means is a means which responds to a request of said server device for said index k to read out Hm(k) from said storage part and send said Hm(k) to said server device.

### Claim 16 (depends on 9)

The participant device of claim 9, wherein said aimed value transformer comprises:
a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values, for converting said aimed value PRm to the corresponding index km;
a one-way function g processor which processes said initial value IVm with a one-way function g by a predetermined number of times xm to generate gxm(IVm);
a one-way function h processor which processes said gxm(IVm) with a one-way function h K−km times to generate Hm(K)=hk−km(gxm(IVm)) as said aimed value information; and
response generating means which responds to a request from said server device for k to decide whether k=km, and if true, generates Hm(k−1)=hk−km−1(gxm(IVm)), and if false, generates Hm(k−1)=gxm−1(IVm); and
wherein said sending means sends said Hm(k−1) in response to said request from said server device for said k.

### Claim 17 (depends on 9)

The participant device of claim 9, wherein said aimed value transformer comprises:
a conversion table memory which has stored therein a conversion table which defines the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, for converting said aimed value PRm to the corresponding index km;
a fraction calculating part which, letting an arbitrary aimed value PR be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0, calculates said fraction Qm=PRm−F(km) based on F(km) obtained from said conversion table and said aimed value PRm; and
a one-way function h processor which processes said initial value IVm with said one-way function h by the number of times corresponding to said km to generate said aimed value information; and
wherein said sending means sends said fraction Qm to said server device together with said aimed value information.

### Claim 18

A server device for a system in which M participant devices send their aimed values to said server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, said device comprising:
a conversion table memory which has stored therein a conversion table which defines the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, for converting said aimed value PRm to the corresponding index km;
a bulletin board on which said server device writes said aimed value information an identifier received from each of said participant devices;
updated initial value generating means which generates an updated initial value by processing said initial value with a one-way function repeatedly in correspondence with values of an index k which is a predetermined consecutive positive integers;
a counter which updates said index k one by one; and
control means which, upon each updating of said index k, compares said updated initial value with said aimed value information on said bulletin board to check whether they match, and determines m and k at the time of first detection of a match.

### Claim 19 (depends on 18)

The server device of claim 18, wherein: there are published on said bulletin board γm=g(hkm(IVm)) as said aimed value information;
said updated initial value generating means includes a one-way function g processor by which a response Dm=hk(IVm) received from said participant device in correspondence with said index k is processed with a one-way function g to generate g(Dm) as said updated initial value; and
said control means makes a check to see if there exists on said bulleting board said aimed value information γm which matches said updated initial value g(Dm).

### Claim 20 (depends on 19)

The server device of claim 19, wherein there is published on said bulletin board Cm=hK+1(IVm) received from said participant device in advance, said server device further comprising a one-way function h processor which processes said response Dm with a one-way function h to generate h(Dm), and
wherein said control means checks whether Cm=h(Dm) holds, and if not, rewrites said Cm with said Dm and updates said index k on said counter.

### Claim 21 (depends on 18)

The server device of claim 18, wherein:
there are published on said bulletin board Cm=hK+1(IVm), said aimed value information γm=hk(IVm) and h(PRm(+)Rm) received from said each participant device, said PRm and said Rm being an aimed value and a random number of said each participant device m;
said control means decides the maximum or minimum aimed value from said aimed values PRm and said random numbers Rm received from said participant devices, and determines the index kmx corresponding to said maximum or minimum aimed value and requests said each participant device to send Dm=hkmx(IVm) corresponding to said index kmx;
said updated initial value generating means comprises a one-way function h processor for processing Dm with a one-way function h to generate hK+−kmx(Dm), and a one-way function g processor for processing Dj with a one-way function g to generate g(Dj); and
said control means makes a check to see if said hK+1−kmx(Dm) matches Cm on said bulletin board and if said g(Dj) matches said γm on said bulleting board.

### Claim 22 (depends on 18)

The server device of claim 18, wherein:
there are published on said bulletin board h(k(+)bm(k)(+)Rm(k)) together with said aimed value information γm received from said each participant device, said bm(k) being select information whether said index k corresponds to its aimed value and said Rm(k) being a random number generated for said index k;
said server device further comprises an operator for operating k(+)b(+)Rm(k), and a one-way function h processor for processing the result of said operation with a one-way function h to generate h(k(+)b(+)Rm(k)), where b is a predetermined value which indicates that said select information bm(k) has selected the aimed value corresponding to said index k; and
said control means makes a check for matching between said h(k(+)b(+)Rm(k)) and said h(k(+)bm(k)(+)Rm(k)) on said bulletin board.

### Claim 23 (depends on 18)

The server device of claim 18, wherein:
there is published on said bulletin board, as said aimed value information, Hm(K) generated by said each participant device which, upon each processing of said initial value with a one-way function h, added the processed value with select information bm(k) indicating whether said value was an aimed value for each value of said index k and repeated this processing from at least the index km corresponding to said aimed value to the upper limit value K of said index k;
said updated initial value generating means includes a one-way function h processor by which {Hm(k−1), bm} received from said each participant device in answer to an inquiry for said index k is processed with a one-y function h to generate Hm(k)=h(Hm(k−1)∥bm(k)); and
said server device includes an updated initial value comparator for making a check to see if said Hm(k) matches previously received Hm(k).

### Claim 24 (depends on 18)

The server device of claim 18, wherein: letting an arbitrary aimed value PR be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said index k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0, there is published on said bulletin board said fraction Q received from said each participant device, together with said aimed value information;
said server device includes a sequencer for deciding the sequence of said fractions Qm on said bulletin board;
said updated initial value generating means includes a one-way function h processor for processing said initial value with a one-way function h by k times to generate hk(IVm) and a one-way function g processor for processing said hk(IVm) with a one-way function g to generate Dm=g(hk(IVm)); and
control means makes a check to see if said Dm matches said aimed value information on said bulletin board in the sequence of said fractions Qm.

### Claim 25 (depends on 18)

The server device of claim 18, wherein there is published on said bulletin board Hm(K)=hK−km(gxm(IVm)) as said aimed value information received from said each participant device, which further comprises a one-way function h processor by which Hm(k−1) received from said each participant device as an answer to an inquiry for said k is processed with a one-way function h to generate h(Hm(k−1)), and a one-way function g processor for processing said answer Hm(k−1) with a one-way function g to generate g(Hm(k−1)); and
wherein said control means: makes a check to see if said h(Hm(k−1)) matches said aimed value information Hm(K) published on said bulletin board; if a match is detected, updates said aimed value information Hm(K) with said Hm(k−1) and decrements said index k on said counter by one; and if a mismatch is detected, makes a check to see if said g(Hm(k−1)) matches said aimed value information Hm(K); and if a match is detected, determines, based on k and m at that time, the maximum or minimum aimed value PRm and the participant device m having offered said value PRm.

### Claim 26 (depends on 18)

The server device of claim 18, wherein: letting an arbitrary aimed value PR be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said index k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0, there is published on said bulletin board said fraction Q received from said each participant device, together with said aimed value information;
said server device includes:
a sequencer for deciding the sequence of said fractions Qm on said bulletin board; and
select information comparator for checking whether said select information bm(k) is equal to a value b indicating the selection of the aimed value corresponding to said index k in said decided sequence of fractions Qm.

### Claim 27 (depends on 10)

The device of claim 10, wherein said sequence of index values k and said sequence of values selectable as said aimed values on said conversion table are monotone increasing values in the same direction, and said server device determines the maximum aimed value.

### Claim 28 (depends on 10)

The device of claim 10, wherein said sequence of index values k and said sequence of values selectable as said aimed values on said conversion table are monotone increasing values in opposite directions, and said server device determines the minimum aimed value.

### Claim 29

A recording medium on which there is recorded as a program the procedure which is followed by an m-th one of M participant devices, where m=1, 2, . . . , M, in a quantitative competition method for a system in which said M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps of:
(a) processing an initial value inherent to said participant device m with a predetermined one-way function by the number of times corresponding to said aimed value to generate aimed value information
γm=g(hkm(IVm))
where g is a one-way function, IVm is said initial value, km is an index corresponding to the aimed value of said participant device m and hkm(IVm) indicates processing of said initial value IVm with a one-way function h by km times; and
(b) sending said aimed value information γm=g(hkm(IVm)) to said server device.

### Claim 30

A recording medium on which there is recorded as a program the procedure which is followed by an m-th one of M participant devices, where m=1, 2, . . . , M, in a quantitative competition method for a system in which said M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps of:
(a-1) processing an initial value inherent to said participant device m with a predetermined one-way function by the number of times corresponding to said aimed value to generate aimed value information
γm=g(hkm(IVm))
where g is a one-way function, IVm is said initial value, km is an index corresponding to the aimed value of said participant device m and hkm(IVm) indicates processing of said initial value IVm with a one-way function h by km times;
(a-2) generating verification information Cm=hK+1(IVm) and sending said verification information to said server device together with said aimed value information γm;
(b) generating said initial value updated by the number of times requested by said server device and sending said updated initial value to said server device; and
(c) sending said aimed value information γm=g(hkm(IVm)) to said server device.

### Claim 31 (depends on 30)

The recording medium of claim 30, wherein said step (b) includes a step of generating Dm=hk(IVm) as said updated initial value corresponding to said index k and sending said updated initial value to said server device in response to its request.

### Claim 32

A recording medium on which there is recorded as a program the procedure which is followed by an m-th one of M participant devices, where m=1, 2, . . . , M, in a quantitative competition method for a system in which said M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps of:
(a-1) computing aimed value information by
γm=g(hkm(IVm))
where g is a one-way function, IVm is said initial value, km is an index corresponding to the aimed value PRm of said participant device m and hkm(IVm) indicates processing of said initial value IVm with a one-way function h by km times;
(a-2) generating verification information Cm=hK+1(IVm);
(a-3) generating h(PRm(+)Rm) from a random number Rm and said aimed value PRm and sending said h(PRm(+)Rm) to said server device together with said aimed value information γm and said verification information Cm, said (+) indicating a predetermined arbitrary operation;
(b-1) sending said aimed value PRm and said random number Rm to said server device in response to its request; and
(b-2) generating Dm=hk(IVm) as said updated initial value corresponding to said index k and sending said updated initial value to said server device in response to its request to present said hk(IVm).

### Claim 33 (depends on 32)

The recording medium of claim 32, wherein said step (a-3) is a step of generating h(PRm(+)Rm) from a random number Rm, said aimed value PRm and additional information Im about the sending of said aimed value information indicated by said participant device m and sending said h(PRm(+)Rm) to said server device, said additional information Im being sent to said server device in said step (b-2).

### Claim 34

A recording medium on which there is recorded as a program the procedure which is followed by an m-th one of M participant devices, where m=1, 2, . . . , M, in a quantitative competition method for a system in which said M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps wherein:
(a) upon each processing of said initial value with said one-way function h, said each participant device generates an updated initial value by adding said processed initial value with select information bm(k) indicating whether said processed initial value is an aimed value for one value of said index k, and generates Hm(K) by repeatedly performing this processing from at least that index km of a sequence of indexes which corresponds to said aimed value to the upper limit value K, and sends said Hm(K) as said aimed value information to said server device;
(b-1) said server device requests said each participant device to send an updated initial value {Hm(k−1), bm(k)} corresponding to each value of said index k in descending order from K; and
(b-2) said each participant device generates and sends {Hm(k−1), bm(k)} as said updated initial value to said server device.

### Claim 35

A recording medium on which there is recorded as a program the procedure which is followed by an m-th one of M participant devices, where m=1, 2, . . . , M, in a quantitative competition method for a system in which said M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps of:
(a) generating Hm(K)=hK−km(gxm(IVm)) as said aimed value information using a predetermined positive integer xm, an initial value IVm and one-way functions h and g, and sends said aimed value information to said server device;
(b-1) decides whether its received index k from said server device is the index km corresponding to said aimed value;
(b-2) if the result of decision in step (b-1) is k=km, generating and sending Hm(k−1)=gxm−1(IVm) as said updated initial value to said server device; and
(b-3) if the result of decision in said step (b-1) is not k=km, generating and sending Hm(k−1)=hk−km−1(gxm(IVm)) as said updated initial value to said server device.

### Claim 36

A recording medium on which there is recorded as a program the procedure which is followed by an m-th one of M participant devices, where m=1, 2, . . . , M, in a quantitative competition method for a system in which said M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, letting the initial value of said each participant device be represented by IVm, said procedure comprising the steps of:
(a) generating Hm(K)=hK−km(gxm(IVm)) as said aimed value information using a predetermined positive integer xm, an initial value IVm and one-way functions h and g, and sends said aimed value information to said server device;
(b-1) decides whether its received index k from said server device is the index km corresponding to said aimed value;
(b-2) if the result of decision in step (b-1) is k=km, generating Hm(k−1)=gxm−1(IVm) as said updated initial value and sending said updated initial value to said server device together with a flag indicating that said k and km are equal; and
(b-3) if the result of decision in said step (b-1) is not k=km, generating and sending Hm(k−1)=hk−km−1(gxm(IVm)) as said updated initial value to said server device.

### Claim 37

A recording medium on which there is recorded as a program the procedure which is followed by an m-th one of M participant devices, where m=1, 2, . . . , M, in a quantitative competition method for a system in which said M participant devices send their aimed values to a server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the step of:
(a) processing, with a predetermined one-way function h and through the use of said conversion table, information k(+)bm(k)(+)Rm(k), which contains each index k equal to or larger than an index km corresponding to said aimed value, select information bm(k) indicating whether said index k corresponds to said aimed value, and a random number Rm(k), to generate at least K−km+1 pieces of aimed value information h(k(+)bm(k)(+)Rm(k)), and sends these pieces of aimed value information to said server device, A(+)B representing a predetermined arbitrary operation.

### Claim 38 (depends on 37)

The recording medium of claim 37, wherein said procedure further comprises a step of sending to said server device a random number Rm(k) corresponding to the index k received from said server device.

### Claim 39 (depends on 37)

The recording medium of claim 37, wherein said step (a) includes a step of sending a random number Rm(k) to said server device together with said h(k(+)bm(k)(+)Rm(k)).

### Claim 40 (depends on 30)

The recording medium of claim 30, wherein let an arbitrary aimed value be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said index k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0;
said procedure further comprises a step wherein, letting said aimed value PRm of said each participant device m be represented by PRm=F(km)+Qm, said each participant device m sends said fraction Qm to said server device together with said aimed value information γm.

### Claim 41 (depends on 30)

The recording medium of claim 30, wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in the same direction.

### Claim 42 (depends on 30)

The recording medium of claim 30, wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in opposite directions.

### Claim 43 (depends on 30)

The recording medium of claim 30, wherein said procedure further comprises the steps of:
(0-1) sending the identifier IDm of said each participant device to a provisional identifier registration device;
(0-2) receiving a provisional identifier AIDm from said provisional identifier registration device; and
(0-3) sending said provisional identifier AIDm as an identifier to said server device together with said aimed value information.

### Claim 44

A recording medium on which there is recorded as a program the procedure which is followed by a server device in a quantitative competition method for a system in which a plurality of participant devices send their aimed values to said server device and said server device determines which of said participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps of:
(a) receiving, from each of participant devices, h(Hm(K)) generated as aimed value information of said each participant device by repeating, for each of a sequence of index values k from at least km corresponding to an aimed value of said each participant device to an upper limit index value K, processing of:
combining an initial value of said each participant device with select information to provide combined information and
operating a one-way function h on said combined information to generate an updated value, said select information indicating whether said each index value k is an aimed value or not, and
publishing said aimed value information h(Hm(K)) on a bulletin board accessible from all of said participant devices and any other devices as well;
(b) requesting said each participant device to send an updated initial value {Hm(k−1), bm(k)} corresponding to each value of said index k in descending order from K;
(c) publishing said updated initial value {Hm(k−1), bm(k)} on said bulletin board;
(d) processing said updated initial value {Hm(k−1), bm(k)} with said one-way function h to generate Hm(k)=h(Hm(k−1)∥bm(k));
(e) checking whether said updated initial value Hm(k) matches Hm(k) in {Hm(k), bm(k+1)} received previously; and
(f) if a match is detected in said step (e), deciding whether said select information bm(k) represents that the corresponding index k is the index km of said aimed value; and
(g) if the result of decision in said step (f) is true, outputting said index k concerned and the corresponding participant device number m, and if the result of decision is false, said server device returns to said step (b) and repeats processing for the next index value k.

### Claim 45

A recording medium on which there is recorded as a program the procedure which is followed by a server device in a quantitative competition method for a system in which a plurality of participant devices send their aimed values to said server device and said server device determines which of said participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps wherein said server device:
(a) receives Hm(K) as said aimed value information from said each participant device which, upon each processing of said initial value with said one-way function h, generates an updated initial value by adding said processed initial value with select information bm(k) indicating whether said processed initial value is an aimed value for one value of said index k, and generates Hm(K) by repeatedly performing this processing from at least that index km of a sequence of indexes which corresponds to said aimed value to the upper limit value K, and publishes said aimed value information Hm(K) on a bulletin board accessible from all of said participant device;
(b) for each value of said index k in order descending from K, inquires said each participant device about whether it has bid for said index k, said each participant device responding YES or NO to said inquiry;
(c) upon first detection of the response YES, requests said each participant device to send its updated initial value Hm(k−1); and
(d) receives Hm(k−1)=h(Hm(k−2)∥bm(k−1)) as said updated initial value from said each participant device and publishes said received updated initial value on said bulletin board;
(e) letting a and a represent predetermined values of said select information bm(k) indicating bidding and not bidding, respectively, generates, for said participant device m having bid for the current index k,
Hm=h( . . . h(h(Hm(k−1)∥a)∥a) . . . ∥a)
through the use of said updated initial value Hm(k−1), and for every one of the other participant devices m, generates
Hm=h( . . . h(h(Hm(k−1)∥a)∥a) . . . ∥a)
through the use of said updated initial values Hm(k−1);
(f) checks whether said Hm for said each participant device matches said Hm(k) published on said bulletin board; and
(g) if a match is detected in said step (f), determines that said participant device having responded YES is the winning bidding device, and publishes the current value of said index k as the index km of the aimed value of said winning bidding device.

### Claim 46

A recording medium on which there is recorded as a program the procedure which is followed by a server device in a quantitative competition method for a system in which a plurality of participant devices send their aimed values to said server device and said server device determines which of said participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps of:
(a) letting the initial value of said each participant device be represented by IVm, receiving from said each participant device Hm(K)=hK−km(gxm(IVm)) generated as said aimed value information using a predetermined positive integer xm, said initial value IVm and one-way functions h and g;
(b) publishing said aimed value information Am on a bulletin board accessible from all of said participant devices; and
(c) sending said index k to said each participant device to ask for its updated initial value;
(d) processing said updated initial value Hm(k−1) with said one-way function h to generate h(Hm(k−1));
(e) deciding whether said h(Hm(k−1)) is equal to said aimed value information Hm(K);
(f) if it is decided in said step (e) that they are equal, updating said aimed value information Hm(K) with said updated initial value Hm(k−1), then decrementing said index k by one and returning to said step (c);
(g) if it is decided in said step (e) that they are not equal, processing said updated initial value Hm(k−1) with said one-way function g to generate g(Hm(k−1)); and
(h) deciding whether said g(Hm(k−1)) matches said aimed value information Hm(K); and
(i) deciding that the aimed value of said participant device corresponding to m and k having provided said match is the maximum or minimum, if a match is detected in said step (h).

### Claim 47

A recording medium on which there is recorded as a program the procedure which is followed by a server device in a quantitative competition method for a system in which a plurality of participant devices send their aimed values to said server device and said server device determines which of said participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps wherein said server device:
(a), letting the initial value of said each participant device be represented by IVm, where m=1, 2, . . . , M, M being an integer equal to or greater than 2, receives from each participant device, as said aimed value information, Hm(K)=hK−km(gxm(IVm)) using a predetermined positive integer xm, said initial value IVm and one-way functions h and g, and publishes said received aimed value information on a bulletin board accessible from all of said participant devices;
(b) for each value of said index k in order descending from K, inquires said each participant device about whether it has bid for said index k, said each participant device responding YES or NO to said inquiry;
(c) upon first detection of the response YES, requests said each participant device to send its updated initial value Hm(k−1);
(d) receives from said each participant device Hm(k−1)=gxm−1(IVm) if k=km and Hm(k−1)=hk−km−1(gxm(IVm)) if k≠km;
(e) for said updated initial value Hm(k−1) received from said participant device having responded YES, generates
Hm=hK−kmg(Hm(k−1))
and for said updated initial value received from said each participant device having responded NO, generates
Hm=hK+1−kg(Hm(k−1))
(f) checks whether said Hm for said each participant device matches said Hm(K) published on said bulletin board; and
(g) if a match is detected in said step (f), determines that said participant device having responded YES is the winning bidding device, and publishes the current value of said index k as the index Km of the aimed value of said winning bidding device.

### Claim 48

A recording medium on which there is recorded as a program the procedure which is followed by a server device in a quantitative competition method for a system in which a plurality of participant devices send their aimed values to said server device and said server device determines which of said participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, said procedure comprising the steps of:
(a) letting the initial value of said each participant device be represented by IVm, receiving from said each participant device Hm(K)=hK−km(gxm(IVm)) generated as said aimed value information using a predetermined positive integer xm, said initial value IVm and one-way functions h and g;
(b) publishing said aimed value information Hm(K) on a bulletin board accessible from all of said participant devices; and
(c) sending said index k to said each participant device to ask for its updated initial value;
(d) checking whether its received updated initial value Hk,m is added with said flag;
(e) if it is decided in said step (d) that said flag is added, processing said updated initial value Hm(k−1) with said one-way function g to generate g(Hm(k−1));
(f) deciding whether said g(Hm(k−1)) matches said aimed value information Hm(K);
(g) if it is decided in said step (d) that no flag is added, processing said updated initial value Hm(k−1) with said one-way function h to generate h(Hm(k−1));
(h) deciding whether said h(Hm(k−1)) matches said aimed value information Hm(K);
(i) if it is decided in said step that they are equal, updating said aimed value information Hm(K) with said initial value Hm(k−1), then decrementing said index k by one and returning to said step (c); and
(j) if it is decided in said step (h), processing said initial value Hm(k−1) with said one-way function g to generate g(Hm(k−1)) and returning to said step (f); and
(k) if a match is detected in said step (f), deciding that the aimed value of said participant device corresponding to m and k having provided said match is the maximum or minimum.

### Claim 49

A recording medium on which there is recorded as a program the procedure which is followed by a server device in a quantitative competition method for a system in which a plurality of participant devices send their aimed values to said server device and said server device determines which of said participant devices has offered the maximum or minimum one of said aimed values received, and there is provided a conversion table showing the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, and m=1, 2, . . . , M, M being an integer equal to or greater than 2; said procedure comprising the steps of:
(a) receiving from each of said participant devices at least K−km+1 pieces of aimed value information h(k(+)bm(k)(+)Rm(k)) generated by processing, with a predetermined one-way function h and through the use of said conversion table, information k(+)bm(k)(+)Rm(k), which contains each index k equal to or larger than an index km corresponding to said aimed value, select information bm(k) indicating whether said index k corresponds to said aimed value, and a random number Rm(k), A(+)B representing a predetermined arbitrary operation between A and B;
(b) receiving and publishing said aimed value information on a bulletin board accessible from all of said participant devices;
(c) obtaining said random number Rm corresponding to each of said sequence of indexes k;
(d) calculating h(k(+)a(+)Rm(k)), where a is a predetermined value with which said select information bm(k) indicates said aimed value;
(e) checking said aimed values on said bulletin board for matching with said calculated h(k(+)a(+)Rm(k)); and
(f) if a match is detected in said step (e), deciding that the aimed value of the aimed value information of a participant device having sent said random number Rm(k) at that time is the maximum or minimum value.

### Claim 50 (depends on 49)

The recording medium of claim 49, wherein said procedure further comprises a step of repeating said steps (c), (d) and (e) if a match is detected in said step (d).

### Claim 51 (depends on 50)

The recording medium of claim 50, wherein said step (c) includes the steps of: requesting said each participant device to send said random number Rm(k) corresponding to said index k; and receiving said random number Rm(k) from said each participant device.

### Claim 52 (depends on 50)

The recording medium of claim 50, wherein:
said step (a) includes a step of receiving said random number Rm(k) sent from said each participant device together with said aimed value information h(k(+)bm(k)(+)Rm(k));
said step (b) includes a step of storing said random number Rm(k) in a nonpublic memory; and
said step (c) includes the steps of: requesting said each participant device to send said random number Rm(k) corresponding to said index k; and receiving said random number Rm(k) from said each participant device.

### Claim 53 (depends on 44)

The recording medium of claim 44, wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in the same direction, and in said step (c) said server device determines the maximum aimed value.

### Claim 54 (depends on 44)

The recording medium of claim 44, wherein said sequences of indexes k and values selectable as said aimed values are both monotonous increasing values in opposite directions, and in said step (c) said server device determines the minimum aimed value.

### Claim 55 (depends on 44)

The recording medium of claim 44, wherein let an arbitrary aimed value be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said index k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0;
said step (a) includes a step wherein, letting said aimed value PRm of said each participant device m be represented by PRm=F(km)+Qm, said server device receives from each participant device m said aimed value information generated by processing said initial value with said one-way function h by the number of times corresponding to km, together with said fraction Qm, where m=1, 2, . . . , M, said M being an integer equal to or greater than 2, and said server device publishes said aimed value information and said fraction Qm on a bulletin board accessible from all of said participant devices;
said step (c) includes a step where said server device makes a check for matching between said updated initial value and said aimed value information for each index value in an ascending or descending order of said fraction Qm where m=1, 2, . . . , M; and
said step (d) includes a step wherein, upon first detection of a match in said step (c), said server device finishes said check and determines, from km and m at the time of detecting the match, that PRm=F(km)+Qm is said maximum or minimum aimed value.

### Claim 56 (depends on 49)

The recording medium of claim 49, wherein let an arbitrary aimed value be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said index k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0;
said step (a) includes a step wherein, letting said aimed value PRm of said each participant device m be represented by PRm=F(km)+Qm, said server device receives said fraction Qm together with said aimed value information;
said step (b) includes a step of publishing said fraction Qm on said bulletin board together with said aimed value information, where m=1, 2, . . . , M, said M being an integer equal to or greater than 2;
said step (e) includes a step of making said check for matching for each index value in an ascending or descending order of said fraction Qm where m=1, 2, . . . , M; and
said step (f) includes a step wherein, upon first detection of a match in said step (c), said server device finishes said check and determines, from km and m at the time of detecting the match, that PRm=F(km)+Qm is said maximum or minimum aimed value.

### Claim 57

A quantitative competition system which comprises a server device and M participant devices each connected via a communication channel to said server device and in which said M participant devices send their aimed values to said server device and said server device determines which of said M participant devices has offered the maximum or minimum one of said aimed values received,
each of said participant devices comprising:
aimed value generating means for generating an aimed value PRm;
aimed value transforming means provided with a conversion table memory having stored therein a conversion table which defines the relationships between a sequence of values selectable as said aimed values and a sequence of indexes corresponding thereto, for converting said aimed value PRm to the corresponding index km and which processes said aimed value with a predetermined one-way function by the number of times corresponding to said aimed value to obtain aimed value information; and
sending means for sending to said server device said aimed value information and an identifier identifying said participant device; and
said server device comprising:
a conversion table memory which has stored therein a conversion table which is the same as said conversion table;
a bulletin board on which said server device writes said aimed value information an identifier received from said each participant device;
updated initial value acquiring means which acquires an updated initial value obtained by processing said initial value with a one-way function repeatedly in correspondence with values of an index k which is a predetermined consecutive positive integers;
a counter which updates said index k one by one; and
control means which, upon each updating of said index k, compares said updated initial value with said aimed value information on said bulletin board to check whether they match, and determines m and k at the time of first detection of a match.

### Claim 58 (depends on 57)

The system of claim 57, wherein said each participant device has initial value updating means for processing said initial value with a one-way function h to generate an updated initial value and for sending said updated initial value to said server device, and said updated initial value acquiring means of said server device receives said updated initial value from said each participant device.

### Claim 59 (depends on 57)

The system of claim 57, wherein said updated initial value acquiring means of said server device processes said initial value with a one-way function h to generate said updated initial value.

### Claim 60 (depends on 58)

The system of claim 58, wherein said aimed value transformer of said each participant device comprises:
a one-way function h processor which processes an initial value IVm inherent to said participant device with a one-way function h by the number of times corresponding to said index km to obtain an output hkm(IVm); and
a one-way function g processor which processes said output from said one-way function h processor with a one-way function g to obtain said aimed value information.

### Claim 61 (depends on 60)

The system of claim 60, wherein said aimed value transformer of said each participant device includes verification information generating means for processing said initial value IVm with said one-way function h by K+1 times to generate Cm=hK+1(IVm) as verification information and for sending said verification information to said server device;
wherein there is published on said bulletin board Cm=hK+1(IVm) received from said each participant device in advance, said server device further comprising a one-way function h processor which processes said response Dm with a one-way function h to generate h(Dm), and
wherein said control means checks whether Cm=h(Dm) holds, and if not, rewrites said Cm with said Dm and updates said index k on said counter.

### Claim 62 (depends on 57)

The system of claim 57, wherein said each participant device comprises:
a random generator for generating a random number Rm;
an operating device for operating said random number Rm and said aimed value PRm to obtain PRm(+)Rm, where (+) represents a predetermined arbitrary operation;
one-way function h processing means for processing said PRm(+)Rm with a one-way function h to obtain h(PRm(+)Rm); and
verification information generating means for processing said initial value IVm with said one-way function h K+1 times to generate Cm=hK+1(IVm); and wherein:
said h(PRm(+)Rm) and said verification information are sent to said server device together with said aimed value information;
in said server device:
there are published on said bulletin board Cm=hK+1(IVm), said aimed value information γm=hk(IVm) and h(PRm(+)Rm) received from said each participant device, said PRm and said Rm being an aimed value and a random number of said each participant device m;
said control means decides the maximum or minimum aimed value from said aimed values PRm and said random numbers Rm received from said participant devices, and determines the index kmx corresponding to said maximum or minimum aimed value and requests said each participant device to send (Dm)=hkmx(IVm) corresponding to said index kmx;
said updated initial value acquiring means comprises a one-way function h processor for processing Dm with a one-way function h to generate hK+1−kxm(Dm), and a one-way function g processor for processing Dj with a one-way function g to generate g(Dj); and
said control means makes a check to see if said hK+1−kmx(Dm) matches Cm on said bulletin board and if said g(Dj) matches said γm on said bulleting board.

### Claim 63 (depends on 57)

The system of claim 57, wherein said aimed value transformer of said each participant device comprises:
a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values;
a select information generator which generates select information bm(k) indicating whether to select an aimed value corresponding to each of said indexes k=1, 2, . . . , K;
a random generator which generates a random number Rm(k) inherent to said participant device m and said index k;
an operating device which receives said index k, said random number Rm(k) and said select information bm(k) and performs an operation k(+)bm(k)(+)Rm(k);
a one-way function h processor which processes said k(+)bm(k)(+)Rm(k) with a one-way function h to obtain h(k(+)bm(k)(+)Rm(k)); and
a control device which computes said h(k(+)bm(k)(+)Rm(k)) for each of said indexes k and provides the k pieces information as said aimed value information;
in said server device:
there are published on said bulletin board h(k(+)bm(k)(+)Rm(k)) together with said aimed value information γm received from said each participant device;
said server device further comprises an operator for operating k(+)b(+)Rm(k), and
a one-way function h processor for processing the result of said operation with a one-way function h to generate h(k(+)b(+)Rm(k)), where b is a predetermined value which indicates that said select information bm(k) has selected the aimed value corresponding to said index k; and
said control means makes a check for matching between said h(k(+)b(+)Rm(k)) and said h(k(+)bm(k)(+)Rm(k)) on said bulletin board.

### Claim 64 (depends on 57)

The system of claim 57, wherein said aimed value transformer of said each participant device comprises:
a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values, for converting said aimed value PRm to the corresponding index km;
initial value updating means which, for each index k, processes an initial value with a one-way function h and adds the processed initial value with select information bm(k) for said index k to obtain an updated initial value and repeats this processing until k=K is reached, thereby generating Hm(K);
a one-way function h processor for outputting said updated initial value Hm(k) from said initial value updating means as said aimed value information;
select information generator which generates said select information bm(k) whether said aimed value corresponds to each index k from at least km to K;
a concatenator which concatenates said Hm(k−1) from said one-way function h processor and said select information bm(k) to generate Hmk=h(Hm(k−1)∥bm(k));
a buffer which temporarily holds the output from said concatenator and outputs said output for the next value of said index k;
a storage part which, for each value of said index k, stores Hm(k) corresponding thereto; and
a second one-way function h processor by which Hm(k), obtained by repeating processing until k=K, is processed with a one-way function h to generate h(Hm(k)), said h(Hm(k)) being output as said aimed value information;
wherein said sending means is a means which responds to a request of said server device for said index k to read out Hm(k) from said storage part and send said Hm(k) to said server device;
in said server device:
there are published on said bulletin board, as said aimed value information, h(Hm(k)) obtained by processing, with a one-way function h, Hm(k) generated by said each participant device which, upon each processing of said initial value with a one-way function h, added the processed value with select information bm(k) indicating whether said value was an aimed value for each value of said index k and repeated this processing from at least the index km corresponding to said aimed value to the upper limit value K of said index k;
said initial value updating means includes a one-way function h processor by which {Hm(k−1), bm} received from said each participant device in answer to an inquiry for said index k is processed with a one-y function h to generate Hm(k)=h(Hm(k−1)∥bm(k)); and
said server device includes an updated initial value comparator for making a check to see if said Hm(k) matches Hm(k) in {Hm(k), bm(k+1)} previously received.

### Claim 65 (depends on 57)

The system of claim 57, wherein said aimed value transformer of said each participant device comprises:
a conversion table memory which has stored therein a conversion table which defines indexes k=1, 2, . . . , K corresponding to K kinds of values selectable as aimed values, for converting said aimed value PRm to the corresponding index km;
a one-way function g processor which processes said initial value IVm with a one-way function g by a predetermined number of times xm to generate gxm(IVm);
a one-way function h processor which processes said gxm(IVm) with a one-way function h K−km times to generate Hm(K)=hK−km(gxm(IVm)) as said aimed value information; and
response generating means which responds to a request from said server device for k to decide whether k=km, and if true, generates Hm(k−1)=hk−km−1(gxm(IVm)), and if false, generates Hm(k−1)=gxm−1(IVm); and
wherein said sending means sends said Hm(k−1) in response to said request from said server device for said k; and
in said server device:
there is published on said bulletin board Hm(K)=hK−km(gxm(IVm)) as said aimed value information received from said each participant device, which further comprises a one-way function h processor by which Hm(k−1) received from said each participant device as an answer to an inquiry for said k is processed with a one-way function h to generate h(Hm(k−1)), and a one-way function g processor for processing said answer Hm(k−1) with a one-way function g to generate g(Hm(k−1)); and
said control means: makes a check to see if said h(Hm(k−1)) matches said aimed value information Hm(K) published on said bulletin board; if a match is detected, updates said aimed value information Hm(K) with said Hm(k−1) and decrements said index k on said counter by one; and if a mismatch is detected, makes a check to see if said g(Hm(k−1)) matches said aimed value information Hm(K); and if a match is detected, determines, based on k and m at that time, the maximum or minimum aimed value PRm and the participant device m having offered said value PRm.

### Claim 66 (depends on 57)

The system of claim 57, wherein said aimed value transformer of said each participant device comprises;
a conversion table memory which has stored therein a conversion table which defines the relationships between a sequence of values selectable as said aimed values and a sequence of indexes k of integral values respectively corresponding thereto, for converting said aimed value PRm to the corresponding index km;
a fraction calculating part which, letting an arbitrary aimed value PR be represented by PR=F(k)+Q, where F(k) is a value in said conversion table corresponding to said k and Q is a fraction which is a positive integer which satisfies F(k+1)−F(k)>Q≧0, calculates said fraction Qm=PRm−F(km) based on F(km) obtained from said conversion table and said aimed value PRm; and
a one-way function h processor which processes said initial value IVm with said one-way function h by the number of times corresponding to said km to generate said aimed value information; and
wherein said sending means sends said fraction Qm to said server device together with said aimed value information; and
in said server device:
there is published on said bulletin board said fraction Qm received from said each participant device together with said aimed value information; and said server device comprises:
a sequencer for deciding the sequence of said fractions Qm on said bulletin board; and
select information comparator for checking whether said select information bm(k) is equal to a value b indicating the selection of the aimed value corresponding to said index k in said decided sequence of fractions Qm.

### Claim 67 (depends on 57)

The system of claims 57, wherein said sequence of index values k and said sequence of values selectable as said aimed values on said conversion table are monotone increasing values in the same direction, and said server device determines the maximum aimed value.

### Claim 68 (depends on 57)

The system of claims 57, wherein said sequence of index values k and said sequence of values selectable as said aimed values on said conversion table are monotone increasing values in opposite directions, and said server device determines the minimum aimed value.
