TY - GEN
T1 - Privacy-Preserving Multi-Party Analytics over Arbitrarily Partitioned Data
AU - Mehnaz, Shagufta
AU - Bertino, Elisa
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/9/8
Y1 - 2017/9/8
N2 - Data-driven business processes are gaining popularity among enterprises now-a-days. In many situations, multiple parties would share data towards a common goal if it were possible to simultaneously protect the privacy of the individuals and organizations described in the data. Existing solutions for multi-party analytics require parties to transfer their raw data to a trusted mediator, who then performs the desired analysis on the global data, and shares the results with the parties. Unfortunately, such a solution does not fit many applications where privacy is a strong concern such as healthcare, finance and the internet-of-things. Motivated by the increasing demands for data privacy, in this paper, we study the problem of privacy-preserving multi-party analytics, where the goal is to enable analytics on multi-party data without compromising the data privacy of each individual party. We propose a secure gradient descent algorithm that enables analytics on data that is arbitrarily partitioned among multiple parties. The proposed algorithm is generic and applies to a wide class of machine learning problems. We demonstrate our solution for a popular use-case (i.e., regression), and evaluate the performance of the proposed secure solution in terms of accuracy, latency and communication cost. We also perform a scalability analysis to evaluate the performance of the proposed solution as the data size and the number of parties increase.
AB - Data-driven business processes are gaining popularity among enterprises now-a-days. In many situations, multiple parties would share data towards a common goal if it were possible to simultaneously protect the privacy of the individuals and organizations described in the data. Existing solutions for multi-party analytics require parties to transfer their raw data to a trusted mediator, who then performs the desired analysis on the global data, and shares the results with the parties. Unfortunately, such a solution does not fit many applications where privacy is a strong concern such as healthcare, finance and the internet-of-things. Motivated by the increasing demands for data privacy, in this paper, we study the problem of privacy-preserving multi-party analytics, where the goal is to enable analytics on multi-party data without compromising the data privacy of each individual party. We propose a secure gradient descent algorithm that enables analytics on data that is arbitrarily partitioned among multiple parties. The proposed algorithm is generic and applies to a wide class of machine learning problems. We demonstrate our solution for a popular use-case (i.e., regression), and evaluate the performance of the proposed secure solution in terms of accuracy, latency and communication cost. We also perform a scalability analysis to evaluate the performance of the proposed solution as the data size and the number of parties increase.
UR - http://www.scopus.com/inward/record.url?scp=85032186009&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85032186009&partnerID=8YFLogxK
U2 - 10.1109/CLOUD.2017.51
DO - 10.1109/CLOUD.2017.51
M3 - Conference contribution
AN - SCOPUS:85032186009
T3 - IEEE International Conference on Cloud Computing, CLOUD
SP - 342
EP - 349
BT - Proceedings - 2017 IEEE 10th International Conference on Cloud Computing, CLOUD 2017
A2 - Fox, Geoffrey C.
PB - IEEE Computer Society
T2 - 10th IEEE International Conference on Cloud Computing, CLOUD 2017
Y2 - 25 June 2017 through 30 June 2017
ER -