Protocols for Getting Maximum Value for Multi-Party Computations

In today’s distributed computing environment multiple parties compute some function of their private inputs. In such a scenario privacy preservation of such inputs is a matter of great concern because each party is also worried about the privacy of their inputs. This subject is evolved as Secure Multiparty Computation (SMC). The protocols proposed in this paper allow multiple parties to get maximum of their inputs without disclosing individual inputs to one another or even to any third party. We use a third party for computation that may not be trusted. The protocol uses binary countdown approach. In one of the protocols anonymizers are used to hide the identity of the party. The probabilistic analysis of the protocols is presented.