Difference between revisions of "Differential privacy"

From Simson Garfinkel
Jump to navigationJump to search
m
m
Line 26: Line 26:
== Other attacks ==
== Other attacks ==
* [http://www.cse.psu.edu/~duk17/papers/definetti.pdf Attacks on Privacy and deFinetti’s Theorem], Daniel Kifer, Penn State University, 2017
* [http://www.cse.psu.edu/~duk17/papers/definetti.pdf Attacks on Privacy and deFinetti’s Theorem], Daniel Kifer, Penn State University, 2017
== Math==
p for randomized response rate:
$p = \frac{e^\epsilon}{1+e^\epsilon}$
Probability that  randomized response should be flipped.


== See Also ==
== See Also ==

Revision as of 12:43, 20 February 2017

A few references on Differential Privacy, for people who don't want to get bogged down with the math.

Video

Differential Privacy and Floating Point Accuracy

Floating point math on computer's isn't continuous, and differential privacy implementations that assume it is may experience a variety of errors that result in privacy loss. A discussion of the problems inherently in floating-point arithmetic can be found in Oracle's What Every Computer Scientist Should Know About Floating-Point Arithmetic, an edited reprint of the paper What Every Computer Scientist Should Know About Floating-Point Arithmetic, by David Goldberg, published in the March, 1991 issue of Computing Surveys.

Other attacks

Math

p for randomized response rate:

$p = \frac{e^\epsilon}{1+e^\epsilon}$

Probability that randomized response should be flipped.

See Also