Cryptology ePrint Archive: Report 2017/922

On the impossibility of entropy reversal, and its application to zero-knowledge proofs

Shachar Lovett and Jiapeng Zhang

Abstract: Zero knowledge proof systems have been widely studied in cryptography. In the statistical setting, two classes of proof systems studied are Statistical Zero Knowledge (SZK) and Non-Interactive Statistical Zero Knowledge (NISZK), where the difference is that in NISZK only very limited communication is allowed between the verifier and the prover. It is an open problem whether these two classes are in fact equal. In this paper, we rule out efficient black box reductions between SZK and NISZK.

We achieve this by studying algorithms which can reverse the entropy of a function. The problem of estimating the entropy of a circuit is complete for NISZK. Hence, reversing the entropy of a function is equivalent to a black box reduction of NISZK to its complement, which is known to be equivalent to a black box reduction of SZK to NISZK [Goldreich et al, CRYPTO 1999]. We show that any such black box algorithm incurs an exponential loss of parameters, and hence cannot be implemented efficiently.

Category / Keywords: statistical zero-knowledge proof, entropy reversal, black-box reduction

Original Publication (in the same form): IACR-TCC-2017

Date: received 21 Sep 2017

Contact author: slovett at cs ucsd edu, jpeng zhang@gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170924:224210 (All versions of this report)

Short URL: ia.cr/2017/922

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]