arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.09442cs.CR
收藏

纠正被颠覆的随机预言机

Correcting Subverted Random Oracles

Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou, Jiadong Zhu

AI总结:

针对被颠覆或故障的随机预言机的可靠性问题,本文提出一种简单构造方法,可将小部分输入异常的被颠覆随机预言机转换为与随机函数不可区分的对象,即便敌手知晓转换随机数也有效,为窃密密码场景下的密码原语设计提供了可信黑盒基础。

摘要:

随机预言机方法论已被证明是设计和分析密码方案的有力工具。本文聚焦于纠正存在故障或被敌手破坏的随机预言机这一基础问题,使其能可靠地用于此类密码场景。我们证明,一种简单构造可将在小部分输入上与原始随机预言机不一致的“被颠覆”随机预言机,转换为与随机函数不可区分的对象,即便敌手知晓转换过程中使用的所有随机数也依然成立。我们的研究结果使得未来在典型窃密密码设置(即允许敌手颠覆或替换基础密码算法的场景)中设计密码原语的研究者,能够将随机预言机用作可信黑盒。

英文摘要:

The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes. In this paper, we focus on the basic problem of correcting faulty or adversarially corrupted random oracles, so that they can be confidently applied for such cryptographic purposes. We prove that a simple construction can transform a "subverted" random oracle which disagrees with the original one at a small fraction of inputs into an object that is indifferentiable from a random function, even if the adversary is made aware of all randomness used in the transformation. Our results permit future designers of cryptographic primitives in typical kleptographic settings (i.e., those permitting adversaries that subvert or replace basic cryptographic algorithms) to use random oracles as a trusted black box.

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

↑