arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.00089cs.ITmath.IT
收藏

泄漏存储系统中的代数操作检测

Detecting Algebraic Manipulation in Leaky Storage Systems

Fuchun Lin, Reihaneh Safavi-Naini, Pengwei Wang

摘要:

代数操作检测(AMD)代码检测添加到编码消息并存储在对对手不透明的存储中的对抗性噪声。我们研究AMD码时的存储可以泄漏高达ρ \log |G|位的信息的存储码字,其中G是组中存储的码字的生活和ρ是一个常数。我们提出了ρ-AMD码,在这种新的设置提供保护,并定义弱和强ρ-AMD码,提供安全的随机和任意的消息,分别。我们得到具体的和渐近的界限,这些代码的效率具有1-ρ的强码的速率上限。我们还定义了一类ρ^{LV}-AMD码,提供保护时,泄漏是在一个码字分量的数量的形式,并给出了具有强的ρ^{LV}-AMD码,渐近实现率1-ρ的结构。我们描述了ρ-AMD码的应用,(i)鲁棒斜坡秘密共享方案,(ii)窃听II信道时,对手可以窃听的码字分量的ρ分数和篡改的码字的所有组件。

英文摘要:

Algebraic Manipulation Detection (AMD) Codes detect adversarial noise that is added to a coded message and stored in a storage that is opaque to the adversary. We study AMD codes when the storage can leak up to ρ\log|G| bits of information about the stored codeword, where G is the group in which the stored codeword lives and ρis a constant. We propose ρ-AMD codes that provide protection in this new setting, and define weak and strong ρ-AMD codes that provide security for a random and an arbitrary message, respectively. We derive concrete and asymptotic bounds for the efficiency of these codes featuring a rate upper bound of 1-ρfor the strong codes. We also define the class of ρ^{LV}-AMD codes that provide protection when leakage is in the form of a number of codeword components, and give constructions featuring a strong ρ^{LV}-AMD codes that asymptotically achieve the rate 1-ρ. We describe applications of ρ-AMD codes to, (i) robust ramp secret sharing scheme and, (ii) wiretap II channel when the adversary can eavesdrop a ρfraction of codeword components and tamper with all components of the codeword.

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

↑