摘要： 文中构造了随机归约的一个四步零知识证明协议,该协议没有附加任何复杂性假设和证明者的计算能力假设,适用面广,该协议符合知识和语言的证明系统的完备性,完美零知识性等条件,它不符合知识和语言的证明系统的可靠性定义,但它在实际应用中是可靠的。

关键词: 随机归约, 知识证明系统, 语言证明系统

Abstract: In this paper, We construct a four steps interactive protocol of the random self-reducibility. Which doesn't rely on any complexity assumption or any power of prover. and applies to wider areas. The protocol suits some conditions of the knowledge and the language membershich interactive proof systems such that "completeness" and the "perfect zero knowledge", it doesn't suit the condition of "soundness" in the knowledge and language proof system, but in practice, the protocol is soundness.

中图分类号: 

• TP309.7