IACR News item: 17 December 2014
Kai-Min Chung, Huijia Lin, Rafael Pass
ePrint Report
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).
Additional news items may be found on the IACR news page.