本文研究得到国家自然科学基金资助。
构造了一个完美零知识的五步交互证明系统,该系统不依赖于任何(复杂性和计算能力)假设, 在该系统中,证明者可具有有限或无限的计算能力.
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.
臧斌宇,周玉林,熊鹏荣,朱 洪.随机归约的五步完美零知识证明系统*.软件学报,1999,10(1):81-85
京公网安备 11040202500063号