Score:0

Difference of unconditional and perfect security in terms of IND-Game

us flag

Both unconditional and perfect security were very clear to me, until I bumped upon different sources that confused me.

For example : 1 2 3. Also in 3 the DH76 paper is referenced and it doesn't define unconditional security in terms of a negligible function.

In terms of IND-Game, this is how I perceived them, with the perfect security being a special case of unconditional security

In IND-Game, if $S$ is the event that $b=\hat{b}$ and the adversary's advantage $SS\text{-}Advantage = |Pr(S)-\dfrac{1}{2}|$. Then :

  • Perfect security : $SS\text{-}Advantage = 0$ against unbounded $\mathcal{A}$
  • Unconditional security : $SS\text{-}Advantage = negl(λ)$ against unbounded $\mathcal{A}$
  • (For completeness purposes) Computational security : $SS\text{-}Advantage = negl(λ)$ against bounded $\mathcal{A}$

Can anyone help me clarify these terms? Is there a consensus on which definitions to use today in bibliography?

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.