Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
remove formula based
  • Loading branch information
eriktaubeneck authored Aug 29, 2024
1 parent 5be0d90 commit e9ef7bc
Showing 1 changed file with 1 addition and 3 deletions.
4 changes: 1 addition & 3 deletions ipa-core/src/protocol/dp/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -10,9 +10,7 @@ considers their use for d-dimension queries (such as we will need for WALR).

To achieve a desired $(\varepsilon, \delta)$-DP guarantee, we generate $num\\_bernoulli$ secret shared samples of a
Bernoulli having probability $0.5$ using PRSS. Next we aggregate them to get a Binomial sample. The result of the 2018
paper above is that for small epsilon (TODO, how small required?), we require the following number of samples:

$$ num\\_bernoulli \geq \frac{8 \log \left( \frac{2}{\delta}\right)}{\varepsilon^2}$$
paper above is that for small epsilon.

This [spreadsheet](https://docs.google.com/spreadsheets/d/1sMgqkMw3-yNBp6f8ctyv4Hdfx9Ei7muj0ZhP9i1DHrw/edit#gid=0)
looks at the calculation for different parameter choices and confirms that this approach does lead to a better final
Expand Down

0 comments on commit e9ef7bc

Please sign in to comment.