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.

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

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

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.

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

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

Han, 2006

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

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

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