Secure Multiparty Computation: From Millionaires Problem to Anonymizer

• Published in: Information systems security Vol. 20; no. 1; p. 25
• Main Authors: Sheikh, Rashid, Mishra, Durgesh Kumar, Kumar, Beerendra
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis Ltd 01.01.2011
• Subjects: Cryptography; Data integrity; Disclosure; Intrusion detection systems; Privacy; Studies
• ISSN: 1939-3555; 1939-3547

In Secure Multiparty Computation (SMC), multiple parties perform joint computation over their private data inputs preserving the privacy of their individual inputs. This type of computation needs to provide correct result while keeping the individual input a secret. In today's scenario of tremendous growth of the Internet and large volumes of online transactions, the concept of data privacy and SMC has become a matter of great concern. People frequently need to perform joint computations for the sake of their mutual benefits, but they are also worried about confidentiality of their private data. This situation arises due to lack of trust among computing parties. For example, two banks may want to find some details of a customer but each of the banks may want to keep their sensitive database a secret or they may not want to disclose the customer's identity. The subject of SMC has evolved from earlier solutions of combinational logic circuits to the recent proposals of anonymity-enabled computation. In this paper, we put together the significant research that has been carried out. We propose new possibilities of problem discovery and its analysis. We put critical issues and challenges and the level of adaptation achieved before the researchers. We also provide some research proposals based on the literature survey. [PUBLICATION ABSTRACT]