Journal of Privacy and Confidentiality 2022-11-02T07:48:50-07:00 Lars Vilhuber and/or Rachel Cummings Open Journal Systems <p>The <em>Journal of Privacy and Confidentiality</em>&nbsp;is an open-access multi-disciplinary journal whose purpose is to facilitate the coalescence of research methodologies and activities in the areas of privacy, confidentiality, and disclosure limitation. The JPC seeks to publish a wide range of research and review papers, not only from academia, but also from government (especially official statistical agencies) and industry, and to serve as a forum for exchange of views, discussion, and news.</p> The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model 2022-08-30T11:01:16-07:00 Kobbi Nissim Chao Yan <div class="page" title="Page 1"> <div class="layoutArea"> <div class="column"> <p>We provide a lowerbound on the sample complexity of distribution-free parity learning in the realizable case in the shuffle model of differential privacy. Namely, we show that the sample complexity of learning d-bit parity functions is Ω(2d/2). Our result extends a recent similar lowerbound on the sample complexity of private agnostic learning of parity functions in the shuffle model by Cheu and Ullman . We also sketch a simple shuffle model protocol demon- strating that our results are tight up to poly(d) factors.</p> </div> </div> </div> 2022-11-02T00:00:00-07:00 Copyright (c) 2022 Kobbi Nissim, Chao Yan Representing Sparse Vectors with Differential Privacy, Low Error, Optimal Space, and Fast Access 2022-08-11T06:55:02-07:00 Martin Aumüller Christian Janos Lebeda Rasmus Pagh <div> <div>Representing a sparse histogram, or more generally a sparse vector, is a fundamental task in differential privacy.</div> <div>An ideal solution would use space close to information-theoretical lower bounds, have an error distribution that depends optimally on the desired privacy level, and allow fast random access to entries in the vector.</div> <div>However, existing approaches have only achieved two of these three goals.</div> <div>&nbsp;</div> <div>In this paper we introduce the Approximate Laplace Projection (ALP) mechanism for approximating k-sparse vectors. This mechanism is shown to simultaneously have information-theoretically optimal space (up to constant factors), fast access to vector entries, and error of the same magnitude as the Laplace-mechanism applied to dense vectors.</div> <div>A key new technique is a <em>unary</em> representation of small integers, which we show to be robust against ''randomized response'' noise. This representation is combined with hashing, in the spirit of Bloom filters, to obtain a space-efficient, differentially private representation.</div> <br> <div>Our theoretical performance bounds are complemented by simulations which show that the constant factors on the main performance parameters are quite small, suggesting practicality of the technique.</div> </div> 2022-11-02T00:00:00-07:00 Copyright (c) 2022 Christian Janos Lebeda, Martin Aumüller, Rasmus Pagh Consistent Spectral Clustering of Network Block Models under Local Differential Privacy 2022-07-05T08:04:48-07:00 Jonathan Hehir Aleksandra Slavkovic Xiaoyue Niu <p>The stochastic block model (SBM) and degree-corrected block model (DCBM) are network models often selected as the fundamental setting in which to analyze the theoretical properties of community detection methods. We consider the problem of spectral clustering of SBM and DCBM networks under a local form of edge differential privacy. Using a randomized response privacy mechanism called the edge-flip mechanism, we develop theoretical guarantees for differentially private community detection, demonstrating conditions under which this strong privacy guarantee can be upheld while achieving spectral clustering convergence rates that match the known rates without privacy. We prove the strongest theoretical results are achievable for dense networks (those with node degree linear in the number of nodes), while weak consistency is achievable under mild sparsity (node degree greater than $\sqrt{n}$). We empirically demonstrate our results on a number of network examples.</p> 2022-11-02T00:00:00-07:00 Copyright (c) 2022 Jonathan Hehir, Aleksandra Slavkovic, Xiaoyue Niu Exact Inference with Approximate Computation for Differentially Private Data via Perturbations 2022-07-19T01:53:30-07:00 Ruobin Gong <p>This paper discusses how two classes of approximate computation algorithms can be adapted, in a modular fashion, to achieve exact statistical inference from differentially private data products. Considered are approximate Bayesian computation for Bayesian inference, and Monte Carlo Expectation-Maximization for likelihood inference. Up to Monte Carlo error, inference from these algorithms is exact with respect to the joint specification of both the analyst's original data model, and the curator's differential privacy mechanism. Highlighted is a duality between approximate computation on exact data, and exact computation on approximate data, which can be leveraged by a well-designed computational procedure for statistical inference.</p> 2022-11-02T00:00:00-07:00 Copyright (c) 2022 Ruobin Gong