A Cryptographic Solution to Privacy-Preserving Two-Party Sign Test Computation on Vertically Partitioned Data

Abstract:

Statistical hypothesis test is an important data analysis theory that has found applications in various research fields. It provides a theoretical foundation to determine whether sufficient evidence exists to reject hypothesis for the trial using experimental results, in order to make a decision. In this paper, we address one of the fundamental test theories: the Nonparametric Sign Test, under the privacy-preserving context. In this context, two parties, Alice and Bob, would like to perform a sign test on their joint dataset, but neither of them is willing to disclose their private raw data to the other party. More specifically, this paper addresses the problem where the joint dataset consists of two vertically partitioned datasets. Our previous work [14] has addressed this problem using data perturbation techniques. However, in a case when the privacy of individual data objects and data subjects are of high concern, using data perturbation techniques may not be sufficient. This paper proposes an alternative solution to this problem by employing an additive homomorphic encryption scheme and an on-line STTP. We show that this solution can offer better privacy preservation, in terms of individual data confidentiality and individual privacy, than the previous solution. A security comparison with TTPV and P22NSTV solutions is also presented.

• Periodical: Advanced Materials Research (Volumes 403-408)
• Pages: 1249-1257
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.403-408.1249
• Online since: November 2011
• Authors: Meng Chang Liu, Ning Zhang
• Keywords: Nonparametric Sign Test, Privacy, Secure Multi-Party Computation, Security, Statistical Hypothesis Test

References

[1] R. Agrawal and R. Srikant, (2000), Privacy Preserving data Mining", the Proceedings of the 2000 ACM SIGMOD International Conference On Management of Data (SIGMOD, 00), pages 439-450, Dallas, Texas, USA, 14-19 May 2000, ACM New York Press.

DOI: 10.1145/335191.335438

[2] R. Agrawal, A. Evimievski and R. Srikant, (2003).

[3] R. Canetti, (2001).

[4] C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin and M. Y. Zhu, (2002), Tools for Privacy Preserving Distributed Data Mining, ACM SIGKDD Explorations Newsletter: Volume 4(2), pages 28-34, ACM New York Press.

DOI: 10.1145/772862.772867

[5] C. Clifton, M. Kantarcioglu and J. Vaidya, (2002).

[6] W. Du, (2001), A Study of Several Specific Secure Two-party Computation Problems, A PhD thesis, Computer Science, Purdue University.

[7] W. Du and M. J. Atallah, (2001).

[8] W. Du, Y. S. Han and S. Chen, (2004).

[9] O. Goldreich, (1998), Secure Multi-party computation (working draft), available online: http: /www. wisdom. weizmann. ac. il/~oded/pp. html, last access May (2011).

[10] O. Goldreich, (2004), Foundations of Cryptography: Volume 1 - Basic Techniques, Cambridge University Press, Date of Publication: June 2001, ISBN 0-521-79172-3.

DOI: 10.1017/s002555720017322x

[11] O. Goldreich, (2004), Foundations of Cryptography: Volume 2 - Basic Applications, Cambridge University Press, Date of Publication: May 2004, ISBN 0-521-83084-2.

[12] M. Kantarcioglu and C. Clifton, (2003).

[13] Y. Lindell and B. Pinkas, (2000).

[14] M.C. Liu and N. Zhang, (2010).

[15] P. Sprent and N. C. Smeeton, (2000), Applied Nonparametric Statistical Methods, Third Edition, Chapman & Hall/CRC Texts in Statistical Science, September 2000, ISBN-13: 978-1584881452.

DOI: 10.1201/9781420057713.fmatt

[16] A. C. Yao, (1982), Protocols for secure computations, the Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 160-164, Chicago, Illinois, USA, 3-5 November 1982, IEEE Computer Society Press.

DOI: 10.1109/sfcs.1982.38

[17] A. C. Yao, (1986), How to generate and exchange secrets, the Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, Portland, Oregon, USA, 21-23 October 1985, IEEE Computer Society Press.

DOI: 10.1109/sfcs.1986.25