Information-theoretic security with asymmetries

ePrint Report: Information-theoretic security with asymmetries

Tim Beyne, Yu Long Chen

In this paper, we study the problem of lower bounding any
given cost function depending on the false positive and false negative
probabilities of adversaries against indistinguishability security notions in symmetric-key cryptography. We take the cost model as an input, so that this becomes a purely information-theoretical question.


We propose power bounds as an easy-to-use alternative for advantage bounds in the context of indistinguishability with asymmetric cost functions. We …

adversaries chen cost cryptography eprint report false positive function information input key problem report security study symmetric tim