Paper 2018/164

An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge

Pavel Hubáček, Alon Rosen, and Margarita Vald


We present an unconditional transformation from any honest-verifier statistical zero-knowledge (HVSZK) protocol to standard SZK that preserves round complexity and efficiency of both the verifier and the prover. This improves over currently known transformations, which either rely on some computational assumptions or introduce significant computational overhead. Our main conceptual contribution is the introduction of instance-dependent SZK proofs for NP, which serve as a building block in our transformation. Instance-dependent SZK for NP can be constructed unconditionally based on instance-dependent commitment schemes of Ong and Vadhan (TCC'08). As an additional contribution, we give a simple constant-round SZK protocol for Statistical-Difference resembling the textbook HVSZK proof of Sahai and Vadhan (J.ACM'03). This yields a conceptually simple constant-round protocol for all of SZK.

Available format(s)
Publication info
Published by the IACR in EUROCRYPT 2018
statistical zero-knowledgehonest-verifier statistical zero-knowledgeinstance-dependent commitment schemes
Contact author(s)
hubacek @ iuuk mff cuni cz
alon rosen @ idc ac il
margarita vald @ cs tau ac il
2018-07-19: revised
2018-02-11: received
See all versions
Short URL
Creative Commons Attribution


      author = {Pavel Hubáček and Alon Rosen and Margarita Vald},
      title = {An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge},
      howpublished = {Cryptology ePrint Archive, Paper 2018/164},
      year = {2018},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.