A Study of Efficiency and Accuracy of Secure Multiparty Protocol in Privacy-Preserving Data Mining

• Published in: 2012 26th International Conference on Advanced Information Networking and Applications Workshops pp. 85 - 90
• Main Authors: Teo, S. G., Lee, V., Shuguo Han
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.03.2012
• Subjects: Accuracy; Computational complexity; Data mining; Encryption; privacy-preserving data mining algorithm; Protocols; secure building block; Secure Multiparty Computation; Vectors
• ISBN: 9781467308670; 1467308676
• DOI: 10.1109/WAINA.2012.90

An analysis of the accuracy and efficiency of multiparty secured protocols is carried out so that both measures can be optimally exploited in the design of malicious party and semi-honest party. Finding efficient protocols of the Secure Multiparty Computation(SMC) is one active research area in the field of privacy preserving data mining (PPDM). The efficiency of privacy preserving data mining is crucial to many times-sensitive applications. In this paper, we study various efficient fundamental secure building blocks such as Fast Secure Matrix Multiplication(FSMP), Secure Scalar Product (SSP), and Secure Inverse of Matrix Sum (SIMS). They are supportively embedded the enhanced features into conventional data mining. We evaluate time/space efficiency on the different protocols. Experimental results are shown that there is a trade-off of accuracy and efficiency in the secured multiparty protocols targeted on semi honest party PPDM. It is therefore articulated that dimensionality reduction techniques such as Fisher Discriminant, Graph, Lapalician, and Support Vector Machine, should be used to preprocess the data. Key contributions of this paper include, besides providing some analyses of accuracy and efficiency, are commendation on further directions for computational efficiency improvement for multiparty online real data PPDM in cloud computing platforms (private and public).