Perfect Zero Knowledge Proof System with Five Moves for Random Reducibility
随机归约的五步完美零知识证明系统*

A perfect zero knowledge proof with five moves which doesn't rely on any assumption is constructed in this paper. In this proof system, the prover can have either unlimited or limited computing power.