| [1] Tran D H, Ng W K, Lim H W et al. An efficient cacheable securescalar product protocol for privacy-preserving data mining.In Proc. the 13th Int. Conf. Data Warehousing andKnowledge Discovery, Aug. 29-Sept. 2, 2011, pp.354-366.[2] Goethals B, Laur S, Lipmaa H, Mielikainen T. On privatescalar product computation for privacy-preserving data mining.In Proc. the 7th Int. Conf. Information Security andCryptology, Dec. 2004, pp.104-120.[3] Vaidya J, Clifton C. Privacy preserving association rule miningin vertically partitioned data. In Proc. the 8th SIGKDDInt. Conf. Knowledge Discovery and Data Mining, July2002, pp.639-644.[4] Du W, Atallah M. Privacy-preserving cooperative statisticalanalysis. In Proc. the 17th Annual Computer Security ApplicationsConference, Dec. 2001, pp.102-110.[5] Atallah M J, Du W. Secure multiparty computational geometry.In Proc. the 7th International Workshop on Algorithmsand Data Structures, Aug. 2011, pp.165-179.[6] Thomas T. Secure Two-party protocols for point inclusionproblem. Int. J. Network Security, 2009, 9(1): 1-7.[7] Yang B, Sun A D, Zhang W Z. Secure two-party protocolson planar circles. Journal of Information & ComputationalScience, 2011, 8(1): 29-40.[8] Yang B, Shao Z Y, Zhang W Z. Secure two-party protocolson planar convex hulls. Journal of Information & ComputationalScience, 2012, 9(4): 915-929.[9] Du W, Zhan Z. Building decision tree classifier on privatedata. In Proc. IEEE ICDM Workshop on Privacy, Security,and Data Mining, Dec. 2002, Vol.14, pp.1-8.[10] Amirbekyan A, Estivill-Castro V E C. A new efficient privacypreservingscalar product protocol. In Proc. the 6th AustralasianData Mining Conference, Dec. 2007, pp.209-214.[11] Hazay C. Efficient two-party computation with simulationbased security [Ph.D. Thesis]. Senate of Bar-Ilan University,Israel, 2009.[12] Goldreich O. Foundations of Cryptography (Vol.2): Basic Applications.London, UK: Cambridge University Press, 2004.[13] Schnorr C P. Efficient signature generation by smart cards.Journal of Cryptology, 1991, 4(3): 161-174.[14] Camenisch J, Shoup V. Practical verifiable encryption anddecryption of discrete logarithms. In Proc. CRYPTO 2003,Aug. 2003, pp.126-144.[15] Paillier P. Public-key cryptosystems based on composite degreeresidue classes. In Proc. the 17th Theory and Applicationof Cryptographic Techniques, May 1999, pp.223-238.[16] Jarecki S, Liu X. Efficient oblivious pseudorandom functionwith applications to adaptive OT and secure computation ofset intersection. In Proc. the 6th Theory of CryptographyConference, March 2009, pp.577-594. |