Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this paper
Cite this paper
Merritt, M. (1983). Key Reconstruction. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_33
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0602-4_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-0604-8
Online ISBN: 978-1-4757-0602-4
eBook Packages: Springer Book Archive