Cryptology ePrint Archive: Report 2015/1235

Constant-round Leakage-resilient Zero-knowledge from Collision Resistance

Susumu Kiyoshima

Abstract: In this paper, we present a constant-round leakage-resilient zero-knowledge argument system for NP under the assumption of the existence of collision-resistant hash function family. That is, using collision-resistant hash functions, we construct a constant-round zero-knowledge argument system that has the following zero-knowledge property: Even against any cheating verifier that obtains arbitrary amount of leakage on the prover's internal secret state, a simulator can simulate the verifier's view by obtaining the same amount of leakage on the witness. Previously, leakage-resilient zero-knowledge proofs/arguments for NP were constructed only under a relaxed security definition (Garg, Jain, and Sahai, CRYPTO'11) or under the DDH assumption (Pandey, TCC'14).

Our leakage-resilient zero-knowledge argument system satisfies an additional property that it is simultaneously leakage-resilient zero-knowledge, meaning that both zero-knowledgeness and soundness hold in the presence of leakage.

Category / Keywords: foundations / zero-knowledge, leakage-resistance

Original Publication (with major differences): IACR-EUROCRYPT-2016

Date: received 27 Dec 2015, last revised 20 Aug 2018

Contact author: kiyoshima susumu at lab ntt co jp

Available format(s): PDF | BibTeX Citation

Note: minor editorial changes

Version: 20180821:045900 (All versions of this report)

Short URL: ia.cr/2015/1235


[ Cryptology ePrint archive ]