基于单向函数的完全隐藏承诺方案的构造及应用

Construction and Application of Perfectly Hiding Commitment Scheme Based on One-way Function

承诺方案是密码学领域中一种极其重要的协议,而完全隐藏的承诺方案是承诺方案中最难构造的.在本文。我们基于1-1的单向函数(即单向置换)构造了该类承诺方案,尤其重要的是,它仅仅只需要2轮交换复杂性.基于我们的承诺方案,我们能优化零知识证明系统的构造.

Commitment scheme is an important primitive in cryptology field, and construction of perfectly hiding commitment scheme is the most difficult among all commitment schemes. In this paper, we firstly construct a perfectly hiding commitment based on 1-1 one-way function （i.e., one-way permutation）, especially, it only needs two-round complexity. We will improve constructions of zero-knowledge systems based on our perfectly hiding commitment.