Anzeige
Erschienen in:
1994 | OriginalPaper | Buchkapitel
Size of Shares and Probability of Cheating in Threshold Schemes
verfasst von : Marco Carpentieri, Alfredo De Santis, Ugo Vaccaro
Erschienen in: Advances in Cryptology — EUROCRYPT ’93
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we study the amount of secret information that must be given to participants in any secret sharing scheme that is secure against coalitions of dishonest participants in the model of Tompa and Woll [20]. We show that any (k, n) threshold secret sharing algorithm in which any coalition of less than it participants has probability of successful cheating less than some ε > 0 it must give to each participant shares whose sizes are at least the size of the secret plus log#x03B5;1.