Cryptology ePrint Archive: Report 2019/1486

RLWE-based Zero-Knowledge Proofs for linear and multiplicative relations

Ramiro Martínez and Paz Morillo

Abstract: We present efficient Zero-Knowledge Proofs of Knowledge (ZKPoK) for linear and multiplicative relations among secret messages hidden as Ring Learning With Errors (RLWE) samples. Messages are polynomials in $\mathbb{Z}_q[x]/\left<x^{n}+1\right>$ and our proposed protocols for a ZKPoK are based on the celebrated paper by Stern on identification schemes using coding problems (Crypto'93). Our $5$-move protocol achieves a soundness error slightly above $1/2$ and perfect Zero-Knowledge.

As an application we present Zero-Knowledge Proofs of Knowledge of relations between committed messages. The resulting commitment scheme is perfectly binding with overwhelming probability over the choice of the public key, and computationally hiding under the RLWE assumption. Compared with previous Stern-based commitment scheme proofs we decrease computational complexity, improve the size of the parameters and reduce the soundness error of each round.

Category / Keywords: public-key cryptography / zero-knowledge proofs of knowledge, commitment scheme, ring learning with errors

Original Publication (with minor differences): IMACC 2019
DOI:
10.1007/ 978-3-030-35199-1_13

Date: received 26 Dec 2019

Contact author: ramiro martinez at upc edu

Available format(s): PDF | BibTeX Citation

Version: 20191230:193204 (All versions of this report)

Short URL: ia.cr/2019/1486


[ Cryptology ePrint archive ]