## Cryptology ePrint Archive: Report 2012/569

**Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications**

*San Ling and Khoa Nguyen and Damien Stehle and Huaxiong Wang*

**Abstract: **In all existing efficient proofs of knowledge of a solution to the infinity norm Inhomogeneous Small Integer Solution ($\mathrm{ISIS}^{\infty}$) problem, the knowledge extractor outputs a solution vector that is only guaranteed to be~$\widetilde{O}(n)$ times longer than the witness possessed by the prover. As a consequence, in many cryptographic schemes that use these proof systems as building blocks, there exists a gap between the hardness of solving the underlying $\mathrm{ISIS}^{\infty}$ problem and the hardness underlying the security reductions. In this paper, we generalize Stern's protocol to obtain two statistical zero-knowledge proofs of knowledge for the $\mathrm{ISIS}^{\infty}$ problem that remove this gap. Our result yields the potential of relying on weaker security assumptions for various lattice-based cryptographic constructions. As applications of our proof system, we introduce a concurrently secure identity-based identification scheme based on the worst-case hardness of the $\mathrm{SIVP}_{\widetilde{O}(n^{1.5})}$ problem (in the $\ell_2$ norm) in general lattices in the random oracle model, and an efficient statistical zero-knowledge proof of plaintext knowledge with small constant gap factor for Regev's encryption scheme.

**Category / Keywords: **Lattice-based cryptography, zero knowledge proof, proof of plaintext knowledge, ISIS problem, ID-based identification

**Original Publication**** (with minor differences): **IACR-PKC-2013

**Date: **received 7 Oct 2012, last revised 12 Jan 2014

**Contact author: **khoantt at ntu edu sg

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

**Version: **20140112:135747 (All versions of this report)

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

[ Cryptology ePrint archive ]