|
This article is cited in 3 scientific papers (total in 3 papers)
An LWE-based verifiable threshold secret sharing scheme
S. Karimani, Z. Naghdabadi, T. Eghlidos, M. R. Aref Sharif University of Technology, Tehran, Iran
Abstract:
In this paper we propose a verifiable threshold secret sharing scheme based on learning with errors (LWE) problem, which is the first of its kind, to the best of our knowledge. To produce a trapdoor we use an algorithm suggested by Micciancio and Peikert. Shares are distributed using an LWE-based public-key cryptosystem. It is shown that the computational security is based on the hardness of LWE problem and one-wayness of Ajtai’s function.
Key words:
lattice based cryptography, learning with errors (LWE) problem, threshold secret sharing, trapdoor function.
Received 06.II.2018
Citation:
S. Karimani, Z. Naghdabadi, T. Eghlidos, M. R. Aref, “An LWE-based verifiable threshold secret sharing scheme”, Mat. Vopr. Kriptogr., 10:2 (2019), 97–106
Linking options:
https://www.mathnet.ru/eng/mvk287https://doi.org/10.4213/mvk287 https://www.mathnet.ru/eng/mvk/v10/i2/p97
|
Statistics & downloads: |
Abstract page: | 471 | Full-text PDF : | 155 | References: | 56 | First page: | 15 |
|