all InfoSec news
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. (arXiv:2301.02457v1 [cs.DS])
cs.CR updates on arXiv.org arxiv.org
We consider the problem of computing differentially private approximate
histograms and heavy hitters in a stream of elements. In the non-private
setting, this is often done using the sketch of Misra and Gries [Science of
Computer Programming, 1982]. Chan, Li, Shi, and Xu [PETS 2012] describe a
differentially private version of the Misra-Gries sketch, but the amount of
noise it adds can be large and scales linearly with the size of the sketch: the
more accurate the sketch is, the …
computer computer programming computing large misra non private problem programming science shi stream version