Mostra el registre d'ítem simple
RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations
dc.contributor.author | Martínez Pinilla, Ramiro |
dc.contributor.author | Morillo Bosch, M. Paz |
dc.contributor.other | Universitat Politècnica de Catalunya. Doctorat en Matemàtica Aplicada |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2020-01-28T18:36:21Z |
dc.date.issued | 2019 |
dc.identifier.citation | Martinez, R.; Morillo, M. RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations. A: IMA Conference on Cryptography and Coding. "Cryptography and Coding: 17th IMA International Conference, IMACC 2019, Oxford, UK, December 16–18, 2019, Proceedings". Springer International Publishing, 2019, p. 252-277. |
dc.identifier.isbn | 978-3-030-35198-4 |
dc.identifier.other | https://eprint.iacr.org/2019/1486 |
dc.identifier.uri | http://hdl.handle.net/2117/175977 |
dc.description.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-moves 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 for a commitment scheme 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. |
dc.format.extent | 26 p. |
dc.language.iso | eng |
dc.publisher | Springer International Publishing |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Cryptography |
dc.subject.lcsh | Data encryption (Computer science) |
dc.subject.other | Zero-knowledge proofs of knowledge |
dc.subject.other | Commitment scheme |
dc.subject.other | Ring learning with errors |
dc.title | RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations |
dc.type | Conference report |
dc.subject.lemac | Criptografia |
dc.subject.lemac | Xifratge (Informàtica) |
dc.contributor.group | Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia |
dc.identifier.doi | 10.1007/978-3-030-35199-1_13 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://link.springer.com/chapter/10.1007/978-3-030-35199-1_13 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 26600536 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Martinez, R.; Morillo, M. |
local.citation.contributor | IMA Conference on Cryptography and Coding |
local.citation.publicationName | Cryptography and Coding: 17th IMA International Conference, IMACC 2019, Oxford, UK, December 16–18, 2019, Proceedings |
local.citation.startingPage | 252 |
local.citation.endingPage | 277 |