论文标题
从随机排列中的带宽符号函数
Bandwidth-Hard Functions from Random Permutations
论文作者
论文摘要
ASIC哈希发动机专门针对加密哈希的并行计算进行了优化，因此是对哈希功能进行蛮力攻击的自然环境。 ASIC比通用计算机的两个基本优势是区域优势和能源效率。与通用计算机相比，通过降低ASIC的面积优势来解决问题。传统上，在（平行）随机Oracle模型中分析了内存 - 硬性功能。但是，由于内存安全性游戏是多阶段的，因此不适用无关紧要的性能，并且实例化随机甲骨文成为一个非平凡的问题。 Chen和Tessaro（Crypto，2019年）考虑了这个问题，并展示了在记忆力函数的背景下应如何实例化随机甲骨文。由Ren和Devadas引入的带宽功能（TCC 2017）旨在通过降低ASIC的能量优势来提供ASIC抗性。特别是，如果可用的缓存不够大，则通过保证高运行时间成本来提供ASIC电阻，从而提供ASIC电阻。以前，在平行的随机Oracle模型中已经分析了带宽 - 固定功能。在这项工作中，我们展示了如何在带宽函数的背景下使用随机排列来实例化那些随机的口腔。我们的结果是通用的，并且对于任何难以浮标的图形都是有效的。
ASIC hash engines are specifically optimized for parallel computations of cryptographic hashes and thus a natural environment for mounting brute-force attacks on hash functions. Two fundamental advantages of ASICs over general purpose computers are the area advantage and the energy efficiency. The memory-hard functions approach the problem by reducing the area advantage of ASICs compared to general-purpose computers. Traditionally, memory-hard functions have been analyzed in the (parallel) random oracle model. However, as the memory-hard security game is multi-stage, indifferentiability does not apply and instantiating the random oracle becomes a non-trivial problem. Chen and Tessaro (CRYPTO 2019) considered this issue and showed how random oracles should be instantiated in the context of memory-hard functions. The Bandwidth-Hard functions, introduced by Ren and Devadas (TCC 2017), aim to provide ASIC resistance by reducing the energy advantage of ASICs. In particular, bandwidth-hard functions provide ASIC resistance by guaranteeing high run time energy cost if the available cache is not large enough. Previously, bandwidth-hard functions have been analyzed in the parallel random oracle model. In this work, we show how those random oracles can be instantiated using random permutations in the context of bandwidth-hard functions. Our results are generic and valid for any hard-to-pebble graphs.
