Abstract
A new secret sharing scheme is presented in this paper to realize the generalized secret sharing policy. Different from most of previous works, it is computationally secure and each participant holds only one single shadow. Any honest participant in this scheme can detect and identify who is cheating even when all of the other participants corrupt together. An extended algorithm is also proposed to protect the secret form dishonest participant without the assumption of simultaneous release of the shadows. With (×,×) property, it can also be used to protect individual secrets while revealing the product of these secrets.
Cite
CITATION STYLE
Lin, H. Y., & Ham, L. (1993). A generalized secret sharing scheme with cheater detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 739 LNCS, pp. 149–158). Springer Verlag. https://doi.org/10.1007/3-540-57332-1_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
