We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP witness. Moreover,â€¦ (More)

2006 47th Annual IEEE Symposium on Foundations ofâ€¦

2006

We show that every language in NP has a statistical zero-knowledge argument system under the (minimal) complexity assumption that one-way functions exist. In such protocols, even a computationallyâ€¦ (More)

We give a construction of statistically hiding commitment schemes (those in which the hiding property holds against even computationally unbounded adversaries) under the minimal complexity assumptionâ€¦ (More)

Goldreich and Lindell (CRYPTO â€™01) recently presented the first protocol for password-authenticated key exchange in the standard model (with no common reference string or set-up assumptions otherâ€¦ (More)

We consider the problem of password-authenticated key exchange (PAK) also known as session-key generation using passwords: constructing session-key generation protocols that are secure against activeâ€¦ (More)