Privacy-preservation techniques in data mining
暂无分享,去创建一个
Chunhua Su | Kouichi Sakurai | Feng Bao | Guilin Wang | Jianying Zhou | K. Sakurai | Jianying Zhou | F. Bao | Chunhua Su | Guilin Wang
[1] Chunhua Su,et al. Two-Party Privacy-Preserving Agglomerative Document Clustering , 2007, ISPEC.
[2] Rebecca N. Wright,et al. A New Privacy-Preserving Distributed k-Clustering Algorithm , 2006, SDM.
[3] Moni Naor,et al. Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.
[4] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[5] Joan Feigenbaum,et al. Secure multiparty computation of approximations , 2001, TALG.
[6] Taneli Mielikäinen,et al. Private Itemset Support Counting , 2005, ICICS.
[7] Somesh Jha,et al. Privacy Preserving Clustering , 2005, ESORICS.
[8] Rebecca N. Wright,et al. Privacy-preserving distributed k-means clustering over arbitrarily partitioned data , 2005, KDD '05.
[9] Benny Pinkas,et al. Keyword Search and Oblivious Pseudorandom Functions , 2005, TCC.
[10] Eike Kiltz,et al. Secure Computation of the Mean and Related Statistics , 2005, IACR Cryptol. ePrint Arch..
[11] Bart Goethals,et al. On Private Scalar Product Computation for Privacy-Preserving Data Mining , 2004, ICISC.
[12] Chris Clifton,et al. Privacy-preserving k-means clustering over vertically partitioned data , 2003, KDD '03.
[13] Matthias Klusch,et al. Distributed Clustering Based on Sampling Local Density Estimates , 2003, IJCAI.
[14] Martin Ester,et al. Frequent term-based text clustering , 2002, KDD.
[15] Ivan Damgård,et al. Client/Server Tradeoffs for Online Elections , 2002, Public Key Cryptography.
[16] Wenliang Du,et al. Privacy-preserving cooperative statistical analysis , 2001, Seventeenth Annual Computer Security Applications Conference.
[17] Yehuda Lindell,et al. Privacy Preserving Data Mining , 2000, Journal of Cryptology.
[18] George Karypis,et al. A Comparison of Document Clustering Techniques , 2000 .
[19] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[20] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[21] Oren Etzioni,et al. Web document clustering: a feasibility demonstration , 1998, SIGIR '98.
[22] Erich Schikuta,et al. Grid-clustering: an efficient hierarchical clustering method for very large data sets , 1996, Proceedings of 13th International Conference on Pattern Recognition.
[23] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[24] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[25] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[26] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[27] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .