Paper 2021/1694
RLWE-based distributed key generation and threshold decryption
, Universitat Politècnica de Catalunya, Universitat Politècnica de Catalunya, Universitat Politècnica de CatalunyaAbstract
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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Mathematics 2022, 10(5), 728;
- DOI
- 10.3390/math10050728
- Keywords
- Post-Quantum CryptographyThreshold CryptographyLatticesRing Learning With Errors (RLWE)RLWE Encryption
- Contact author(s)
-
ferran alborch @ gmail com
ramiro martinez @ upc edu
paz morillo @ upc edu - History
- 2024-03-15: revised
- 2021-12-30: received
- See all versions
- Short URL
- https://ia.cr/2021/1694
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1694,
author = {Ferran Alborch and Ramiro Martínez and Paz Morillo},
title = {{RLWE}-based distributed key generation and threshold decryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1694},
year = {2021},
doi = {10.3390/math10050728},
url = {https://eprint.iacr.org/2021/1694}
}
