Achieve privacy-preserving simplicial depth query over collaborative cloud servers

The simplicial depth ( SD ) of a query point q∈ℝ^d with respect to a dataset S⊂ℝ^d is defined based on counting all ( d + 1)-dimensional simplices obtained from S that contain q . The simplicial depth is a ranking function which is frequently used in order to sort a multivariate dataset. In the higher dimension d , no better algorithm is known than the brute force method which takes Θ ( n d + 1 ) time, where | S | = n . Unfortunately, in contrast to the many advantages that have been previously identified by research studies, this depth function requires a massive amount of computation particularly for higher dimensional datasets. This challenge could be overcome by offloading the computation to cloud servers. However, delegating simplicial depth queries to not fully trusted cloud servers would be a source of serious security breaches and privacy issues. Therefore, in this paper, we target the privacy-preserving simplicial depth query over collaborative cloud servers. To this end, two resource-abundant cloud servers will be employed to perform such time consuming computation while maintaining the user’s privacy. Security analysis shows our proposed scheme achieves privacy-preserving requirements. In addition, some experiments based on a dataset generated by normal distribution are conducted, and the results validate the efficiency and practicality of our proposed scheme. Although this work only focuses on the planar case, our proposed scheme can be extended into higher dimension cases without significant alterations.