EUROCRYPT 1982: Cryptography pp 371-375 | Cite as

How to Share a Secret

  • Maurice Mignotte
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 149)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Maurice Mignotte
    • 1
  1. 1.Strasbourg

Personalised recommendations