Affiliation:
1. Massachusetts Institute of Technology, Cambridge
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
8020 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献