Di ↵ erentially Private Analysis on Graph Streams
Di ↵ erentially Private Analysis on Graph Streams
复制标题
图流上的差异私有分析
DOI:
--
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
R. Arora
中科院分区:
文献类型:
--
作者:
Jalaj Upadhyay;Sarvagya Upadhyay;R. Arora
In this paper, we focus on answering queries, in a di ↵ erentially private manner, on graph streams. We adopt the sliding window model of privacy, where we wish to perform analysis on the last W updates and ensure that privacy is preserved for the entire stream. We show that in this model, the price of ensuring di ↵ erential privacy is minimal. Furthermore, since di ↵ erential privacy is preserved under post-processing, our results can be used as a subroutine in many tasks, most notably solving cut functions and spectral clustering.
登录
查看更多内容
影响因子:
2.5
作者:
Singer, A.
通讯作者:
Singer, A.
DOI:
10.1109/focs.2015.24
发表时间:
2015-08
期刊:
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
Y. Lee;He Sun
通讯作者:
Y. Lee;He Sun
DOI:
10.4230/lipics.approx-random.2018.7
发表时间:
2018-05
期刊:
ArXiv
影响因子:
--
作者:
V. Braverman;Elena Grigorescu;Harry Lang;David P. Woodruff;Samson Zhou
通讯作者:
V. Braverman;Elena Grigorescu;Harry Lang;David P. Woodruff;Samson Zhou
DOI:
--
发表时间:
2019
期刊:
Proceedings of Machine Learning Research
影响因子:
--
作者:
Upadhyay, Jalaj
通讯作者:
Upadhyay, Jalaj