Call for Paper - August 2019 Edition
IJCA solicits original research papers for the August 2019 Edition. Last date of manuscript submission is July 20, 2019. Read More

A LWE-Based Secret Sharing Scheme

Print
PDF
Network Security and Cryptography
© 2011 by IJCA Journal
NSC - Number 3
Year of Publication: 2011
Authors:
Adela Georgescu
10.5120/4339-035

Adela Georgescu. Article: A LWE-Based Secret Sharing Scheme. IJCA Special Issue on Network Security and Cryptography NSC(3):27-29, December 2011. Full text available. BibTeX

@article{key:article,
	author = {Adela Georgescu},
	title = {Article: A LWE-Based Secret Sharing Scheme},
	journal = {IJCA Special Issue on Network Security and Cryptography},
	year = {2011},
	volume = {NSC},
	number = {3},
	pages = {27-29},
	month = {December},
	note = {Full text available}
}

Abstract

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.

Reference

  • C. A. Asmuth and J. Bloom. A modular approach to key safeguarding. IEEE Transactions on Information Theory, IT-29(2):208–210, 1983.
  • G. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 Natl. Computer Conf., N.Y., vol. 48, pp. 313-317, 1979.
  • D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert. Bonsai trees, or how to delegate a lattice basis. In EUROCRYPT 2010.
  • 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.
  • 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.
  • 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.
  • C. Peikert, V. Vaikuntanathan, and B. Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554–571. 2008.
  • O. Regev. On lattices, learning with errors, randomlinear codes, and cryptography. Journal of the ACM, 56(6):34, 2009. Preliminary version in STOC’05.
  • O. Regev. The Learning With Errors Problem, Invited survey in CCC 2010.
  • A. Shamir. How to share a secret. Communications of the ACM 22 (1979) 612.