arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.02788cs.DMcs.CCcs.CRcs.ITmath.IT
收藏

对$\mathbb{F}_p^n$中Sanders-Freiman-Ruzsa定理的再认识及其在不可延展码中的应用

Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes

Divesh Aggarwal, Jop Briët

摘要:

非延展性代码(NMC)保护敏感数据免受禁止错误检测的损坏程度,从而确保损坏的码字正确解码或与原始消息关系不大的内容。分裂状态模型,其中码字由两个块组成,认为对手篡改任意块,但独立于其他。由于Aggarwal,Dodis和Lovett(STOC'14),该模型中最简单的结构被证明可以将发送k位消息的NMC发送到$O(k^7)$位码字。然而,需要说明的是,该构造允许线性长度码字。为了解决这个猜想,我们表明,建设允许码长$O(k^5)$。这是通过分析桑德斯的Bogolyubov-Ruzsa定理一般阿贝尔群的一个特殊情况。紧接着Lovett对群$\mathbb{F}_2^n$的这个结果的出色的阐述,我们揭示了它对群$\mathbb{F}_p^n$的$p$的依赖性,其中$p$是素数。

英文摘要:

Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead that a corrupted codeword decodes correctly or to something that bears little relation to the original message. The split-state model, in which codewords consist of two blocks, considers adversaries who tamper with either block arbitrarily but independently of the other. The simplest construction in this model, due to Aggarwal, Dodis, and Lovett (STOC'14), was shown to give NMCs sending k-bit messages to $O(k^7)$-bit codewords. It is conjectured, however, that the construction allows linear-length codewords. Towards resolving this conjecture, we show that the construction allows for code-length $O(k^5)$. This is achieved by analysing a special case of Sanders's Bogolyubov-Ruzsa theorem for general Abelian groups. Closely following the excellent exposition of this result for the group $\mathbb{F}_2^n$ by Lovett, we expose its dependence on $p$ for the group $\mathbb{F}_p^n$, where $p$ is a prime.

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

↑