arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.05697math.CO
收藏

关于All-or-Nothing变换的安全性

On Security Properties of All-or-nothing Transforms

Navid Nasr Esfahani, Douglas R. Stinson

摘要:

全有或全无变换被定义为在指定的有限字母表上的所有s-元组上的双射映射。这些映射需要满足某些“完美安全”条件,这些条件使用定义在输入s元组上的概率分布的熵来指定。或者,已经给出了AONT的纯组合定义,其涉及某些类型的“无偏阵列”。然而,组合定义并不涉及概率定义。在本文中,我们研究了AONT提供的安全性,满足组合定义。AONT的安全性可以取决于s元组的底层概率分布。我们表明,完美的安全性是从AONT当且仅当输入的S-元组是等概率的。然而,在输入的s元组不是等概率的情况下,我们仍然实现了较弱的安全保证。我们还考虑使用随机AONT为较少数量的输入提供完美的安全性,即使这些输入不是等概率的。

英文摘要:

All-or-nothing transforms have been defined as bijective mappings on all s-tuples over a specified finite alphabet. These mappings are required to satisfy certain "perfect security" conditions specified using entropies of the probability distribution defined on the input s-tuples. Alternatively, purely combinatorial definitions of AONTs have been given, which involve certain kinds of "unbiased arrays". However, the combinatorial definition makes no reference to probability definitions. In this paper, we examine the security provided by AONTs that satisfy the combinatorial definition. The security of the AONT can depend on the underlying probability distribution of the s-tuples. We show that perfect security is obtained from an AONT if and only if the input s-tuples are equiprobable. However, in the case where the input s-tuples are not equiprobable, we still achieve a weaker security guarantee. We also consider the use of randomized AONTs to provide perfect security for a smaller number of inputs, even when those inputs are not equiprobable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑