R-LWE-Based distributed key generation and threshold decryption

Ever since the appearance of quantum computers, prime factoring and discrete logarithm based cryptography has been put in question, giving birth to the so called post-quantum cryptography. The most prominent field in post-quantum cryptography is lattice-based cryptography, protocols that are proved...

Descripción completa

Detalles Bibliográficos
Autores: Alborch Escobar, Ferran, Martínez Pinilla, Ramiro|||0000-0003-0496-6462, Morillo Bosch, M. Paz|||0000-0002-0063-2716
Tipo de recurso: artículo
Fecha de publicación:2022
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/363312
Acceso en línea:https://hdl.handle.net/2117/363312
https://dx.doi.org/10.3390/math10050728
Access Level:acceso abierto
Palabra clave:Information theory
Coding theory
Post-Quantum cryptography
Threshold cryptography
Lattices
Ring learning with errors (RLWE)
RLWE encryption
Codificació, Teoria de la
Informació, Teoria de la
Criptografia
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
Àrees temàtiques de la UPC::Matemàtiques i estadística
Descripción
Sumario:Ever since the appearance of quantum computers, prime factoring and discrete logarithm based cryptography has been put in question, giving birth to the so called post-quantum cryptography. The most prominent field in post-quantum cryptography is lattice-based cryptography, protocols that are proved to be as difficult to break as certain difficult lattice problems like Learning With Errors (LWE) or Ring Learning With Errors (RLWE). Furthermore, the application of cryptographic techniques to different areas, like electronic voting, has also seen to a great interest in distributed cryptography. In this work we will give two original threshold protocols based in the lattice problem RLWE: one for key generation and one for decryption. We will prove them both correct and secure under the assumption of hardness of some well-known lattice problems and we will give a rough implementation of the protocols in C to give some tentative results about their viability.