[1] GOLDREICH O,MICALI S,WIGDERSON A. How to play ANY mental game[C]//Proceedings of the 19th Annual ACM Symposium on Theory of Computing. New York:ACM,1987:218-229. [2] YAO A C C. How to generate and exchange secrets[C]//Proceeding of the 27th Annual Symposium on Foundations of Computer Science. Piscataway:IEEE,1986:162-167. [3] 田有亮, 彭长根, 马建峰, 等. 通用可组合公平安全多方计算协议[J]. 通信学报,2014,35(2):54-62.(TIAN Y L,PENG C G, MA J F, et al. Universally composable secure multiparty computation protocol with fairness[J]. Journal on Communications, 2014,35(2):54-62.) [4] 张恩, 蔡永泉. 理性的安全两方计算协议[J]. 计算机研究与发展,2013,50(7):1409-1417.(ZHANG E,CAI Y Q. Rational secure two-party computation protocol[J]. Journal of Computer Research and Development,2013,50(7):1409-1417.) [5] 张恩, 耿魁, 金伟, 等. 抗隐蔽敌手的云外包秘密共享方案[J]. 通信学报,2017,38(5):57-65.(ZHANG E,GENG K,JIN W, et al. Cloud outsourcing secret sharing scheme against covert adversaries[J]. Journal on Communications, 2017, 38(5):57-65.) [6] ZHANG E, LI F, NIU B, et al. Server-aided private set intersection based on reputation[J]. Information Sciences,2017, 387:180-194. [7] AGRAWAL R,SRIKANT R. Privacy-preserving data mining[C]//Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. New York:ACM,2000:439-450. [8] LINDELL Y,PINKAS B. Privacy preserving data mining[C]//Proceedings of the 2000 Annual International Cryptology Conference,LNCS 1880. Berlin:Springer,2000:36-54. [9] VAIDYA J,CLIFTON C. Privacy-preserving k-means clustering over vertically partitioned data[C]//Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM,2003:206-215. [10] YI X, ZHANG Y. Equally contributory privacy-preserving k-means clustering over vertically partitioned data[J]. Information Systems,2013,38(1):97-107. [11] JHA S,KRUGER L,MCDANIEL P. Privacy preserving clustering[C]//Proceedings of the 2005 European Symposium on Research in Computer Security, LNCS 3679. Berlin:Springer, 2005:397-417. [12] JAGANNATHAN G, WRIGHT R N. Privacy-preserving distributed k-means clustering over arbitrarily partitioned data[C]//Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. New York:ACM,2005:593-599. [13] BUNN P,OSTROVSKY R. Secure two-party k-means clustering[C]//Proceedings of the 14th ACM Conference on Computer and Communications Security. New York:ACM,2007:486-497. [14] XING K,HU C,YU J,et al. Mutual privacy preserving k-means clustering in social participatory sensing[J]. IEEE Transactions on Industrial Informatics,2017,13(4):2066-2076. [15] MOHASSEL P, ROSULEK M, TRIEU N. Practical privacypreserving k-means clustering[J]. Proceedings on Privacy Enhancing Technologies,2020,2020(4):414-433. [16] MESKINE F, BAHLOUL S N. Privacy preserving k-means clustering:a survey research[J]. The International Arab Journal of Information Technology,2012,9(2):194-200. [17] SU D, CAO J, LI N, et al. Differentially private k-means clustering and a hybrid approach to private optimization[J]. ACM Transactions on Privacy and Security,2017,20(4):No. 16. [18] FELDMAN D, XIANG C, ZHU R, et al. Coresets for differentially private k-means clustering and applications to privacy in mobile sensor networks[C]//Proceedings of the 16th ACM/IEEE International Conference on Information Processing in Sensor Networks. New York:ACM,2017:3-15. [19] HUANG Z,LIU J. Optimal differentially private algorithms for kmeans clustering[C]//Proceedings of the 37th ACM SIGMODSIGACT-SIGAI Symposium on Principles of Database Systems. New York:ACM,2018:395-408. [20] RAO F Y,SAMANTHULA B K,BERTINO E,et al. Privacy preserving and outsourced multi-user k-means clustering[C]//Proceedings of the 2015 IEEE Conference on Collaboration and Internet Computing. Piscataway:IEEE,2015:80-89. [21] LIU D,BERTINO E,YI X. Privacy of outsourced k-means clustering[C]//Proceedings of the 9th ACM Symposium on Information,Computer and Communications Security. New York:ACM,2014:123-134. [22] JIANG Z L,GUO N,JIN Y,et al. Efficient two-party privacypreserving collaborative k-means clustering protocol supporting both storage and computation outsourcing[J]. Information Sciences,2020,518:168-180. [23] MACQUEEN J. Some methods for classification and analysis of multivariate observations[C]//Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. Oakland, CA:University of California Press,1967:281-297. [24] DEMMLER D, SCHNEIDER T, ZOHNER M. ABY-a framework for efficient mixed-protocol secure two-party computation[EB/OL].[2020-03-20]. https://thomaschneider.de/papers/DSZ15.pdf. [25] BELLARE M,HOANG V T,ROGAWAY P. Foundations of garbled circuits[C]//Proceedings of the 2012 ACM Conference on Computer and Communications Security. New York:ACM,2012:784-796. [26] BEAVER D,MICALI S,ROGAWAY P. The round complexity of secure protocols[C]//Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. New York:ACM,1990:503-513. [27] KOLESNIKOV V,SCHNEIDER T. Improved garbled circuit:free XOR gates and applications[C]//Proceeding of the 2008 International Colloquium on Automata, Languages, and Programming,LNCS 5126. Berlin:Springer,2008:486-498. [28] ZAHUR S,ROSULEK M,EVANS D. Two halves make a whole[C]//Proceedings of the 2015 Annual International Conference on the Theory and Applications of Cryptographic Techniques,LNCS 9057. Berlin:Springer,2015:220-250. [29] GOLDREICH O. Foundations of Cryptography:volume 2,Basic Applications[M]. Cambridge:Cambridge University Press, 2004:620-625. [30] FRÄNTI P, VIRMAJOKI O. Iterative shrinking method for clustering problems[J]. Pattern Recognition,2006,39(5):761-775. |