The Research Based On The Zero Knowledge Discusses About The Graph Questions And The Network Security

Zero knowledge is an extremely useful important character both in famous graphtheory problems, and information security of networks. Especially along with therapid development of computer networks, people's demands of networks security aremore exigent, digital signature, user authentication and digital cash become extremelyimportant.The thesis based on zero knowledge proof, analyses and discusses theapplications both in graph theory problems and security of networks. The main resultsare the followings:Introduces the principle and basic models of the zero knowledge proof.Summarize several kinds of protocol and some different classifications of digitalsignature, user authentication and digital cash.A non-interact zero knowledge proof protocol about the isomorphic of the graphis proposed, based on interact zero knowledge proof protocol about it. Furthermore,interact and non-interact zero knowledge proof protocols about the Hamilton cycleare proposed also.An incomplete zero knowledge character E1Gamal digital signature scheme isproposed based on zero knowledge character RSA digital signature scheme by me. Itdoes some contributions to zero knowledge proof of non-single digital signature.