Notice of Violation of IEEE Publication Principles: A Study on Secure Multiparty Computation Problems and Their Relevance

Notice of Violation of IEEE Publication Principles

"A Study on Secure Multiparty Computation Problems and Their Relevance"
by Shaikh, Z., Mishra, D.K
published in the 2010 Second International Conference on Computational Intelligence, Modelling and Simulation (CIMSiM), 2010, pp.95-99

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee this paper has been found to be in violation of IEEE's Publication Principles. The committee has found Z. Shaikh to be the sole offending author and that D.K. Mishra was not involved in the offense.

This paper contains significant portions of original text from the paper cited below. The original text was copied with insufficient attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"Secure multi-party computation problems and their applications: a review and open problems"
by Wenliang Du and Mikhail J. Atallah
published in the Proceedings of the 2001 workshop on New security paradigms (NSPW '01), 2001, pp. 13 - 23


The growth of the Internet has prompted tremendous opportunities for cooperative computation, where people are jointly conducting computation tasks based on the private inputs they each supplies. These computations can occur between mutually untrusted parties, or even between competitors. For example, customers might send to a remote database queries that contain private information, two competing financial organizations might jointly invest in a project that must satisfy both organizations private and valuable constraints, and so on. Today, to conduct such computations, one entity must usually know the inputs from all the participants, however if nobody can be trusted enough to know all the inputs, privacy will become a primary concern. This problem is referred to as Secure Multi-party Computation Problem (SMC) in the literature. Research in the SMC area has been focusing on only a limited set of specific SMC problems, while privacy concerned cooperative computations call for SMC studies in a variety of computation domains. Before we can study the problems, we need to identify and define the specific SMC problems for those computation domains. We have developed a scaffold to facilitate this problem-discovery task. Based on our framework, we have identified and defined a number of SMC problems for a range of computation domains. The goal of this paper is not only to present our results, but also to serve as a guideline so other people can identify useful SMC problems in their own computation fields. During computation of inputs, we had also considered the factor, what if trusted third parties are malicious? Considering different probabilities for the malicious users, we have tried to find out the correctness of the result and percentage of system acceptability. We then tried to increase the number of TTP's in order to get the accuracy of the result. The aim of our proposed work is to identify what probability of malicious users will lead to the system in an unacceptable state.