Very recently, Goyal, Ostrovsky, Scafuro and Visconti [STOC 14] showed an implementation of Barak’s technique that needs only black-box access to a collision-resistant hash-function while still having a non-black-box simulator. (Such a construction is referred to as semi black-box.) Plugging this implementation in the BGGL’s construction yields the first resettably-sound ZK arguments based on black-box use of CRHFs.
However, from the work of Chung, Pass and Seth [STOC 13] and Bitansky and Paneth [STOC13], we know that resettably-sound ZK arguments can be constructed from non-black-box use of any one-way function (OWF), which is the minimal assumption for ZK arguments. Hence, a natural question is whether it is possible to construct resettably-sound zero-knowledge arguments from black-box use of any OWF only. In this work we provide a positive answer to this question thus closing the gap between black-box and non-black-box constructions for resettably-sound ZK arguments.Category / Keywords: foundations / zero knowledge, resettable soundness, black-box construction Date: received 23 Apr 2014, last revised 8 Oct 2014 Contact author: alescafu at gmail com Available format(s): PDF | BibTeX Citation Note: The protocol has been modified to address an issue regarding using signatures based on one-way functions. Version: 20141009:010102 (All versions of this report) Short URL: ia.cr/2014/284 Discussion forum: Show discussion | Start new discussion