A generalized secret sharing scheme with cheater detection
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 (x,x)-homomorphism property, it can also be used to protect individual secrets while revealing the product of these secrets.
Unable to display preview. Download preview PDF.
- Akl, G.S. and P.D. Taylor, “Cryptographic Solution to A Multilevel Security Problem”, Proc. Crypto '82, Plenum Press, 237–250.Google Scholar
- Benaloh, J., “Secret Sharing Homomorphisms: Keeping Shares of a secret secret”, Proc. Crypto '86, Springer-Verlag, 251–260.Google Scholar
- Benaloh, J. and J. Leichter, “Generalized Secret Sharing and Monotone Functions”, Proc. Crypto '88, 27–35.Google Scholar
- Blackly, G., “Safeguarding Cryptographic Keys”, Proc. NCC, Vol. 48, AFIP Press, 1979, 313–317.Google Scholar
- Brickle, E.f., and D.R. Stinson, “The Detection of Cheaters in Threshold Schemes”, Proc. Crypto '88, Springer-Verlag, 564–577.Google Scholar
- Chor, B., S. Goldwasser, S. Micali,, and B. Awerbuch, “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults”, Proc. 26th IEEE Symp. on Fooundations of Computer Science, 1985, 383–395.Google Scholar
- Ito, M., A. Saito, and T. Nishizeki, “Secret Sharing Scheme Realizing General Access Structure”, Proc. Glob. Com(1987).Google Scholar
- Lubell, D., J. Comb. Th.1(1966), 299.Google Scholar
- Tompa, M., and H. Woll, “How to share a secret with cheaters”, J. of Cryptology 1(1988), 133–138.Google Scholar