R-LWE-Based distributed key generation and threshold decryption
Visualitza/Obre
Cita com:
hdl:2117/363312
Tipus de documentArticle
Data publicació2022-02-25
EditorMultidisciplinary Digital Publishing Institute (MDPI)
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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.
CitacióAlborch, F.; Martinez, R.; Morillo, M. R-LWE-Based distributed key generation and threshold decryption. "Mathematics", 25 Febrer 2022, vol. 10, núm. 5, p. 728:1-728:31.
ISSN2227-7390
Versió de l'editorhttps://www.mdpi.com/2227-7390/10/5/728
Altres identificadorshttps://eprint.iacr.org/2021/1694
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
mathematics-10-00728-v2.pdf | Artículo principal | 445,8Kb | Visualitza/Obre |