arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.5069cs.CRcs.ITmath.IT
收藏

无单向功能的Secretary

Secrecy without one-way functions

Dima Grigoriev, Vladimir Shpilrain

摘要:

我们表明,信息安全中的一些问题可以解决,而不使用单向函数。后者通常被认为是密码学的核心概念,但单向函数的存在依赖于复杂性理论中的困难假设,最著名的是臭名昭著的“$P \ne NP$“猜想。在本文中,我们建议协议的安全计算的总和,产品,以及其他一些功能,而不使用任何单向功能。我们在这里提供的一个新的输入是,与其他建议相比,我们隐藏了计算的“中间结果”。例如,当我们计算$k$数的和时,只有最终结果是各方知道的;部分和是任何人都不知道的。我们的方法的其他应用包括投票/评级不安全的渠道和一个相当优雅和有效的解决方案姚的“百万富翁的问题”。然后,虽然这是相当明显的,双方之间的安全(位)承诺是不可能的,没有单向函数,我们表明,这是可能的,如果双方的数量至少是3。我们还展示了如何我们的(位)承诺方案为3方可以用来安排一个无条件安全(位)承诺之间只有两个缔约方,如果他们使用一个“哑”(例如,计算机)作为第三方。我们解释了我们的“虚拟”的概念是如何从一个众所周知的“可信第三方”的概念不同。我们还提出了一个协议,不使用单向函数,为“心理扑克”,即,远距离的公平发牌。我们还提出了一个秘密共享计划的优势,沙米尔和其他已知的秘密共享计划是,没有人,包括经销商,最终知道任何特定的球员所拥有的股份。应该提到的是,我们的协议的计算成本可以忽略不计,所有这些都可以在没有计算机的情况下执行。

英文摘要:

We show that some problems in information security can be solved without using one-way functions. The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult conjectures in complexity theory, most notably on the notorious "$P \ne NP$" conjecture. In this paper, we suggest protocols for secure computation of the sum, product, and some other functions, without using any one-way functions. A new input that we offer here is that, in contrast with other proposals, we conceal "intermediate results" of a computation. For example, when we compute the sum of $k$ numbers, only the final result is known to the parties; partial sums are not known to anybody. Other applications of our method include voting/rating over insecure channels and a rather elegant and efficient solution of Yao's "millionaires' problem". Then, while it is fairly obvious that a secure (bit) commitment between two parties is impossible without a one-way function, we show that it is possible if the number of parties is at least 3. We also show how our (bit) commitment scheme for 3 parties can be used to arrange an unconditionally secure (bit) commitment between just two parties if they use a "dummy" (e.g., a computer) as the third party. We explain how our concept of a "dummy" is different from a well-known concept of a "trusted third party". We also suggest a protocol, without using a one-way function, for "mental poker", i.e., a fair card dealing (and playing) over distance. We also propose a secret sharing scheme where an advantage over Shamir's and other known secret sharing schemes is that nobody, including the dealer, ends up knowing the shares owned by any particular player. It should be mentioned that computational cost of our protocols is negligible to the point that all of them can be executed without a computer.

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

↑