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

@article{Li2014ConstantRoundLZ,
  title={Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP},
  author={Hongda Li and Qihua Niu and Guifang Huang},
  journal={IACR Cryptology ePrint Archive},
  year={2014},
  volume={2014},
  pages={634}
}
Garg, Jain, and Sahai first consider zero knowledge proofs in the presence of leakage on the local state of the prover, and present a leakageresilient-zero-knowledge proof system for HC (Hamiltonian Cycle) problem. Their construction is called (1 + ε)-leakage-resilient zero-knowledge, for any constant ε > 0, because the total length of the leakage the simulator needs is (1 + ε) times as large as that of the leakage received by the verifier. In recent, Pandey provides a constant-round leakage… CONTINUE READING