TY - GEN

T1 - An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge

AU - Hubáček, Pavel

AU - Rosen, Alon

AU - Vald, Margarita

N1 - Publisher Copyright:
© 2018, International Association for Cryptologic Research.

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85045875999&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-78372-7_3

DO - 10.1007/978-3-319-78372-7_3

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85045875999

SN - 9783319783710

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 66

EP - 87

BT - Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings

A2 - Nielsen, Jesper Buus

A2 - Rijmen, Vincent

PB - Springer Verlag

T2 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018

Y2 - 29 April 2018 through 3 May 2018

ER -