Learn More
We investigate the problem of privately answering queries on databases consisting of points in [0, 1] ℓ. We prove the following results. First, we show that there exists a computationally efficient ε-differentially private mechanism that releases a query class parametrized by additively separable Hölder continuous functions. Second, we show that, if the(More)
We define the notions of weak and strong usefulness and investigate the question whether a randomized response scheme can combine two conflicting goals, namely being weakly (or even strongly) useful and, at the same time, providing ε-differential privacy. We prove the following results. First, if a class F cannot be weakly SQ-learned under the uniform(More)
The Partial Sum Attack is one of the most powerful attacks , independent of the key schedule, developed in the last 15 years against reduced-round versions of AES. In this paper, we introduce a slight improvement to the basic attack which lowers the number of chosen plaintexts needed to successfully mount it. Our version of the attack on 6-round AES can be(More)
Popular approaches to differential privacy, such as the Laplace and exponential mechanisms, calibrate randomised smoothing through global sensitivity of the target non-private function. Bounding such sensitivity is often a prohibitively complex analytic calculation. As an alternative, we propose a straightforward sampler for estimating sensitivity of(More)
  • 1