Cryptology ePrint Archive: Report 2014/991

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation

Kai-Min Chung and Huijia Lin and Rafael Pass

Abstract: 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).

Category / Keywords: Concurrent ZK, Constant-Round, Indistinguishability Obfuscation

Date: received 11 Dec 2014, last revised 18 Dec 2014

Contact author: rachel lin at cs ucsb edu

Available format(s): PDF | BibTeX Citation

Version: 20141218:133734 (All versions of this report)

Short URL: ia.cr/2014/991

Discussion forum: Show discussion | Start new discussion