CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

How to share a secret

by: Adi Shamir
Commun. ACM, Vol. 22, No. 11. (November 1979), pp. 612-613.

X Abstract

In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D . This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.

View the full article here:

ACM, DOI

This article has been bookmarked 19 times, initially on 2006-04-07.

2009-09-07 Group LERSAIS
2009-08-18 User duyguk
2009-06-11 User matteodellamico , 1 note

Seminal work for threshold-based k over n secret sharing. Based on modular-arithmetic polynomials.

2009-06-11 17:24:44
2009-05-14 User henrykploetz
2009-03-11 User josephholsten
2008-11-23 User korth
2008-10-29 User frdr
2008-02-25 User zouzias
2008-02-13 User mahendra_kutare
2008-02-05 User admash
2008-01-16 User pcamacho
2007-11-30 User deitosrafael
2007-10-12 User TPTPTP
2007-09-05 User chiunostra
2007-07-26 User ismailfatih
2007-05-13 User emiliorp , 1 note

076

2007-06-01 18:29:15
2006-09-08 User egh
User yang
2006-04-07 User p2p-sec
Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.