NobleBlocks
Public

How to share a secret

Published in Communications of the ACM • Nov 1, 1979
NobleIDNI1P37W35R02S62
Authors:
Adi Shamir

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 cryptographi...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!