Demonstrating Programs against Adversaries
Kouichi Sakurai, Kazuo Iwama · Institutional Repositories DataBase (IRDB) · 1995
Methods of demonstrating correctness of programs without revealillg any computillg process nor computed results are investigated.A protocol to delnonstrate the program to answer whether two given graphs are isomorphic or not, which is secure against adversaries, is presented.Also, a theoretical upper bound OI1 the class of problenls having sucll protocols is given, which suggests the guaranteed security could lower the power of the demonstration systems.Tlle obtained results are based on no assumptions such as the intractability of factoring or the existence of one-way functions.