Skip to main content
SpringerLink
Log in

Achieve privacy-preserving simplicial depth query over collaborative cloud servers

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

The simplicial depth (SD) of a query point \(q\in \mathbb {R}^{d}\) with respect to a dataset \(S\subset \mathbb {R}^{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 Θ(nd+ 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. A simplex in \(\mathbb {R}\) is a line segment, in \(\mathbb {R}^{2}\) is a triangle, in \(\mathbb {R}^{3}\) is a tetrahedron, etc.

References

  1. Acar A, Aksu H, Selcuk Uluagac A., Conti M (2018) A survey on homomorphic encryption schemes: Theory and implementation. ACM Comput Surv 51:79:1–79:35

    Article  Google Scholar 

  2. Aloupis G On computing geometric estimators of location, 2001. Master’s thesis, M. Sc. McGill University

  3. Aloupis G, Cortés C, Gómez F, Soss M, Toussaint G (2002) Lower bounds for computing statistical depth. Comput Stat Data Anal 40(2):223–229

    Article  MathSciNet  Google Scholar 

  4. Aloupis G, Langerman S, Soss M, Toussaint G (2003) Algorithms for bivariate medians and a fermat–torricelli problem for lines. Comput Geom 26(1):69–79

    Article  MathSciNet  Google Scholar 

  5. Boneh D, Goh E-J, Nissim K (2005) Evaluating 2-dnf formulas on ciphertexts. In: Theory of Cryptography Conference, Springer, pp 325–341

    Chapter  Google Scholar 

  6. Bos JW, Lauter K, Loftus J, Naehrig M (2013) Improved security for a ring-based fully homomorphic encryption scheme. In: IMA International Conference on Cryptography and Coding, Springer, pp 45–64

    Chapter  Google Scholar 

  7. Brakerski Z, Gentry C, Vaikuntanathan V (2014) (leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory (TOCT) 6(3):13

    MathSciNet  MATH  Google Scholar 

  8. Chen D (2013) Algorithms for data depth. Carleton University

  9. Chen ZQ (1995) Bounds for the breakdown point of the simplicial median. J Multivar Anal 55(1):1–13

    Article  MathSciNet  Google Scholar 

  10. Cheng AY, Ouyang M (2001) On algorithms for simplicial depth. In: CCCG, pp 53–56

  11. ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469–472

    Article  MathSciNet  Google Scholar 

  12. Eppstein D, Goodrich MT, Tamassia R (2010) Privacy-preserving data-oblivious geometric algorithms for geographic data. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM, pp 13–22

  13. Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. IACR Cryptology ePrint Archive 2012:144

    Google Scholar 

  14. Gentry C, Boneh D (2009) A fully homomorphic encryption scheme, vol 20. Stanford University Stanford

  15. Hans S, Addepalli SC, Gupta A, Srinathan K (2009) On privacy preserving convex hull. In: International Conference on Availability, Reliability and Security, 2009. ARES’09. IEEE, pp 187–192

  16. Hazewinkel M (2013) Encyclopaedia of Mathematics: C An updated and annotated translation of the Soviet ? Mathematical Encyclopaedia?, vol 2. Springer Science & Business Media

  17. He X, Wang G (1997) Convergence of depth contours for multivariate datasets. The Annals of Statistics, pp 495–504

  18. Hotelling H (1990) Stability in competition. In: The Collected Economics Articles of Harold Hotelling, Springer, pp 50–63

  19. Jo S, Han J (2018) Convergence p2p cloud computing. Peer-to-Peer Networking and Applications 11 (6):1153–1155

    Article  Google Scholar 

  20. Langerman S, Steiger W (2000) The complexity of hyperplane depth in the plane. In: Symposium on Discrete Algorithms, ACM and SIAM

  21. Lepoint T, Naehrig M (2014) A comparison of the homomorphic encryption schemes fv and yashe. In: International Conference on Cryptology in Africa, Springer, pp 318–335

    Chapter  Google Scholar 

  22. Liang K, Yang B, He D, Zhou M (2011) Privacy-preserving computational geometry problems on conic sections. J Comput Inf Syst 7(6):1910–1923

    Google Scholar 

  23. Liu RY (1990) On a notion of data depth based on random simplices. The Annals of Statistics. pp 405–414

    Article  MathSciNet  Google Scholar 

  24. Liu RY (1995) Control charts for multivariate processes. J Am Stat Assoc 90(432):1380–1387

    Article  MathSciNet  Google Scholar 

  25. Liu RY, Serfling RJ, Souvaine DL (2006) Data depth: robust multivariate analysis, computational geometry, and applications, volume 72 American Mathematical Soc.

  26. López-Alt A, Tromer E, Vaikuntanathan V (2012) On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the forty-fourth Annual ACM Symposium on Theory of Computing, ACM, pp 1219–1234

  27. Lu W, Kawasaki S, Sakuma J Using fully homomorphic encryption for statistical analysis of categorical, ordinal and numerical data (this is the full version of the conference paper presented at ndss 2017). Technical report, IACR Cryptology ePrint Archive, Report 2016/1163 (2016). https://eprint.iacr.org/2016/1163.pdf

  28. Miller K, Ramaswami S, Rousseeuw P, Sellarès T, Souvaine D, Streinu I, Struyf A (2001) Fast implementation of depth contours using topological sweep. In: Proceedings of the Twelfth annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, pp 690–699

  29. Mosler K (2013) Depth statistics. In: Robustness and complex data structures, Springer, pp 17–34

  30. Oja H (1983) Descriptive statistics for multivariate distributions. Statist Probab Lett 1(6):327–332

    Article  MathSciNet  Google Scholar 

  31. Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, Springer, pp 223–238

  32. Regev O (2010) The learning with errors problem. Invited survey in CCC, p 7

  33. Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126

    Article  MathSciNet  Google Scholar 

  34. Roman R, Lopez J, Mambo M (2018) Mobile edge computing, fog et al.: A survey and analysis of security threats and challenges. Futur Gener Comput Syst 78:680–698

    Article  Google Scholar 

  35. Rousseeuw PJ, Hubert M (1999) Regression depth. J Am Stat Assoc 94(446):388–402

    Article  MathSciNet  Google Scholar 

  36. Simple Encrypted Arithmetic Library (release 3.1.0) https://github.com/microsoft/SEAL, December 2018. Microsoft Research, Redmond, WA

  37. Shahsavarifar R, Bremner D (2018) Approximate data depth revisited. arXiv:1805.07373

  38. Small CG (1990) A survey of multidimensional medians. International Statistical Review/Revue Internationale de Statistique, pp 263–277

  39. Smart NP, Vercauteren F (2010) Fully homomorphic encryption with relatively small key and ciphertext sizes. In: International Workshop on Public Key Cryptography, Springer, pp 420–443

  40. Smith A (2011) Privacy-preserving statistical estimation with optimal convergence rates. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, ACM, pp 813–822

  41. Tukey JW (1975) Mathematics and the picturing of data. In: Proceedings of the International Congress of Mathematicians, vol 2, pp 523–531

  42. Dijk Marten Van, Gentry Craig, Halevi Shai, Vaikuntanathan Vinod (2010) Fully homomorphic encryption over the integers. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, pp 24–43

  43. Wu D, Haven J (2012) Using homomorphic encryption for large scale statistical analysis. Technical report Technical report: cs. stanford. edu/people/dwu4/papers/FHESI Report pdf

  44. Zuo Y, Serfling R (2000) General notions of statistical depth function. Annals of Statistics, pp 461–482

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, University of New Brunswick, Fredericton, NB, E3B 5A3, Canada

    Hassan Mahdikhani, Rasoul Shahsavarifar, Rongxing Lu & David Bremner

Authors
  1. Hassan Mahdikhani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rasoul Shahsavarifar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rongxing Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. David Bremner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rongxing Lu.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mahdikhani, H., Shahsavarifar, R., Lu, R. et al. Achieve privacy-preserving simplicial depth query over collaborative cloud servers. Peer-to-Peer Netw. Appl. 13, 412–423 (2020). https://doi.org/10.1007/s12083-019-00810-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-019-00810-7

Keywords

Search

Navigation