Cryptology ePrint Archive: Report 2015/067

An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting

Susumu Kiyoshima

Abstract: We give a new proof of the existence of public-coin concurrent zero-knowledge arguments for NP in the plain model under the existence of collision-resistant hash function families, which was originally proven by Goyal (STOC'13). In the proof, we use a new variant of the non-black-box simulation technique of Barak (FOCS'01). An important property of our simulation technique is that the simulator runs in a straight-line manner in the fully concurrent setting. Compared with the simulation technique of Goyal, which also has such a property, the analysis of our simulation technique is (arguably) simpler.

Category / Keywords: foundations / concurrent zero-knowledge, non-black-box simulation

Original Publication (with major differences): IACR-TCC-2015

Date: received 29 Jan 2015, last revised 17 Dec 2015

Contact author: kiyoshima susumu at lab ntt co jp

Available format(s): PDF | BibTeX Citation

Note: Proofs are modified so that the existence of one-to-one one-way functions can be removed from the assumptions.

Version: 20151218:021158 (All versions of this report)

Short URL: ia.cr/2015/067

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]