## Cryptology ePrint Archive: Report 2014/634

**Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP**

*Hongda Li, Qihua Niu, Guifang Huang*

**Abstract: **Garg, Jain, and Sahai first consider zero knowledge proofs in the presence of leakage on the local state of the prover, and present a leakage-resilient-zero-knowledge proof system for HC (Hamiltonian Cycle) problem. Their construction is called $(1+\varepsilon)$-leakage-resilient zero-knowledge, for any constant $\varepsilon>0$, because the total length of the leakage the simulator needs is $(1+\varepsilon)$ times as large as that of the leakage received by the verifier. In recent, Pandey provides a constant-round leakage-resilient zero-knowledge argument satisfying the ideal requirement of $\varepsilon=0$. Whether there exist constant round leakage-resilient zero-knowledge arguments of knowledge for all NP languages is an interesting problem. This paper focuses on this problem and presents a constant-round construction of leakage-resilient zero-knowledge arguments of knowledge for the HC problem.

**Category / Keywords: **cryptographic protocols / zero knowledge

**Date: **received 17 Aug 2014, last revised 19 Aug 2014

**Contact author: **lihongda at iie ac cn

**Available format(s): **PDF | BibTeX Citation

**Version: **20140821:010812 (All versions of this report)

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]