Zero knowledge proof allows a powerful prover to convince a computationally limited verifier the correctness of computations, without revealing information about the underlying secret data. Zero knowledge proof has found great applications in rising techniques like crypto-currencies and blockchain to ensure data privacy. In this talk, I will present some of our recent work on constructing efficient zero knowledge proof scheme based on interactive proof. I will discuss the techniques to improve the prover time of the doubly-efficient interactive proof scheme proposed by Goldwasser et al. 2015 to optimal, and extend the scheme to be a zero knowledge argument with auxiliary input from the prover efficiently.