Authenticating Grid Using Graph Isomorphism Based Zero Knowledge Proof
A zero-Knowledge proof is a method by which the prover can prove to the verifier that the given statement is valid, without revealing any additional information apart from the veracity of the statement. Zero knowledge protocols have numerous applications in the domain of cryptography; they are commonly used in identification schemes by forcing adversaries to behave according to a predetermined protocol. In this paper, we propose an approach using graph isomorphism based zero knowledge proof to construct an efficient grid authentication mechanism. We demonstrate that using graph isomorphism based zero knowledge proof provide a much higher level of security when compared to other authentication schemes. The betterment of security arises from the fact that the proposed method hides the secret during the entire authentication process. Moreover, it enables one identity to be used for various accounts.
KeywordsZero Knowledge proof zero knowledge protocol graph isomorphism grid authentication grid security graph prover verifier
Unable to display preview. Download preview PDF.
- 1.Foster, I.: The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration. Wiley, Argonne Illinois (2002)Google Scholar
- 2.Daniel, K., Ludek, M., Michal, P.: Survey of Authentication Mechanisms for Grids. In: CESNET Conference, pp. 200–204. Czech Academy of Science Press, Prague (2008)Google Scholar
- 3.Lum, J.: Implementing Zero Knowledge Authentications with Zero Knowledge. In: The Python Papers Monograph Proceedings of PyCon Asia-Pacific, Melbourne (2010)Google Scholar
- 4.Lior, M.: A Study of Perfect Zero-Knowledge Proofs, PhD Dissertation, University of Victoria, British Colombia, Victoria (2008)Google Scholar