Fetching the paper…
Reading the bibliography…
Motivated by understanding the dynamics of sensitive social networks over time, we consider the problem of continual release of statistics in a network that arrives online, while preserving privacy of its participants.
W. Kermack and A. McKendrick, “A contribution to the mathematical theory of epidemics,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 115, no. 772, pp. 700–721, 1927
1927
Earlier work this paper cites.
B. H. Hall, A. B. Jaffe, and M. Trajtenberg, “The nber patent citation data file: Lessons, insights and methodological tools,” National Bureau of Economic Research, Tech. Rep., 2001
2001
Earlier work this paper cites.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in TCC , 2006
2006
Earlier work this paper cites.
K. Nissim, S. Raskhodnikova, and A. Smith, “Smooth sensitivity and sampling in private data analysis,” in STOC , 2007
2007
Earlier work this paper cites.
M. Hay, C. Li, G. Miklau, and D. Jensen, “Accurate estimation of the degree distribution of private networks,” in ICDM . IEEE, 2009, pp. 169–178
2009
Earlier work this paper cites.
C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum, “Differential privacy under continual observation,” in STOC . ACM, 2010, pp. 715–724
2010
Earlier work this paper cites.
T.-H. H. Chan, E. Shi, and D. Song, “Private and continual release of statistics,” TISSEC , vol. 14, no. 3, p. 26, 2011
2011
Earlier work this paper cites.
V. Karwa, S. Raskhodnikova, A. Smith, and G. Yaroslavtsev, “Private analysis of graph structure,” VLDB , vol. 4, no. 11, pp. 1146–1157, 2011
2011
Earlier work this paper cites.
J. Gehrke, E. Lui, and R. Pass, “Towards privacy for social networks: A zero-knowledge based definition of privacy,” in TCC . Springer, 2011, pp. 432–449
2011
Earlier work this paper cites.
J. Bolot, N. Fawaz, S. Muthukrishnan, A. Nikolov, and N. Taft, “Private decayed predicate sums on streams,” in ICDT . ACM, 2013, pp. 284–295
2013
Cited alongside, same era.
J. Cao, Q. Xiao, G. Ghinita, N. Li, E. Bertino, and K.-L. Tan, “Efficient and accurate strategies for differentially-private sliding window queries,” in EDBT . ACM, 2013, pp. 191–202
2013
Cited alongside, same era.
A. Sarwate and K. Chaudhuri, “Signal processing and machine learning with differential privacy: Algorithms and challenges for continuous data,” Signal Processing Magazine, IEEE , vol. 30, no. 5, pp. 86–94, Sept 2013
2013
Cited alongside, same era.
C. Dwork and A. Roth, “The algorithmic foundations of differential privacy,” TCS , vol. 9, no. 3-4, pp. 211–407, 2013
2013
Cited alongside, same era.
Y. Wang, X. Wu, and L. Wu, “Differential privacy preserving spectral graph analysis,” in PAKDD , 2013, pp. 329–340
G. Kellaris, S. Papadopoulos, X. Xiao, and D. Papadias, “Differentially private event sequences over infinite streams,” VLDB , vol. 7, no. 12, pp. 1155–1166, 2014
2014
Later among the works it cites.
W. Lu and G. Miklau, “Exponential random graph estimation under differential privacy,” in KDD . ACM, 2014, pp. 921–930
2014
Later among the works it cites.
X. Wang, Y. Wu, L. Mao, W. Xia, W. Zhang, L. Dai, S. R. Mehta, J. O. Wertheim, X. Dong, T. Zhang et al. , “Targeting hiv prevention based on molecular epidemiology among deeply sampled subnetworks of men who have sex with men,” Clinical Infectious Diseases , vol. 61, no. 9, pp. 1462–1468, 2015
2015
Later among the works it cites.
C. Borgs, J. Chayes, and A. Smith, “Private graphon estimation for sparse graphs,” in NIPS , 2015, pp. 1369–1377
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
2013
Cited alongside, same era.
S. P. Kasiviswanathan, K. Nissim, S. Raskhodnikova, and A. Smith, “Analyzing graphs with node differential privacy,” in TCC . Springer, 2013, pp. 457–476
2013
Cited alongside, same era.
J. Blocki, A. Blum, A. Datta, and O. Sheffet, “Differentially private data analysis of social networks via restricted sensitivity,” in ITCS . ACM, 2013, pp. 87–96
2013
Cited alongside, same era.
S. J. Little, S. L. K. Pond, C. M. Anderson, J. A. Young, J. O. Wertheim, S. R. Mehta, S. May, and D. M. Smith, “Using hiv networks to inform real time prevention interventions,” PloS one , vol. 9, no. 6, p. e98443, 2014
2014
Cited alongside, same era.
2015
Later among the works it cites.
W.-Y. Day, N. Li, and M. Lyu, “Publishing graph degree distribution with node differential privacy,” in SIGMOD , 2016, pp. 123–138
2016
Later among the works it cites.
S. Kumar, “Structure and dynamics of signed citation networks,” in WWW , 2016, pp. 63–64
2016
Later among the works it cites.
J. O. Wertheim, S. L. K. Pond, L. A. Forgione, S. R. Mehta, B. Murrell, S. Shah, D. M. Smith, K. Scheffler, and L. V. Torian, “Social and genetic networks of hiv-1 transmission in new york city,” PLoS pathogens , vol. 13, no. 1, p. e1006000, 2017
2017
Later among the works it cites.
Y. Chen, A. Machanavajjhala, M. Hay, and G. Miklau, “Pegasus: Data-adaptive differentially private stream processing,” in CCS . ACM, 2017, pp. 1375–1388
2017
Later among the works it cites.