On Fast Private Scalar Product Protocols

1. Amirbekyan, A., Estivill-Castro, V.: A new efficient privacy-preserving scalar product protocol. In: The 6th Australian Data Mining Conference (AusDM 2007), pp. 205–210 (2007)

   Google Scholar 

2. Atallah, M.J., Du, W.: Secure Multi-Party Computational Geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 165–179. Springer, Heidelberg (2001)

   Chapter  Google Scholar 

3. Brassard, G., Crépeau, C., Robert, J.M.: All-or-Nothing Disclosure of Secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234–238. Springer, Heidelberg (1987)

   Chapter  Google Scholar 

4. Clifton, C., Kantarcioglu, M., Lin, X., Vaida, J., Zhu, M.: Tools for privacy preserving distributed data mining. SIGKDD Explorations 4(2), 28–34 (2003)

   Article  Google Scholar 

5. Damgård, I., Jurik, M.: A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System. In: Kim, K.-C. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119–136. Springer, Heidelberg (2001)

   Chapter  Google Scholar 

6. Du, W., Atallah, M.: Privacy-preserving statistical analysis. In: Proceedings of the 17th Annual Computer Security Applications Conference, pp. 102–110 (2001)

   Google Scholar 

7. Du, W., Atallah, M.: Protocols for secure remote database access with approximate matching, CERIAS Tech Report 2001-02, Department of Computer Sciences, Purdue University (2001)

   Google Scholar 

8. Gentry, C.: Fully Homomorphic Encryption Using Ideal Lattices. In: The 41st ACM Symposium on Theory of Computing, STOC (2009)

   Google Scholar 

9. Goethals, B., Laur, S., Lipmaa, H., Mielikäinen, T.: On Private Scalar Product Computation for Privacy-Preserving Data Mining. In: Park, C.-S., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104–120. Springer, Heidelberg (2005)

   Chapter  Google Scholar 

10. Goldreich, O.: Secure Multi-Party Computation, Final Draft Version 1.4 (2002), http://www.wisdom.weizmann.ac.il/

11. Huang, Y., Lu, Z., Hu, H.: Privacy preserving association rule mining with scalar product. In: Proceedings of NLP-KE 2005, pp. 750–755. IEEE (2005)

    Google Scholar 

12. Ioannidis, I., Grama, A., Atallah, M.: A secure protocol for computing dot-products in clustered and distributed environments. In: Proceedings of the International Conference on Parallel Processing, ICPP 2002 (2002)

    Google Scholar 

13. Laur, S., Lipma, H.: On private similarity search protocols. In: Proceedings of 9th Nordic Workshop on Secure IT Systems (NordSec 2004), pp. 73–77 (2004)

    Google Scholar 

14. Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the 31st ACM Symposium on Theory of Computing, pp. 245–254 (1999)

    Google Scholar 

15. Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

16. Trincă, D., Rajasekaran, S.: Fast Cryptographic Multi-Party Protocols for Computing Boolean Scalar Products with Applications to Privacy-Preserving Association Rule Mining in Vertically Partitioned Data. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 418–427. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

17. Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partioned data. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 639–634 (2002)

    Google Scholar 

Download references