Malicious computation prevention protocol for secure multi-party computation

Secure Multi-Party Computation (SMC) allows parties with similar background to compute results upon their private data, minimizing the threat of disclosure. The exponential increase in sensitive data that needs to be passed upon networked computers and the stupendous growth of internet has precipitated vast opportunities for cooperative computation, where parties come together to facilitate computations and draw out conclusions that are mutually beneficial; at the same time aspiring to keep their private data secure. These computations are generally required to be done between competitors, who are obviously weary of each-others intentions. SMC caters not only to the needs of such parties but also provides plausible solutions to individual organizations for problems like privacy-preserving database query, privacy-preserving scientific computations, privacy-preserving intrusion detection and privacy-preserving data mining. This paper is the second version of a previously proposed protocol Extended_Encrypto_Random, which itself was an extension of the initial work Encrytpo_Random. The former endeavors presented a plain sailing yet effective approach to SMC and also laid forward an aptly crafted architecture, whereby such efficient protocols, involving the parties that have come forward for joint-computations and the third party who undertakes such computations, can be developed. Through this succeeding work an attempt has been made to further strengthen the existing protocols, thus paving the way for a more secure multi-party computational process.

[1]  Wenliang Du,et al.  Privacy-preserving cooperative scientific computations , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[2]  Gu Si-yang,et al.  Privacy preserving association rule mining in vertically partitioned data , 2006 .

[3]  Wenliang Du,et al.  Secure Multi-party Computational Geometry , 2001, WADS.

[4]  Yehuda Lindell Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, CRYPTO.

[5]  Ran Canetti,et al.  Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.

[6]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[7]  Alexandre V. Evfimievski,et al.  Information sharing across private databases , 2003, SIGMOD '03.

[8]  Chris Clifton,et al.  Leveraging the "Multi" in secure multi-party computation , 2003, WPES '03.

[9]  Ueli Maurer,et al.  Secure multi-party computation made simple , 2002, Discret. Appl. Math..

[10]  Yuval Ishai,et al.  Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.

[11]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2000, Journal of Cryptology.

[12]  Wenliang Du,et al.  Secure multi-party computation problems and their applications: a review and open problems , 2001, NSPW '01.

[13]  Durgesh Kumar Mishra,et al.  A Secure Multi-Party Computation Protocol for Malicious Computation Prevention for preserving privacy during Data Mining , 2009, ArXiv.

[14]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.