DocumentCode :
2147098
Title :
Zero-knowledge proof protocol of the isomorphism of graphs
Author :
Bao-An, Guo ; Lu Kai-cheng
Author_Institution :
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
Volume :
2
fYear :
1996
fDate :
5-7 May 1996
Firstpage :
1092
Abstract :
The discussion of the zero knowledge-proof protocol of the nonisomorphism of graphs (GNI) has appeared in many papers, but they are not complete zero-knowledge proof protocols at all. We will propose a complete zero-knowledge proof protocol, it implies that it is very difficult to design a secure zero-knowledge interactive proof protocols
Keywords :
graph theory; graph isomorphism; graph nonisomorphism; secure interactive proof protocols; zero knowledge proof protocol; Polynomials; Probability; Protocols; Testing; Turing machines; Waste materials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Technology Proceedings, 1996. ICCT'96., 1996 International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-2916-3
Type :
conf
DOI :
10.1109/ICCT.1996.545073
Filename :
545073
Link To Document :
بازگشت