1983 | OriginalPaper | Chapter
Key Reconstruction
Author : Michael Merritt
Published in: Advances in Cryptology
Publisher: Springer US
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The key reconstruction problem is an application of (n,t)-threshold schemes. Such schemes permit an arbitrary piece of information to be ‘broken’ into n different ‘fragments,’ any t of which may be used to completely reconstruct the original information. No smaller number of fragments provides any information concerning the original, aside from its size in bits. These n fragments may then be distributed to different individuals, any t of whom can later cooperate in the reconstruction of the original information. For our purposes, the original information might be a private key in a public key cryptosystem.