An LWE-based verifiable threshold secret sharing scheme
S. Karimani, Z. Naghdabadi, T. Eghlidos, M. R. Aref
Sharif University of Technology, Tehran, Iran
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.
lattice based cryptography, learning with errors (LWE) problem, threshold secret sharing, trapdoor function.
PDF file (184 kB)
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
Citation in format AMSBIB
\by S.~Karimani, Z.~Naghdabadi, T.~Eghlidos, M.~R.~Aref
\paper An LWE-based verifiable threshold secret sharing scheme
\jour Mat. Vopr. Kriptogr.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|