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

人类计算的复杂性:一个具体模型及其在密码中的应用

The Complexity of Human Computation: A Concrete Model with an Application to Passwords

Manuel Blum, Santosh Vempala

摘要:

人类能在头脑中计算什么?我们正在考虑各种加密协议,游戏,如数独,填字游戏,速度国际象棋等。本文的目的是应用理论计算机科学的思想和方法,以更好地了解人类可以在他们的头上计算。例如,一个人能否在头脑中计算一个函数,这样一个拥有强大计算机的窃听者--他看到了对随机输入的反应--仍然不能推断出对新输入的反应?为了解决这些问题,我们提出了一个严格的人类计算模型和相关的复杂性措施。我们首先将模型和度量应用于(1)人类可计算的密码生成问题,然后考虑(2)人类可计算的“单向函数”和(3)人类可计算的“伪随机生成器”的相关问题。这里开发的人类可计算性理论与标准可计算性的规则不同,这需要一些时间来适应。由于需要说明的原因,现代可计算性理论的多项式与指数时间划分与人类计算无关。在人类的可计算性中,人类和计算机的步数必须更加具体。具体来说,我们将对手限制在最多10^24(阿伏加德罗数)步。这项工作的另一种观点是,它涉及的分析算法和计数步骤的情况下,输入是小的,而不是通常的情况下,输入大的限制。

英文摘要:

What can humans compute in their heads? We are thinking of a variety of Crypto Protocols, games like Sudoku, Crossword Puzzles, Speed Chess, and so on. The intent of this paper is to apply the ideas and methods of theoretical computer science to better understand what humans can compute in their heads. For example, can a person compute a function in their head so that an eavesdropper with a powerful computer --- who sees the responses to random input --- still cannot infer responses to new inputs? To address such questions, we propose a rigorous model of human computation and associated measures of complexity. We apply the model and measures first and foremost to the problem of (1) humanly computable password generation, and then consider related problems of (2) humanly computable "one-way functions" and (3) humanly computable "pseudorandom generators". The theory of Human Computability developed here plays by different rules than standard computability, and this takes some getting used to. For reasons to be made clear, the polynomial versus exponential time divide of modern computability theory is irrelevant to human computation. In human computability, the step-counts for both humans and computers must be more concrete. Specifically, we restrict the adversary to at most 10^24 (Avogadro number of) steps. An alternate view of this work is that it deals with the analysis of algorithms and counting steps for the case that inputs are small as opposed to the usual case of inputs large-in-the-limit.

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

↑