Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation.
Kai-Min Chung, Huijia Lin, Rafael Pass · IACR Cryptology ePrint Archive · 2014
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations, and indistinguishability obfuscators for P/poly (with slightly super-polynomial security). ∗Academia Sinica, [email protected] †University of California, Santa Barbara, [email protected]. ‡Cornell University, [email protected]. Work supported in part by a Alfred P. Sloan Fellowship, Microsoft New Faculty Fellowship, NSF Award CNS-1217821, NSF CAREER Award CCF-0746990, NSF Award CCF-1214844, AFOSR YIP Award FA9550-10-1-0093, and DARPA and AFRL under contract FA8750-11-2-0211. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government.