-
- Adi Shamir
- Massachusetts Institute of Technology, Cambridge
抄録
<jats:p> In this paper we show how to divide data <jats:italic>D</jats:italic> into <jats:italic>n</jats:italic> pieces in such a way that <jats:italic>D</jats:italic> is easily reconstructable from any <jats:italic>k</jats:italic> pieces, but even complete knowledge of <jats:italic>k</jats:italic> - 1 pieces reveals absolutely no information about <jats:italic>D</jats:italic> . 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. </jats:p>
収録刊行物
-
- Communications of the ACM
-
Communications of the ACM 22 (11), 612-613, 1979-11
Association for Computing Machinery (ACM)
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1362825895537767808
-
- NII論文ID
- 80014106944
-
- ISSN
- 15577317
- 00010782
- http://id.crossref.org/issn/00010782
-
- データソース種別
-
- Crossref
- CiNii Articles