[Resource Topic] 2015/1235: Constant-round Leakage-resilient Zero-knowledge from Collision Resistance

Welcome to the resource topic for 2015/1235

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

Authors: 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.

ePrint: https://eprint.iacr.org/2015/1235

Talk: https://www.youtube.com/watch?v=ejpGI4vYY50

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .