5Move Statistical Zero Knowledge (Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• We show that, if NP language L has an invulnerable generator and if L has an honest verifier standard statistical ZKIP, then L has a 5 move statistical ZKIP. Our class of languages involves random self reducible languages because they have standard perfect ZKIPs. We show another class of languages (class K) which have standard perfect ZKIPs. Blum numbers and a set of graphs with odd automorphism belong to this class. Therefore, languages in class K have 5 move statistical ZKIPs if they have invulnerable generators.

• 社団法人電子情報通信学会の論文
• 1993-01-25

著者

• Mambo Masahiro

  The Faculty Of Engineering Tokyo Institute Of Technology

• Kurosawa Kaoru

  the Faculty of Engineering, Tokyo Institute of Technology

• Tsujii Shigeo

  the Faculty of Engineering, Tokyo Institute of Technology

• Tsujii Shigeo

  The Faculty Of Engineering Tokyo Institute Of Technology

• Kurosawa Kaoru

  The Faculty Of Engineering Tokyo Institute Of Technology

関連論文

• Communication Complexity of Perfect ZKIP for a Promise Problem (Special Section on Cryptography and Information Security)
• Unsupervised Learning of 3D Objects Conserving Global Topological Order
• 5Move Statistical Zero Knowledge (Special Section on Cryptography and Information Security)

スポンサーリンク