How to share a secret:
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Lab. for Computer Science
1979
|
| Subjects: | |
| Summary: | 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. (Author). |
| Physical Description: | 7 S. |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021875960 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880223s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227410400 | ||
| 035 | |a (DE-599)BVBBV021875960 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-134 | ||
| 100 | 1 | |a Šāmîr, ʿAdî |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a How to share a secret |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Lab. for Computer Science |c 1979 | |
| 300 | |a 7 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a 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. (Author). | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Coding |2 dtict | |
| 650 | 7 | |a Combinatorial analysis |2 dtict | |
| 650 | 7 | |a Cryptography |2 dtict | |
| 650 | 7 | |a Interpolation |2 dtict | |
| 650 | 7 | |a Non-radio Communications |2 scgdst | |
| 650 | 7 | |a Polynomials |2 dtict | |
| 650 | 7 | |a Secure communications |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 650 | 0 | 7 | |a Kryptologie |0 (DE-588)4033329-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kryptologie |0 (DE-588)4033329-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091602 | ||
Record in the Search Index
| _version_ | 1804135815369981952 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Šāmîr, ʿAdî |
| author_facet | Šāmîr, ʿAdî |
| author_role | aut |
| author_sort | Šāmîr, ʿAdî |
| author_variant | ʿ š ʿš |
| building | Verbundindex |
| bvnumber | BV021875960 |
| ctrlnum | (OCoLC)227410400 (DE-599)BVBBV021875960 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01674nam a2200409zc 4500</leader><controlfield tag="001">BV021875960</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880223s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227410400</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021875960</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-134</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Šāmîr, ʿAdî</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">How to share a secret</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Lab. for Computer Science</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Coding</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial analysis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Cryptography</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Interpolation</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Non-radio Communications</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Polynomials</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Secure communications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091602</subfield></datafield></record></collection> |
| id | DE-604.BV021875960 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:35Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091602 |
| oclc_num | 227410400 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 7 S. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| publisher | Massachusetts Inst. of Technology, Lab. for Computer Science |
| record_format | marc |
| spelling | Šāmîr, ʿAdî Verfasser aut How to share a secret Cambridge, Mass. Massachusetts Inst. of Technology, Lab. for Computer Science 1979 7 S. txt rdacontent n rdamedia nc rdacarrier 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. (Author). Algorithms dtict Coding dtict Combinatorial analysis dtict Cryptography dtict Interpolation dtict Non-radio Communications scgdst Polynomials dtict Secure communications dtict Theoretical Mathematics scgdst Kryptologie (DE-588)4033329-2 gnd rswk-swf Kryptologie (DE-588)4033329-2 s DE-604 |
| spellingShingle | Šāmîr, ʿAdî How to share a secret Algorithms dtict Coding dtict Combinatorial analysis dtict Cryptography dtict Interpolation dtict Non-radio Communications scgdst Polynomials dtict Secure communications dtict Theoretical Mathematics scgdst Kryptologie (DE-588)4033329-2 gnd |
| subject_GND | (DE-588)4033329-2 |
| title | How to share a secret |
| title_auth | How to share a secret |
| title_exact_search | How to share a secret |
| title_exact_search_txtP | How to share a secret |
| title_full | How to share a secret |
| title_fullStr | How to share a secret |
| title_full_unstemmed | How to share a secret |
| title_short | How to share a secret |
| title_sort | how to share a secret |
| topic | Algorithms dtict Coding dtict Combinatorial analysis dtict Cryptography dtict Interpolation dtict Non-radio Communications scgdst Polynomials dtict Secure communications dtict Theoretical Mathematics scgdst Kryptologie (DE-588)4033329-2 gnd |
| topic_facet | Algorithms Coding Combinatorial analysis Cryptography Interpolation Non-radio Communications Polynomials Secure communications Theoretical Mathematics Kryptologie |
| work_keys_str_mv | AT samirʿadi howtoshareasecret |