Abstract
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 C 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 (Formula Presented).
Cite
CITATION STYLE
Carpentjeri, M., De Santis, A., & Vaccaro, U. (1994). Size of shares and probability of cheating in threshold schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 765 LNCS, pp. 118–125). Springer Verlag. https://doi.org/10.1007/3-540-48285-7_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
