Abstract:
A method and system for preserving the integrity of a negotiation that includes providing an architecture which includes a center A, and a plurality of users B.sub.1, B.sub.2, . . . , B.sub.n. each user B.sub.i generates an input X.sub.i, which is input to the center A. The center A computes and publishes a function F(X.sub.1, X.sub.2, . . . , X.sub.n) based on the input messages it receives. Each user B.sub.i (1&lt;=i&lt;=n) communicates with the center A, exclusively. Center A publishes additional information which lets each of the users verify that F was computed correctly, and prevents a coalition of any one subset of the users from learning anything which cannot be computed just from the output of the function, F(X.sub.1, . . . ,X.sub.n), and from their own inputs, or information about the inputs of other users.

Description:
BACKGROUND OF THE INVENTION 
   1. Field of the Invention 
   This invention relates generally to cryptography and to secure distributed computation, and more particularly it relates to computerized auctions conducted using PCs and/or servers over a network, such as, the Internet. 
   2. Description of the Prior Art 
   An exciting topic of cryptographic research is secure function evaluation [see e.g. REFERENCES 3, 7, the citations for which are given in detail at the end of the specification]. For any function F(x.sub.1, x.sub.2, . . . , x.sub.n), it is possible, in principle, to construct a protocol that allows a group of n parties, where party i has as its private input x.sub.i, to jointly evaluate F(x.sub.1, x.sub.2, . . . , x.sub.n). Following the protocol the parties learn F(x.sub.1, x.sub.2, . . . , x.sub.n) but no party i can learn about the inputs other than x.sub.i more than can be computed from x.sub.i and F(x.sub.1, x.sub.2, . . . , x.sub.n). The drawback of these protocols is that they are rather complex and require a lot of interaction between each of the parties. In the case of auctions this would require high interaction between the bidders, who have no motivation to interact with each other. The present invention, as will be described in greater detail in the following, provides a much simpler method in which all the parties communicate with just a single center. In the inventive method described hereinafter, the input of each of the parties becomes known to this center but otherwise, it is not known to any other party. The inventive method enables the center to prove that it preformed the computation correctly. 
   In the case of auctions, it is normally the case that the auctioneer is trusted by all parties to compute the result of the auction correctly. This might not be justified, since the auctioneer might benefit from an illegal modification of the result of the auction. (This is even true if the auctioneer is just a mediator that is selling items which are offered by third parties, since such auctioneers usually charge a commission which depends on the price with which the items are sold). It is sometimes the case that a trusted party (say an accountant) observes the operation of the auctioneer and testifies that it is trustworthy. However this party might be corrupted and cooperate with a corrupted auctioneer, it might also be the case that the trusted party cannot watch the auctioneer closely enough and the auctioneer can cheat without being detected. These problems are amplified in a computerized Internet setting. 
   The center that computes F can of course prove that it computed it correctly by publishing all the inputs. However this solution affects the privacy of the other parties, since their inputs become public. The inventive method overcomes this problem since it enables the center to prove that it computed F correctly without is leaking any information about the inputs. 
   There are suggestions in the art for distributing the operation of an auctioneer between many servers in a way which is secure as long as not too many of these servers operate maliciously. Franklin and Reiter [see REFERENCE 2] developed a distributed system for sealed-bid auctions with many auctioneer servers, which ensures the privacy of the bids until the time they are opened. This system further enables the bids to be backed by escrowing financial commitments of the bidders. Harakavy, Tygar, and Kikuchi [see REFERENCE 4] present systems for secure first price and second price sealed bid auctions, which preserve the privacy of the bids even after the winning bid is chosen (this variant was also briefly mentioned in REFERENCE 2). Both systems distribute the operation of the auctioneer between several servers and privacy is guaranteed as long as not too many of the servers collude (most of the protocols require that less than a third of the servers collude, and therefore, need a minimum of four servers). However, if enough auctioneer servers collude they are able to maliciously change the outcome of the auction and would not be detected. The requirement that auctioneer servers would not collude seems very hard to enforce since all these servers operate for the auctioneer which might have a motivation to cheat and increase its profits. Compared to these prior art solutions, the inventive method does not require to distributing the operation of the auctioneer among several non-colluding servers, and provides security even if the auctioneer is attempting to cheat. 
   Naor and Pinkas [see REFERENCE 6] present a different method that prevents even the center from learning information about the parties&#39; inputs. That method requires the operation of an additional party—the Issuer. The Issuer generates a program that computes the function (or the auction) and sends it to the center. The center receives messages from the parties, which contain some information that is intended for the Issuer: After the center receives messages from all the parties it sends a message to the Issuer and receives a response which enables it to use the program to compute the output of F for the parties&#39; inputs. The method ensures that neither the center nor the Issuer learn information about the inputs of the parties. In this sense it provides better privacy than the inventive method described herein. However, the inventive method presented here does not require the cooperation of any additional party (like the Issuer) for the computation of F. It enables the center to compute the function by itself and prove that it computed it correctly, and in this respect is an advantage. 
   SUMMARY OF THE INVENTION 
   Consider a scenario with N parties, each having a private input, and a single center. There is a function F with N inputs whose output should be computed. Each party sends its input to the center. The present invention is a method, system and apparatus that enables the center to compute and publish the output of F and to prove to all parties that it computed F correctly. This is done without revealing the value of the input of a party to any other party. 
   More specifically, the parties can be bidders in an auction, their inputs are their bids, the center is the auctioneer, and the program F expresses the rule by which the outcome of the auction is decided. The invention requires the auctioneer to prove that it computed the result of the auction correctly. 
   The invention provides the same security as in the following scenario: Assume that there is a reliable party (say an accountant or a lawyer) which is trusted by all other parties. This party observes the operation of the center, i.e. it examines the inputs that the center receives, verifies that the center computes the correct output, and testifies that this is the case. The invention provides the same security as is provided with this trusted party, but without using any such party. This ensures better security (since trusted parties might breach the trust they are given), and is more efficient (since it does not require an additional party). 
   Other and further advantages and objects of the present invention will become readily apparent when considering the following detailed description of the present invention when taken together with the appended drawings. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
       FIG. 1  is a block diagram illustrating the different entities engaged in a computerized auction. 
       FIG. 2  is a schematic diagram illustrating the steps of the method of the present invention where the steps are indicated by numerals in parentheses. 
       FIG. 3  is a high level descriptive flow chart of the present invention as generally depicted in the diagrams of  FIGS. 1 and 2 . 
       FIG. 4  is a flow chart showing the steps of the implementation of the preferred embodiment of the present invention. 
       FIG. 5  is a flow chart of a secure two-party function evaluation protocol as implemented by the present invention. 
       FIG. 6  is a schematic diagram of a gate used in the protocol depicted in  FIG. 5 , and also shows the pseudo-random function used to prepare Table T g  used in the protocol of depicted in  FIG. 5 . 
   

   DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS 
   As initially noted, the apparatus and method of the present invention comprises an auction service that is used in a network, such as, the Internet, and uses clients and/or servers. The invention utilizes cryptography and secure distributed computation via computers to effect a computerized auction. However, the invention is not limited to computerized auctions, but has broader application. Many such applications involve a group of participants, denoted herein as “Parties”, each of whom has an input to the group as a whole, where the group as a whole is required to compute and output a certain function of these inputs. The term “function” herein denotes, in the usual sense, any mathematical or logical mapping from one set of input entities to an output entity or set of entities. In certain cases, the inputs may involve sensitive information, such that it would also be required that this computation does not reveal any information about the inputs, except for whatever might be computed from the final output. Such inputs are herein denoted as “private inputs”. If, in addition to the parties, there were furthermore a trustworthy participant, denoted herein as a “center” and which is trusted by all the parties, then each party could simply send the respective private input to this center, which would then compute the function and publish, or output, the value of the computed function. (The center is a participant in the protocol and is involved in the computation of the function. It may or may not have a private input, and may or may not be within the group of parties.) The parties, however, might not trust each other, and might not trust any single center. 
   Although a particular case of interest is that of auctions, for example, sealed-bid second-price auctions, commonly known in the art as “Vickrey auctions”, other applicable activities include mechanism design, which deals with the design of protocols for selfish parties. The goal of a protocol is to aggregate the preferences of the parties in order to decide on some social choice (for example, to decide whether a community should build a bridge, or how to route packets in a network, or to decide who wins an auction). Each party has a utility function which expresses how much that party values each possible outcome of the protocol (the bid in an auction, for example, is such a utility function). Each party sends information about its utility function to a center, which decides on the outcome of the protocol based on the reports from the parties, according to a specified function of the utility functions (for example, in a sealed-bid auction, the specified function that determines the winner is the maximum of the bids). The creation of algorithms by mechanism design is known in the art, to solve a global problem among a number of selfish agents (e.g. routing, or some cooperation between the agents). The present invention can be used to compute these algorithms without requiring trust in the center. The plausibility of using the present invention for such a task depends on the complexity of expressing the utility functions and decision procedure in terms of circuits. 
   A particular case of interest is the Groves-Clarke mechanism, where the public good is served if the sum of reported values is higher than some threshold. The circuit which computes this function is very simple, as is the circuit which computes the sum of the reported values for several options, and decides on the option with the highest sum. It is therefore very easy to use the present invention to provide a private protocol which computes a Groves-Clarke mechanism. 
   Opinion polling is another relevant application. The design of mechanisms to elicit opinions of a group of independent experts. The application enables parties to contribute their opinion to a decision making without being worried that their opinion would be revealed. It is known in the art that where experts want their recommendation to be accepted, that there exists a mechanism with a single equilibrium which achieves the public target (but such a mechanism does not exist if experts care only about the public good). Such a mechanism can be implemented very efficiently by the present invention. This essentially requires that one expert chooses a subset of the experts whose opinions are considered, learns their opinions, and then adds his opinion. The group decision is the majority opinion. 
   Another application is for polling the opinions of a group of people, while hiding the individual opinions of the participants. Consider for example an opinion poll (such as the Gallup Poll) which contains many questions. Suppose that the poll is anonymous, and the organizer obtains lists of answers, one list for each participant. In order to prove that it computed the result correctly, the organizer must publish the lists of answers. Suppose also that only a single participant answered affirmatively to a certain question, and that it is possible to guess with very high probability who this participant is. Then, although the answers are anonymous, it is possible to learn the answers of this participant to all the questions. The present invention enables the sending of questions to the group members, and the processing of their answers to obtain commutative outputs without revealing any information about individual answers. Additional applications of the present invention include multiple-question opinion polls, sociometric research, and voting and elections. 
   Stable matching is yet another example of a global decision which depends on the private preferences of many parties. In many scenarios it is plausible that parties would be hesitant to reveal their matching preferences, even to the center that computes the matching (consider, for example, matching couples for a prom). The present invention enables the parties to reveal their true preferences without being afraid that the center can learn them. As with other applications, the overhead of implementing the present invention for this application depends on the complexity of expressing the matching algorithm as a combinatorial circuit. 
   Referring now to the drawing, the different entities are depicted in  FIG. 1 . As shown, the entities include The parties  320  and the Center  321 . Each of the parties  320  has an input to the function F. In the case of auctions some of the parties might wish to sell items, and the rest of the parties are interested in buying these items. In addition to the parties  320 , there is a center  321 . The center  321  runs the show: it advertises the fact that F is computed, receives the inputs, and performs the computation. In the case of auctions, the center is the auctioneer. It publishes the auction, receives the bids from the bidders, and computes the outcome of the auction. The auctioneer might be a party which merely organizes the auction. It is also possible that it is one of the bidders or one of the sellers (for example he is selling an item which all other bidders are interested in buying). 
   The Steps in a high level description of a preferred embodiment are illustrated in  FIG. 2 . The high level description of the illustrated preferred embodiment of the method involves the following sequence of steps of the protocol. The Steps include the following sequence. ( 1 ) The center announces the computation and commits to the circuits. ( 2 ) Party  1  sends a commitment to its input (Party  1  represents a generic party, and this operation is performed by each of the participating parties). ( 3 ) The center publishes the commitments. ( 4 ) Party  1  opens its commitment, and the center verifies it. ( 5 ) The center computes&#39; the function. ( 6 ) The center publishes a proof that the computation was correct, and Party  1  verifies it. 
   The Steps of the method of the present invention are elaborated in more detail in the following, with reference to  FIG. 3 . As shown, there are a number of bidders  320  and a single center  321 . The center announces Step  301  that it will compute the function F. (In the case of an auction the auctioneer announces the existence of the auction and publishes its rules). The center publishes in Step  302  commitments to K combinatorial circuits  322  that compute F (where K is a security parameter). 
   Party B.sub.i, which wishes to participate in computing the function F, sends a message to the center. They might exchange several rounds of communication, Step  303 , at the end of which the center has a commitment c.sub.i to the value of B.sub.i&#39;s input x.sub.i. 
   The center publishes in Step  304  the commitments it received from the parties. (In the case of auctions this can be done at the end of the bidding period). 
   In Step  305  the bidders choose part of the K circuits that the center committed to, from block  323 , and ask the center to open them. They verify in Step  306  that the circuits compute the function F. In Step  307  each party B.sub.i sends to the center the value x.sub.i to which it committed with c.sub.i. The center verifies that x.sub.i corresponds to c.sub.i, that is it verifies that A(x.sub.i,c.sub.i)=1. 
   The center now computes in Step  308  the value of the circuit that computes F for the inputs x.sub.i it received. Next, the procedure for verifying the computation takes place. The center computes and publishes a proof in Step  309  that it computed the value of F correctly. Each party can use the published commitments to verify in Step  310  that the proof is correct. 
   A considerable improvement to the protocol can be achieved by noting that the function that is computed by the circuit need not be the function F that the center computes, and woe computation should be verified. The circuit can compute a function F′ that verifies that F was computed correctly. For example, if F is a function that computes the value and the index of the maximum of N inputs, X(1), . . . ,X(N), F′ is the following function: It has N+2 inputs comprised of the N inputs to F and the outputs (j,Y) of F. F′ outputs 1 if and only if X(j)=Y, and X(j)&gt;=X(i) for every i different from j. The circuit that computes this function is substantially more efficient that the circuit computing F. 
   There now is elaborated a detailed description of the preferred embodiment. The inventive method employs cryptographic tools that enable a secure two-party function evaluation. The particular secure two-party function evaluation protocol used in the present invention is based on the method disclosed in REFERENCE 7. In the invention, the protocol is run between two participants, A and B. The input of A is a value x and the input of B is a description of a function f. At the end of the protocol, A learns f(x) (but no other information about f), and B learns nothing about x. Thus, the input x is a private input of A, and the function f is a private input of B. 
   The protocol is based on expressing f as a combinatorial circuit of gates which are over some fixed base (e.g. all the functions g: 0,1 times 0,1 to 0,1). The bits of the input are entered into input wires and are propagated through the gates. 
   This procedure encrypts a circuit by generating a pseudo-random isomorphic transformation of the circuit. This encryption is herein referred to as a “garbling” of the circuit. The cyphertext of a circuit so encrypted by this procedure is herein denoted as a “garbled” circuit. This process is detailed below, with reference to  FIG. 5 . 
   As shown in  FIG. 5 , Inputs  502  include: A: a value x, in an input  502 -A, and B: a description of a combinatorial circuit which computes f, in an input  502 -B. The outputs of the flowchart shown in  FIG. 5  are Outputs  536  that include: A: f(x), in an output  536 -A, and B: nothing, in an output  536 -B. 
   The protocol starts with Initialization. In step  504 , B devises a circuit  506  made of logic gates, such that circuit  506  computes f. The design of logic circuits made of gates that compute functions is well-known in the art. 
   Next, the circuit is encrypted. In step  508 , B assigns to each wire i of circuit  506  two random values (W i   0 ,W i   1 )  510  corresponding to 0 and 1 values of wire i. The random values should be long enough to be used as keys (for example, 80 bits long). The value of wire i is denoted by b i . In step  512 , B also assigns to wire i a random permutation π 514  over 0,1, π k : b i →c i . 
   In step  516 , B uses a pseudo-random function R  518  to prepare a table T g    522  (or a set of tables, also denoted herein by T g ) which enables computation of the garbled output of each gate g  520 , (W k   b     k   , c k ), from the values (W i   b     i   , c i ), (W j   b     j   , c j ), the garbled inputs to gate g. Table T g  does not disclose any information about the output of gate g for inputs other than the pair (b i , b j ), nor discloses the values of the bits b i , b j , or b k . 
   In step  524 , B prepares an output translation table T O    526  which decrypts the garbled output bits of the circuit (the cyphertext output) to the actual bits of the output of the circuit (the cleartext output). 
     FIG. 6  illustrates gate g  520 , which is a generic gate that computes the value b k  of an output wire k  604  as a function of the values b i , and b j  of input wires i  606  and j  608 , respectively. Such a computation is denoted as b k =g(b i , b j ).  FIG. 6  also illustrates pseudo-random function R  518 , which is used to prepare table T g    522 . 
   If one assumes initially that the fan-out of every gate is 1, table T g  contains four entries of the form:
 
c i , c j : (W k   g(b     i     , b     j     ) , c k ) XOR R W     i     b     i   (c j ) XOR R W     j     b     j   (c i ),
 
   where 0≦i≦j≦1. 
   The value c k  is given by c k =π k (b k )=π k (g(b i , b j )). The entry does not have to include the index c i , c j  since this is implicit in the entry&#39;s location. 
   Assume that A knows c i , c j  and the values W i   bj , W j   bj . In order to compute a gate, A finds the entry c i , c j  in the table T g  for that gate, and performs an XOR (exclusive-OR) operation with the value R W     i     b     i   (c j ) XOR R W     j     b     j   (c i ) to get the value W k   b     k   =W k   g(b     i     , b     j     ) , and of c k . 
   To code the Input the following is undertaken. Given the table T g  of the gates, and the garbled values W i   b     i    and c i  which correspond to the input wires, it is easy to compute the garbled values of the output wires of the circuit. A knows the values of the input bits and should obtain the values of the corresponding wires. In step  528 , for each gate in circuit  506 , B sends to A the table T g    522  that codes the gate. In step  530 , B sends to A the table T O    526  that decrypts the garbled values of the output of the circuit the output bits of the circuit. In step  532 , for each gate input wire in the circuit, A and B engage in an Oblivious Transfer, at the end of which A learns the garbled value of the wire&#39;s input bit (but nothing about the garbled value of the input bit of the other wire into the gate), and B learns nothing. 
   A now has enough information to compute the circuit. In step  534 , A computes the output of the circuit for the input x. However, since A does not know the garbled values for any other input bits, A cannot compute information about f(x 0 ) for any x 0 ≠x (except, of course, information that can be deduced from f(x) alone). Note that the communication between the two participants A and B can be done in a single back-and-forth round, and B can prepare the circuit in advance, before the input is known to A. 
   To handle a gate fan-out greater than 1, it is simply required to use a different input to the pseudo-random function R at each gate in which the wire is used. (If the same value be used in different gates, then it will be possible to cancel the application of the pseudo-random function R by an XOR operation, and A could thereby learn relationships between garbled values.) Suppose that the fan-out of wire i is M, then in a gate m (1≦m≦M) which uses wire i as input, the masking value that is used should be R W     i     b     i   (c j , m). That is, the pseudo-random function R should be applied to the concatenation of c j  and m. Alternatively, it is possible to assign each gate a unique identifier I g , and use R W     i     b     i   (c j , I g ). 
   It is also possible to adapt this protocol to circuits in which gates have more than two inputs, as well as, for wires having more than two possible values. The size of the table for a gate with n inputs which each can have d values is d n . 
   The prior art of REFERENCE 7 (Yao&#39;s protocol) is limited to two participants, but has been extended has been extended in the prior art to handle multi-party inputs, see REFERENCE 3. These extended protocols, however, require a round of communication for each gate in the circuit, which is impractical in many applications, such as in auctions. The method of REFERENCE 3 would require extensive interactive communication among the bidders in an auction, and is therefore not suitable. In contrast, the present invention does not impose the burden of extensive interactive communication and does not require the bidders to communicate among themselves, and therefore represents an improvement not only over the prior art of REFERENCE 7 and 3. Furthermore, the prior art of REFERENCE 3 is secure only for limited coalitions of less than one-third of the parties. 
   A commitment to a value X is similar to the following process: party B which knows the value of X writes it on a piece of paper which is put in a sealed envelope. At this stage no one can learn anything about X, but B is committed to X and cannot change the value in the envelope. At a later stage B can “open the commitment” by opening the envelope and revealing X. 
   More formally, a commitment to a value X is computed by a function C=C(X,R), where R is a random string. It has the following properties: (1) C is easy to compute. (2) Given C(X,R), it is infeasible to compute any information about X. (3) There is an algorithm A such that A(C(X,R),X,R)=1, and for any other X′ (different than X) and R′ it holds with high probability that A(C(X,R),X′,R′)=0. Such commitments schemes can be implemented efficiently, see for ex-ample REFERENCE 5. 
   Now the details of the implementation of the preferred embodiment will be described in conjunction with the flow chart of  FIG. 4 . The first stage is the announcement. This stage is carried out by the center  421  announcing in step  401  that it will compute F. Let K be a security parameter. The center constructs in step  402  K garbled circuits that compute F. For each input wire j of each of the circuits the center chooses in step  403  a random permutation P.sub.j over the two values 0 and 1. The center publishes in step  404  the tables of the gates of the K circuits  422 . For each input wire j (in each of the circuits) it publishes in step  404  a commitment to W.sub.j.sup.0 and a commitment to W.sub.j.sup.1, ordered by the permutation P.sub.j, and a commitment to P.sub.j. 
   The next stage is for the parties  420  to commit to their inputs. Each party B.sub.i has an input x.sub.i of I bits. The bits of this input are denoted as x.sub.(i,I)). Each input bit should be input to an input wire in each of the K circuits. For each wire j of these wires, the center sends in step  405  to B.sub.i, the permutation P.sub.j. B.sub.i sends in response in step  406  a commitment  424  to P.sub.j(x.sub.(i,I)), i.e. to the permuted value of its input. 
   The next stage is to publish the commitments. The center  421  publishes in step  407  the commitments  424  it received from the parties. 
   The next stage is to open the commitments. The parties  420  choose K/2 of the K circuits that the center has created and ask the center to open in step  408  all the commitments to the permutations and garbled inputs of these K/2 circuits  423 . They verify in step  409  that these circuits indeed compute F. Each of the parties B.sub.i sends in step  410  its input x.sub.i to the center. B.sub.i also opens to the center the commitments that it made to each of its assigned input wires. These were for values 0 or 1 which are the permuted values of B.sub.i&#39;s inputs. The center verifies in step  411  that these commitments are consistent. The center publishes in step  412  the opened commitments  425  of each of the parties, and opens the garbled values W.sub.j.sup.0 or W.sub.j.sup.1 that correspond to them. 
   In the next stage, the center computes the function in step  413  and publishes the output of each of the K/2 circuits which were not chosen by the parties. 
   In the final stage, each party  420  can verify the computations of the center  421 . Each B.sub.i can use the opened garbled values  425  and the tables of the gates  422  to compute the output of each of the K/2 circuits, and verify in step  414  that they all have the same output. 
   One problem that may be encountered in an auction is that a party does not open its commitment. For example, a party might refuse to communicate with the sender at the step at which the commitments should be open. This type of behavior enables cheating, for example, in the case of second price auctions the center itself might use fake identities of bidders in order to commit to bids in different values, and open only the bids which are smaller than the highest value among all other bids. This behavior might increase the amount that the winner would be required to pay. 
   One approach for dealing with parties that do not open their commitments appropriately would be to require parties to also submit their bids to a trusted third party T. The help of the trusted party T is not required, if all parties open their commitments. However, when a party refuses to open its commitment, the trusted party T can be called upon to open it. Such a scheme can be realized, for example, by using commitments of the following form: the public key of trusted party T would be known to everyone. A commitment to a value v would be an encryption of this value with T&#39;s public key (say with a probabilistic encryption scheme which ensures indistinguishability). The party who created this commitment can open it by revealing v and showing how it encrypted it. If this party refuses to open the commitment then trusted party T can open it using its private key. 
   A more promising approach is to use “Timed commitments” [see REFERENCE 8]. These are commitment schemes with an optional forced opening phase enabling the receiver of the commitment to recover (with effort) the committed value without the help of the bidder making the commitment (committor). It is possible to require the bidders to use timed commitment schemes to commit to their bids, enabling the auctioneer to open these commitments, to their original value, if a bidder is not willing to open his or her bid. 
   A different approach for ensuring that each party opens its commitments is to require parties to back their commitments financially. A party who refuses to open its commitment would be required to pay a fine. 
   REFERENCES 
   
       
       [1] M. Bellare and S. Micali, Non-interactive oblivious transfer and applications, Proc. Advances in Cryptology—Crypto &#39;89, Springer-Verlag LNCS 435 (1990), 547–557. 
       [2] M. K. Franklin and M. K. Reiter, “The design and implementation of a secure auction server”, IEEE Tran. on Software Engineering, 22(5), pp. 302–312, 1996. 
       [3] O. Goldreich, M. Micali, A. Wigderson, How to play any mental game, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 218–229. 
       [4] M. Harakavy, J. D. Tygar and H. Kikuchi, “Electronic auctions with private bids”, 3rd USENIX Workshop on Electronic Commerce, pp. 61–73, 1999. 
       [5] M. Naor, “Bit Commitment using Pseudo-randomness”, J. of Cryptology, 4, 1991. 
       [6] M. Naor and B. Pinkas, “Privacy preserving negotiation and computation”, patent application, 1999. 
       [7] A. C. Yao, How to Generate and Exchange Secrets, Proc. of the 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 162–167. 
       [8] D. Boneh and M. Naor, “Timed commitments and timed signatures”, Proc. Advances in Cryptology—Crypto &#39;00, Springer-Verlag LNCS, 2000. 
     
  
   Although the invention has been shown and described in terms of specific embodiments, nevertheless various changes and modifications will be evident to those skilled in the art from the teachings of the invention. Such changes and modifications which do not depart from the spirit, scope and contemplation of the invention are deemed to fall within the purview of the claims.