HOW TO SHARE A SECRET

被引：9251

作者：

SHAMIR, A

机构：

[1] Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge

来源：

COMMUNICATIONS OF THE ACM | 1979年 / 22卷 / 11期

关键词：

cryptography; interpolation; key management;

D O I：

10.1145/359168.359176

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. © 1979, ACM. All rights reserved.

引用

页码：612 / 613

页数：2