CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search Non-interactive zero-knowledge proofs are a variant of zero-knowledge proofs in which no interaction is necessary between prover and verifier. Blum , Feldman, and Micali [1] showed that a common reference string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction. Goldreich and Oren [2] gave impossibility results for one shot zero-knowledge protocols in the standard model . In 2003, Goldwasser and Kalai published an instance of an identification scheme for which any hash function will yield an insecure digital signature scheme. [3] These results are not contradictory, as the impossibility result of Goldreich and Oren does not hold in the common reference string model or the random oracle model . Non-interactive zero-know...