Zeroknowledge authentication using discrete log
Zero Knowledge Authentication Scheme based on
Discrete Log
Vineeth Pillai
Department of Computer Science, Illinois Institute of Technology, Chicago, USA vipillai@hawk.iit.edu, CWID: A20260824
April 26, 2012
Abstract: This paper details a variant of the parallel version of zero knowledge proof of identity which tries to optimize the space usage and number of iteration by not sacrificing the soundness factor. This protocol could a suitable candidate for smart card based authentication schemes where the smart card is usually inferior to the authentication unit in terms of processing power, storage capacity and communication infrastructure. The paper is basically research in nature, where the proposed protocol is analysed in terms of the definitions of a zero knowledge proof of identity. Also, a similar protocol (Ohta-Okamoto) is considered for comparison with respect to processing time, space usage and also network usage.
Keywords— Zero Knowledge proofs of identity, interactive proofs, discrete log, ohta-okamoto, Schnorr’s protocol
I. INTRODUCTION
Zero Knowledge proof was introduced by GoldWasser, Micali and Rackoff in 1982 in the paper generally called as GMR[1] which appeared in FOCS 85. The basic idea of Zero
Knowledge is to prove the possession of some knowledge to a verifier without letting the verifier know anything about the knowledge. In other words Zero knowledge proofs are
Interactive proofs that reveal nothing but the validity of assertion being proven.
Zero knowledge proof exists for any NP-set provided that one-way functions exist. As a result, zero knowledge proofs turns out to be of great importance in the design and implementation of cryptographic protocols. The various entities involved in a Zero Knowledge proof are - Prover and
Verifier. Prover has some information or knowledge that he/she wants to prove to Verifier. There can also be malicious interventions who try to intercept the communication between
Discrete Log
Vineeth Pillai
Department of Computer Science, Illinois Institute of Technology, Chicago, USA vipillai@hawk.iit.edu, CWID: A20260824
April 26, 2012
Abstract: This paper details a variant of the parallel version of zero knowledge proof of identity which tries to optimize the space usage and number of iteration by not sacrificing the soundness factor. This protocol could a suitable candidate for smart card based authentication schemes where the smart card is usually inferior to the authentication unit in terms of processing power, storage capacity and communication infrastructure. The paper is basically research in nature, where the proposed protocol is analysed in terms of the definitions of a zero knowledge proof of identity. Also, a similar protocol (Ohta-Okamoto) is considered for comparison with respect to processing time, space usage and also network usage.
Keywords— Zero Knowledge proofs of identity, interactive proofs, discrete log, ohta-okamoto, Schnorr’s protocol
I. INTRODUCTION
Zero Knowledge proof was introduced by GoldWasser, Micali and Rackoff in 1982 in the paper generally called as GMR[1] which appeared in FOCS 85. The basic idea of Zero
Knowledge is to prove the possession of some knowledge to a verifier without letting the verifier know anything about the knowledge. In other words Zero knowledge proofs are
Interactive proofs that reveal nothing but the validity of assertion being proven.
Zero knowledge proof exists for any NP-set provided that one-way functions exist. As a result, zero knowledge proofs turns out to be of great importance in the design and implementation of cryptographic protocols. The various entities involved in a Zero Knowledge proof are - Prover and
Verifier. Prover has some information or knowledge that he/she wants to prove to Verifier. There can also be malicious interventions who try to intercept the communication between
References: Symposium on Theory of Computing, 1985. of Computing, 1987.