Zero-Knowledge Blind Identification For Smart Cards Using Bilinear Pairings.

Abstract

In identification protocols with public verifier coins (like Fiat-Shamir), a passive adversary watching the communication gains information intended only for the verifier. On the other hand, private coin protocols with fewer than three rounds cannot be zero-knowledge. In this paper, we introduce the notion of bounded-prover zero-knowledge proofs which require only two rounds and can be considered perfectly zero-knowledge under certain intractibility assumptions. Specifically, we exploit the gap between two computational problems to achieve zero-knowledge in a dishonest verifier scenario.