Equally contributory privacy-preserving k-means clustering over vertically partitioned data

Information Systems - Tập 38 - Trang 97-107 - 2013
Xun Yi1, Yanchun Zhang1
1Centre for Applied Informatics, School of Engineering and Science, Victoria University, PO Box 14428, Melbourne City MC, Victoria 8001, Australia

Tài liệu tham khảo

Adam, 1989, Security-control methods for statistical databases: a comparative study, ACM Computing Surveys, 21, 515, 10.1145/76894.76895

American National Standards Institute, ANSI X3.92-1981 American National Standard, Data Encryption Algorithm.

D. Agrawal, C. Aggarwal, On the design and quantification of privacy preserving data mining algorithms, in: Proceedings of 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2001, pp. 247–255.

Agrawal, 2000, Privacy-preserving data mining, ACM SIGMOD Record, 29, 439, 10.1145/335191.335438

A. Blum, C. Dwork, F. McSherry, K. Nissim, Practical privacy: the sulq framework, in: Proceedings PODS'05, 2005, pp. 128–138.

P. Bunn, R. Ostrovsky, Secure two-party k-means clustering, in: Proceedings CCS'07, 2007, pp. 486–497.

Chaum, 1981, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, 24, 84, 10.1145/358549.358563

M.R. Clarkson, S. Chong, A.C. Myers, Civitas: a secure remote voting system, in: Proceedings of the IEEE Symposium on Security and Privacy, 2008, pp. 354–368.

M. Dijk, C. Gentry, S. Halevi, V. Vaikuntanathan, Fully homomorphic encryption over the integers, in: Proceedings of the Eurocrypt'10, 2010, pp. 24–43.

I. Dinur, K. Nissim, Revealing information while preserving privacy, in: Proceedings of the PODS'03, 2003, pp. 202–210.

C. Dwork, F. McSherry, K. Nissim, A. Smith, Calibrating noise to sensitivity in private data analysis, in: Proceedings of the TCC'06, 2006, pp. 265–284.

C. Dwork, Differential privacy, in: Proceedings of ICALP'06, 2006, pp. 1–12.

ElGamal, 1985, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, 31, 469, 10.1109/TIT.1985.1057074

C. Gentry, A Fully Homomorphic Encryption Scheme, Ph.D. Thesis, Stanford University, 2009.

C. Gentry, Fully homomorphic encryption using ideal lattices, in: Proceedings of the STOC'09, 2009, pp. 169–178.

Gentry, 2010, Computing arbitrary functions of encrypted data, Communications of ACM, 53, 97, 10.1145/1666420.1666444

C. Gentry, Toward basing fully homomorphic encryption on worst-case hardness, in: Proceedings of the Crypto'10, 2010.

O. Goldreich, S. Micali, A. Wigderson, How to play any mental game—a completeness theorem for protocols with honest majority, in: 19th ACM Symposium on the Theory of Computing, 1987, pp. 218–229.

P. Golle, M. Jakobsson, A. Juels, P. Syverson, Universal re-encryption for mixnets, in: Proceedings of the CT-RSA'04, 2004, pp. 163–178.

P. Golle, A. Juels, Parallel mixing, in: Proceedings of CCS'04, 2004, pp. 220–226.

Han, 2006

〈http://www.cryptopp.com/benchmarks.html〉.

G. Jagannathan, R. Wright, Privacy-preserving distributed k-means clustering over arbitrarily partitioned data, in: Proceedings of the KDD'05. 2005, pp. 593–599.

M. Jakobsson, A. Juels, Mix and match: secure function evaluation via ciphertexts, in: Proceedings of the Asiacrypt'00, 2000, pp. 162–177.

S. Jha, L. Kruger, P. McDaniel, Privacy preserving clustering, in: Proceedings of the 10th European Symposium on Research in Computer Security, 2005, pp. 397–417.

A. Juels, D. Catalano, M. Jakobsson, Coercion-resistant electronic election, in: Proceedings of the WPES'05, 2005, pp. 61–70.

Lenstra, 2001, Selecting cryptographic key sizes, Journal of Cryptology, 14, 255, 10.1007/s00145-001-0009-4

Lin, 2005, Privacy-preserving clustering with distributed EM mixture modeling, Journal of Knowledge and Information Systems, 8, 68, 10.1007/s10115-004-0148-7

Lloyd, 1982, Least squares quantization in PCM, IEEE Transactions on Information Theory, 28, 129, 10.1109/TIT.1982.1056489

J.B. MacQueen, Some methods for classification and analysis of multivariate observations, in: Proc. 5th Berkeley Symposium on Mathematical Statistics and Probability, 1967, pp. 281–297.

S. Oliveira, O.R. Zaiane, Privacy-preserving clustering by data transformation, in: Proceedings of the 18th Brazilian Symposium on Database, 2003, pp. 304–318.

Steinhaus, 1956, Sur la division des corp materials en parties, Bulletin de l Academie Polonaise des Sciences, 4, 801

J. Vaidya, C. Clifton, Privacy-preserving k-means clustering over vertically partitioned data, in: Proceedings of the SIGKDD'03, 2003, pp. 206–215.

A.C.C. Yao, How to generate and exchange secrets, in: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 162–167.

Yi, 2007, Privacy-preserving distributed association rule mining via semi-trusted mixer, Data Knowledge and Engineering, 63, 550, 10.1016/j.datak.2007.04.001

Yi, 2009, Privacy-preserving naive Bayes classification on distributed data via semi-trusted mixers, Information Systems, 34, 371, 10.1016/j.is.2008.11.001

Thông tin
Thông tin xuất bản

Information Systems

Tập 38

97-107

Thông tin tác giả