Paper 2014/634

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

Hongda Li, Qihua Niu, and 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
zero knowledge
Contact author(s)
lihongda @ iie ac cn
History
2014-08-21: received
Short URL
https://ia.cr/2014/634
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/634,
      author = {Hongda Li and Qihua Niu and Guifang Huang},
      title = {Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP},
      howpublished = {Cryptology ePrint Archive, Paper 2014/634},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/634}},
      url = {https://eprint.iacr.org/2014/634}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.