Private analysis of graph structure

ACM Transactions on Database Systems

Volumn 39, Issue 3, 2014, Pages

  Karwa, Vishesh ^a   Raskhodnikova, Sofya ^b   Smith, Adam ^b   Yaroslavtsev, Grigory ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b The Center for Nanotechnology Education and Utilization   (United States)

Author keywords

Algorithms; Differential privacy; Graph algorithms; Security; Social network analysis; Statistical data privacy; Theory; Security and privacy : data anonymization and Sanitization; Theory of computation : graph algorithms analysis

Indexed keywords

ALGORITHMS; ALUMINUM; COMPUTATION THEORY; DATA PRIVACY; HIGHER ORDER STATISTICS; SOCIAL NETWORKING (ONLINE); STARS;

DATA ANONYMIZATION; DIFFERENTIAL PRIVACIES; GRAPH ALGORITHMS; SECURITY; STATISTICAL DATAS; THEORY;

GRAPH THEORY;

EID: 84995700579     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2611523     Document Type: Article

References (36)

1. nd Ed. Wiley-Interscience.
2. th International World Wide Web Conference (WWW'07). 181-190.
3. th Conference on Innovations in Theoretical Computer Science (ITCS'13). R. D. Kleinberg, Ed., ACM Press, New York, 87-96.
4. S. Chen and S. Zhou. 2013. Recursive mechanism: Towards node differential privacy and unrestricted joins. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'13). 653-664.
5. DIMACS. 2012. Dimacs workshop on recent work on differential privacy across computer science. http://dimacs.rutgers.edu/Workshops/DifferentialPrivacy.
6. rd International Colloquium on Automata, Languages and Programming (ICALP'06). M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, Eds., Lecture Notes in Computer Science, vol. 4052, Springer, 1-12.
7. th Theory of Cryptography Conference (TCC'09). Springer, 496-502.
8. th Annual International Conference on The Theory and Applications of Cryptographic Techniques (EUROCRYPT'06). S. Vaudenay, Ed., Lecture Notes in Computer Science, vol. 4004, Springer, 486-503.
9. rd Conference on Theory of Cryptography (TCC'06). S.Halevi and T. Rabin, Eds., Lecture Notes in Computer Science, vol. 3876, Springer, 265-284.
10. st Annual ACM Symposium on Theory of Computing (STOC'09).M.Mitzenmacher, Ed., ACM Press, New York, 371-380.
11. C. Dwork and A. Smith. 2009. Differential privacy for statistics: What we know and what we want to learn. J. Privacy Confidential. 1, 2.
12. th Conference on Theory of Cryptography (TCC'11). Y. Ishai, Ed., Lecture Notes in Computer Science, vol. 6597, Springer, 432-449.
13. A. Goldenberg, A. X. Zheng, S. E. Fienberg, and E. M. Airoldi. 2010. A survey of statistical network models. Found. Trends Mach. Learn. 2, 2, 129-233.
14. th International Conference on Theory of Cryptography (TCC'12). 339-356.
15. th International Conference on Data Mining (ICDM'09), IEEE Computer Society, 169-178.
16. D. Hunter. 2007. Curved exponential family models for social networks. Social Netw. 29, 2, 216-230.
17. V. Karwa, S. Raskhodnikova, A. Smith, and G. Yaroslavtsev. 2011. Private analysis of graph structure. Proc. VLDB Endow. 4, 11, 1146-1157.
18. V. Karwa and A. B. Slavkovic. 2012. Differentially private graphical degree sequences and synthetic graphs. In Proceedings of the International Conference on Privacy in Statistical Databases (PSD'12). J. Domingo-Ferrer and I. Tinnirello, Eds., Lecture Notes in Computer Science, vol. 7556, Springer, 273-285.
19. th Theory of Cryptography Conference (TCC'13). 457-476.
20. nd ACM Symposium on Theory of Computing (STOC'10). L. J. Schulman, Ed., ACM Press, New York, 775-784.
21. S. P. Kasiviswanathan and A. Smith. 2008. A note on differential privacy: Defining resistance to arbitrary side information. https://eprint.iacr.org/2008/144.pdf.
22. D. Kifer and A. Machanavajjhala. 2011. No free lunch in data privacy. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'11). T. K. Sellis, R. J. Miller, A. Kementsietsidis, and Y. Velegrakis, Eds., ACM Press, New York, 193-204.
23. E. D. Kolaczyk. 2009. Statistical Analysis of Network Data: Methods and Models. Springer.
24. B.-R. Lin and D. Kifer. 2013. Information preservation in statistical privacy and bayesian estimation of unattributed histograms. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'13). 677-688.
25. th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09). ACM New York, 627-636.
26. D. J. Mir and R. N. Wright. 2012. A differentially private estimator for the stochastic kronecker graph model. In Proceedings of the Joint EDBT/ICDT Workshops. D. Srivastava and I. Ari, Eds., ACM Press, New York, 167-176.
27. th IEEE Symposium on Security and Privacy (SP'09). 173-187.
28. th Annual ACM Symposium on Theory of Computing (STOC'07). ACM Press, New York, 75-84.
29. th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'09). 107-116.
30. G. Robins, P. Pattison, Y. Kalish, and D. Lusher. 2007. An introduction to exponential random graph (p∗) models for social networks. Social Netw. 29, 2, 173-191.
31. K. A. Ross, D. Srivastava, and D. Papadias, Eds. 2013. Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York.
32. A. Roth. 2011. The algorithmic foundations of differential privacy. http://www.cis.upenn.edu/~aaroth/courses/privacyF11.html.
33. A. Roth and M. Pai. 2013. Privacy and mechanism design. ACM SIGecom Exchang. 12, 1, 8-29.
34. T. Snijders, P. Pattison, G. Robins, and M. Handcock. 2006. New specifications for exponential random graph models. Sociol. Methodol. 36, 1, 99-153.
35. V. Vu. 2002. Concentration of non-lipschitz functions and applications. Random Struct. Algor. 20, 3, 262-316.
36. B. Zhou, J. Pei, and W. Luk. 2008. A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explor. Newslett. 10, 2, 12-22.