RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2019 Volume 10, Issue 2, Pages 97–106 (Mi mvk287)

This article is cited 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.

UDC: 519.719.2

Received 06.II.2018

Language: English

DOI: 10.4213/mvk287



© Steklov Math. Inst. of RAS, 2025