How to share a secret Export

@article{citeulike:579841, 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.}, address = {New York, NY, USA}, author = {Shamir, Adi}, citeulike-article-id = {579841}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=359176}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/359168.359176}, doi = {10.1145/359168.359176}, issn = {0001-0782}, journal = {Commun. ACM}, keywords = {cryptography, key-management, security}, month = {November}, number = {11}, pages = {612--613}, posted-at = {2009-05-14 09:16:54}, priority = {2}, publisher = {ACM}, title = {How to share a secret}, url = {http://dx.doi.org/10.1145/359168.359176}, volume = {22}, year = {1979} }

TY - JOUR ID - citeulike:579841 L3 - citeulike-article-id:579841 N2 - 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. IS - 11 JF - Commun. ACM SN - 0001-0782 AD - New York, NY, USA EP - 613 TI - How to share a secret PB - ACM VL - 22 SP - 612 KW - cryptography KW - key-management KW - security AU - Shamir, Adi PY - 1979/11// UR - http://dx.doi.org/10.1145/359168.359176 ER -