Privacy-preserving graph algorithms in the semi-honest model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3788 LNCS, Issue , 2005, Pages 236-252

  Brickell, Justin ^a   Shmatikov, Vitaly ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Graph Algorithms; Privacy; Secure Multiparty Computation

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DATA MINING; DATA PRIVACY; INFORMATION ANALYSIS; MATHEMATICAL MODELS;

GRAPH ALGORITHMS; MULTI-PARTY COMPUTATION PARADIGM; PRIVACY; SECURE MULTIPARTY COMPUTATION;

GRAPH THEORY;

EID: 33646793331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_13     Document Type: Conference Paper

References (39)

1. G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the k-th ranked element. In Proc. Advances in Cryptology - EUROCRYPT 2004, volume 3027 of LNCS, pages 40-55. Springer-Verlag, 2004.
2. D. Agrawal and C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Proc. 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 247-255. ACM, 2001.
3. R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In Proc. 2003 ACM SIGMOD International Conference on Management of Data, pages 86-97. ACM, 2003.
4. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proc. 2000 ACM SIGMOD International Conference on Management of Data, pages 439-450. ACM, 2000.
5. M. Bawa, R. Bayardo, and R. Agrawal. Privacy-preserving indexing of documents on the network. In Proc. 29th International Conference on Very Large Databases (VLDB), pages 922-933. Morgan Kaufmann, 2003.
6. D. Beaver. Foundations of secure interactive computing. In Proc. Advances in Cryptology - CRYPTO 1991, volume 576 of LNCS, pages 377-391. Springer-Verlag, 1992.
7. R. Canetti. Security and composition of multiparty cryptograpic protocols. J. Cryptology, 13(1):143-202, 2000.
8. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Towards privacy in public databases. In Proc. 2nd Theory of Cryptography Conference (TCC), volume 3378 of LNCS, pages 363-385. Springer-Verlag, 2005.
9. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. J. ACM, 45(6):965-981, 1998.
10. C. Clifton, M. Kantarcioglou, J. Vaidya, X. Lin, and M. Zhu. Tools for privacy preserving distributed data mining. ACM SIGKDD Explorations, 4(2):28-34, 2002.
11. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
12. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 202-210. ACM, 2003.
13. W. Du and M. Atallah. Privacy-preserving cooperative scientific computations. In Proc. 14th IEEE Computer Security Foundations Workshop (CSFW), pages 273-294. IEEE, 2001.
14. W. Du and M. Atallah. Privacy-preserving cooperative statistical analysis. In Proc. 17th Annual Computer Security Applications Conference (ACSAC), pages 102-112. IEEE, 2001.
15. W. Du, Y. Han, and S. Chen. Privacy-preserving multivariate statistical analysis: linear regression and classification. In Proc. 4th SIAM International Conference on Data Mining (SDM), pages 222-233. SIAM, 2004.
16. C. Dwork and K. Nissim. Privacy-preserving data mining on vertically partitioned databases. In Proc. Advances in Cryptology - CRYPTO 2004, volume 3152 of LNCS, pages 528-544. Springer-Verlag, 2004.
17. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. Information Systems, 29(4):343-364, 2004.
18. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. Wright. Secure multiparty computation of approximations. In Proc. 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of LNCS, pages 927-938. Springer-Verlag, 2001.
19. J. Feigenbaum, B. Pinkas, R. Ryger, and F. Saint-Jean. Secure computation of surveys. In Proc. EU Workshop on Secure Multiparty Protocols, 2004.
20. M. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Proc. Advances in Cryptology - EUROCRYPT 2004, volume 3027 of LNCS, pages 1-19. Springer-Verlag, 2004.
21. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. J. Computer and System Sciences, 60(3):592-629, 2000.
22. O. Goldreich. Foundations of Cryptography: Volume II (Basic Applications). Cambridge University Press, 2004.
23. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. Annual 19th ACM Symposium on Theory of Computing (STOC), pages 218-229. ACM, 1987.
24. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In Proc. ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD). ACM, July 2002.
25. M. Kantarcioglu, J. Jin, and C. Clifton. When do data mining results violate privacy? In Proc. 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 599-604. ACM, 2004.
26. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar. On the privacy preserving properties of random data perturbation techniques. In Proc. 3rd IEEE International Conference on Data Mining (ICDM), pages 99-106. IEEE, 2003.
27. L. Kissner and D. Song. Privacy-preserving set operations. In Proc. Advances in Cryptology - CRYPTO 2005 (to appear). Springer-Verlag, 2005.
28. Y. Lindell and B. Pinkas. Privacy preserving data mining. J. Cryptology, 15(3):177-206, 2002.
29. Y. Lindell and B. Pinkas. A proof of Yao's protocol for secure two-party computation. http://eprint.iacr.org/2004/175, 2004.
30. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 590-599. ACM, 2001.
31. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proc. 12th Annual Symposium on Discrete Algorithms (SODA), pages 448-457. ACM, 2001.
32. M. Naor and B. Pinkas. Computationally secure oblivious transfer. J. Cryptology, 18(1):1-35, 2005.
33. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. 1st ACM Conference on Electronic Commerce, pages 129-139. ACM, 1999.
34. H. Polat and W. Du. Privacy-preserving collaborative filtering using randomized perturbation techniques. In Proc. 3rd IEEE International Conference on Data Mining (ICDM), pages 625-628. IEEE, 2003.
35. J. Vaidya and C. Clifton. Privacy-preserving association rule mining in vertically partitioned data. In Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 639-644. ACM, 2002.
36. V. Verykios, E. Bertino, I. Fovino, L. Provenza, Y. Saygin, and Y. Theodoridis. State-of-the-art in privacy preserving data mining. SIGMOD Record, 33(1):50-57, 2004.
37. R. Wright and Z. Yang. Privacy-preserving Bayesian network structure computation on distributed heterogeneous data. In Proc. 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 713-718. ACM, 2004.
38. Z. Yang, B. Zhong, and R. Wright. Privacy-preserving classification of customer data without loss of accuracy. In Proc. 5th SIAM International Conference on Data Mining (SDM). SIAM, 2005.
39. A. Yao. How to generate and exchange secrets. In Proc. 27th IEEE Symposium on Foundations of Computer Science (FOCS), pages 162-167. IEEE, 1986.