Abstract
We consider the following problem.
-
Let S be some secret. A collection of n people Ej share this secret in such a way that
-
each Ej knows some information xj,
-
for a certain fixed integer k, 2≤k≤n, the knowledge of any k of th x’s enables to find S easily,
-
the knowlegde of less than k of the x’s leaves S undetermined.
-
This problem was considered first by A. Shamir [79] and he calls such a scheme a (k, n) threshold scheme.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mignotte, M. (1983). How to Share a Secret. In: Beth, T. (eds) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39466-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-39466-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11993-7
Online ISBN: 978-3-540-39466-2
eBook Packages: Springer Book Archive