Score:1

Sensitivy Maximization RAPPOR (Local Differential Privacy)

cn flag

Hi I have a doubt at the end of the proof of the RAPPOR Algorithm, when they say the sensitivity is maximized when $b'_{h+1}=b'_{h+2}=...=b'_{2h}=1$ and $b'_{1}=b'_{2}=...=b'_{h}=0$. I don't understand if the maximized is define as the ratio of probabilities or comes from the definitions of sensitivity in differential privacy.

enter image description here

Link Paper: https://static.googleusercontent.com/media/research.google.com/es//pubs/archive/42852.pdf

I will appreciate any help. Thanks.

Score:0
do flag
Ted

Sensitivity is normally defined as the maximum change between outputs of a function between neighboring datasets, before noise addition. But in this particular sentence, they seem to use the term to mean "the maximum probability change between outputs, after noise addition". It's not a very typical use of terminology.

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.