CFP last date
20 May 2024
Reseach Article

A LWE-Based Secret Sharing Scheme

Published on December 2011 by Adela Georgescu
Network Security and Cryptography
Foundation of Computer Science USA
NSC - Number 3
December 2011
Authors: Adela Georgescu

Adela Georgescu . A LWE-Based Secret Sharing Scheme. Network Security and Cryptography. NSC, 3 (December 2011), 27-29.

author = { Adela Georgescu },
title = { A LWE-Based Secret Sharing Scheme },
journal = { Network Security and Cryptography },
issue_date = { December 2011 },
volume = { NSC },
number = { 3 },
month = { December },
year = { 2011 },
issn = 0975-8887,
pages = { 27-29 },
numpages = 3,
url = { /specialissues/nsc/number3/4339-spe035t/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Special Issue Article
%1 Network Security and Cryptography
%A Adela Georgescu
%T A LWE-Based Secret Sharing Scheme
%J Network Security and Cryptography
%@ 0975-8887
%N 3
%P 27-29
%D 2011
%I International Journal of Computer Applications

We present a secret sharing scheme whose security can be reduced to the hardness of the Learning With Errors (LWE) problem. This is a strong property since the LWE problem is believed to be very hard, as hard as worst-case lattice problems hence offering security in the quantum world. The scheme has certain technical advantages: it requires only basic operations and it allows sharing several secrets at the same time.

  1. C. A. Asmuth and J. Bloom. A modular approach to key safeguarding. IEEE Transactions on Information Theory, IT-29(2):208–210, 1983.
  2. G. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 Natl. Computer Conf., N.Y., vol. 48, pp. 313-317, 1979.
  3. D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert. Bonsai trees, or how to delegate a lattice basis. In EUROCRYPT 2010.
  4. C. Gentry, C. Peikert, and V. Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Proc. 40th ACM Symp. on Theory of Computing (STOC), pages 197–206. 2008.
  5. H. Krawczyk. Secret sharing made short. In D. R. Stinson, editor, Advances in Cryptology - CRYPTO ’93, volume 773 of Lecture Notes in Computer Science, pages 136–146. Springer-Verlag, 1994.
  6. M. Mignotte. How to share a secret. In T. Beth, editor, Cryptography- Proceedings of the Workshop on Cryptography, Burg Feuerstein, 1982, volume 149 of Lecture Notes in Computer Science, pages 371–375. Springer-Verlag, 1983.
  7. C. Peikert, V. Vaikuntanathan, and B. Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554–571. 2008.
  8. O. Regev. On lattices, learning with errors, randomlinear codes, and cryptography. Journal of the ACM, 56(6):34, 2009. Preliminary version in STOC’05.
  9. O. Regev. The Learning With Errors Problem, Invited survey in CCC 2010.
  10. A. Shamir. How to share a secret. Communications of the ACM 22 (1979) 612.
Index Terms

Computer Science
Information Sciences


secret sharing learning with errors lattices