Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
复制标题
DOI：
10.1137/080725404
复制
发表时间：
2009-09
期刊：
影响因子：
--
通讯作者：
Iftach Haitner;Minh-Huyen Nguyen;Shien Jin Ong;Omer Reingold;S. Vadhan
中科院分区：
文献类型：
--
作者：
Iftach Haitner;Minh-Huyen Nguyen;Shien Jin Ong;Omer Reingold;S. Vadhan
我们给出了一个建设的统计隐藏承诺计划（隐藏属性持有对甚至计算无界的对手）的最小复杂性假设下，单向函数存在。因此，单向函数足以为任何NP语句提供统计零知识参数（即使是计算上无界的对抗性验证者也只知道被证明的断言是真的，并且没有多项式时间的对抗性证明者可以说服验证者虚假陈述）。这些结果解决了Naor等人提出的一个悬而未决的问题[J. Cryptology，11（1998），pp. 87-108]。
We give a construction of statistically hiding commitment schemes (those in which the hiding property holds against even computationally unbounded adversaries) under the minimal complexity assumption that one-way functions exist. Consequently, one-way functions suffice to give statistical zero-knowledge arguments for any NP statement (whereby even a computationally unbounded adversarial verifier learns nothing other than the fact that the assertion being proven is true, and no polynomial-time adversarial prover can convince the verifier of a false statement). These results resolve an open question posed by Naor et al. [J. Cryptology, 11 (1998), pp. 87-108].