National High Performance Computing Center at Hefei, Department of Computer Science and Technology, University of Science and Technology of China, Hefei, 230027, P. R. China; Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China

---

Abstract—In recent years, privacy protection has become an important topic when cooperative computation is performed in distributed environments. This paper puts forward efficient protocols for computing the multi-dimensional aggregates in distributed environments while keeping privacy preserving. We propose a novel model, which contains two crucial stages: local computation and cooperative computation based on secure multiparty computation protocols for privacy-preserving on-line analytical processing. According to the new model, we develop approaches to privacy-preserving count aggregate query over both horizontally partitioned data and vertically partitioned data. We, meanwhile, propose an efficient sub-protocol Two-Round Secure Sum Protocol. Theoretical analysis indicates that our solutions are secure and the answers are exactly accurate, that is, they can securely obtain the exact answer to aggregate query without revealing anything about their confidential data to each other. We also analyze detailedly the communication cost and computation complexity of our schemes in the paper and it shows that the new solutions have good linear complexity. No privacy loss and exact accuracy are two main significant advantages of our new schemes.

Index Terms—Privacy, OLAP, Homomorphic Encryption, Secure Multiparty Computation, Scalar Product Protocol

[PDF]

Cite: Youwen Zhu, Liusheng Huang, Wei Yang, and Fan Dong, " Privacy Preserving Aggregate Query of OLAP for Accurate Answers," Journal of Computers vol. 5, no. 11, pp. 1678-1685, 2010.