An Overview of the Hybrid Argument An Excerpt From: The Theory of Hash Functions and Random Oracles—An Approach to Modern Cryptography
An Overview of the Hybrid Argument An Excerpt From: The Theory of Hash Functions and Random Oracles—An Approach to Modern Cryptography
复制标题
混合论证概述摘自：哈希函数和随机预言的理论 - 现代密码学的一种方法
DOI：
--
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Arno Mittelbach
中科院分区：
文献类型：
--
作者：
M. Fischlin;Arno Mittelbach
。在加密文献中，混合论证并不总是像我们所说的那样简单，而是随之而来的复杂性。 0。对于不断的t，我们将一般t的通用方法转化为严格的陈述。现代密码学的方法（信息安全和密码学，施普林格，2021年），对我们认为，我们认为更广泛的加密社区感兴趣的混合论证的复杂性。
. The hybrid argument is a fundamental and well-established proof technique of modern cryptography for showing the indistinguishability of distributions. As such, its details are often glossed over and phrases along the line of “this can be proven via a standard hybrid argument” are common in the cryptographic literature. Yet, the hybrid argument is not always as straightforward as we make it out to be, but instead comes with its share of intricacies. For example, a commonly stated variant says that if one has a sequence of hybrids H 0 , . . . , H t , and each pair H i , H i +1 is computationally indistinguishable, then so are the extreme hybrids H 0 and H t . We iterate the fact that, in this form, the statement is only true for constant t , and we translate the common approach for general t into a rigorous statement. The paper here is not a research paper in the traditional sense. It mainly consists of an excerpt from the book The Theory of Hash Functions and Random Oracles—An Approach to Modern Cryptography (Information Security and Cryptography, Springer, 2021), providing a detailed discussion of the intricacies of the hybrid argument that we believe is of interest to the broader cryptographic community. The excerpt is reproduced with permission of Springer.