Kazuo Ohta

Direct zero knowledge proofs of computational power in five rounds

Zero-knowledge proofs of computational power have been proposed by Yung and others. In this paper, we propose an efficient (direct) and constant round (five round) construction of zero knowledge proofs of computational power. To formulate the classes that can be applied to these efficient protocols, we introduce a class of invulnerable problems, FewPR and FewPRu. We show that any invulnerable problem in FewPR and FewPRu has an efficient and constant round zero knowledge proof of computational power, assuming the existence of a one-way function. We discuss some applications of these zero-knowledge proofs of computational power.