持续的空间复杂度
Sustained Space Complexity
摘要:
记忆困难函数(MHF)是指其计算成本主要由记忆成本决定的函数。MHF是平等主义的,因为在专用硬件(如FPGA或ASIC)上评估它们并不比在现成的硬件(如x86 CPU)上便宜多少。MHF具有有趣的加密应用,最值得注意的是密码哈希和保护区块链。Alwen和Serbinenko [STOC'15]将函数的累积内存复杂度(cmc)定义为计算函数所需内存量的总和(在所有时间步长上)。他们主张一个好的MHF必须具有高cmc。与以前的概念不同,cmc考虑到专用硬件可能会利用摊销和并行性。尽管如此,cmc仍然被批评为不足,因为它未能捕捉到可能的时间-内存权衡,因为内存成本不会线性缩放,具有相同cmc的函数仍然可能具有非常不同的实际硬件成本。在这项工作中,我们解决这个问题,并引入持续内存复杂性的概念,这要求任何算法评估的功能必须使用大量的内存为许多步骤。我们构造函数(在并行随机预言机模型中),其持续的内存复杂度几乎是最优的:我们的函数可以使用$n$步骤和$O(n/\log(n))$内存进行评估,在每个步骤中对(固定输入长度)随机预言机进行一次查询,而任何可以对随机预言机进行任意多个并行查询的算法,仍然需要$Ω(n/\log(n))$内存进行$Ω(n)$步骤。我们的主要技术贡献是在$n$节点上构建一个DAG家族,具有高“持续空间复杂度“的恒定深度,这意味着任何并行黑卵石策略至少需要$Ω(n)$步骤的$Ω(n/\log(n))$卵石。
英文摘要:
Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware (like x86 CPUs). MHFs have interesting cryptographic applications, most notably to password hashing and securing blockchains. Alwen and Serbinenko [STOC'15] define the cumulative memory complexity (cmc) of a function as the sum (over all time-steps) of the amount of memory required to compute the function. They advocate that a good MHF must have high cmc. Unlike previous notions, cmc takes into account that dedicated hardware might exploit amortization and parallelism. Still, cmc has been critizised as insufficient, as it fails to capture possible time-memory trade-offs, as memory cost doesn't scale linearly, functions with the same cmc could still have very different actual hardware cost. In this work we address this problem, and introduce the notion of sustained-memory complexity, which requires that any algorithm evaluating the function must use a large amount of memory for many steps. We construct functions (in the parallel random oracle model) whose sustained-memory complexity is almost optimal: our function can be evaluated using $n$ steps and $O(n/\log(n))$ memory, in each step making one query to the (fixed-input length) random oracle, while any algorithm that can make arbitrary many parallel queries to the random oracle, still needs $Ω(n/\log(n))$ memory for $Ω(n)$ steps. Our main technical contribution is the construction is a family of DAGs on $n$ nodes with constant indegree with high "sustained-space complexity", meaning that any parallel black-pebbling strategy requires $Ω(n/\log(n))$ pebbles for at least $Ω(n)$ steps.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。