Abstract
In this paper we consider the problem of identifying cheaters in secret sharing schemes. Rabin and Ben-Or presented a perfect and unconditionally secure secret sharing scheme in which the honest participants are able to identify the cheaters. We present a similar scheme, but one in which the information distributed to each participant is smaller.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Ben-Or and T. Rabin, Verifiable secret sharing and multiparty protocols with honest majority,Proc. 21st ACM Symposium on Theory of Computing, (1989) pp. 73–85.
G. R. Blakley, Safeguarding cryptographic keys,Proceedings AFIPS 1979 National Computer Conference, (1979) pp. 313–317.
E. F. Brickell and D. R. Stinson, The detection of cheaters in threshold schemes,SIAM J. Disc. Math., Vol. 4 (1991) pp. 502–510.
R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes,Advances in Cryptology—CRYPTO'91 (J. Feigenbaum, ed.), Lectures Notes in Computer Science, Springer-Verlag, New York, 576 (1992) pp. 101–113. Also to appear inJournal of Cryptology.
M. Carpentieri, A. De Santis, and U. Vaccaro, Size of shares and probability of cheating in threshold schemes,Advances in Cryptology—EUROCRYPT 93 (T. Helleseth, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, to appear.
D. Denning,Cryptography and Data Security, Addison-Wesley, Reading, MA (1983).
E. D. Karnin, J. W. Greene, and M. E. Hellman, On secret sharing systems,IEEE Trans. on Inform. Theory, Vol. IT-29 (1983) pp. 35–41.
J. D. Lipson,Elements of Algebra and Algebraic Computing, Addison-Wesley, Reading, MA (1981).
R. J. McEliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes,Communications of the ACM, Vol. 24 (1981) pp. 583–584
A. Shamir, How to share a secret,Communication of the ACM, Vol. 22 (1979) pp. 612–613.
G. Simmons, Robust shared secret schemes or “How to be sure you have the right answer even though you do not know the question”,Congr. Numer., Vol. 68 (1989) pp. 215–248.
G. J. Simmons, An introduction to shared secret and/or shared control schemes and their application,Contemporary Cryptology, IEEE Press (1991) pp. 441–497.
D. R. Stinson, An explication of secret sharing schemes,Designs, Codes and Cryptography, Vol. 2 (1992) pp. 357–390.
D. R. Stinson,Decomposition Constructions for Secret Sharing Schemes, Technical Report UNL-CSE-92-020, Department of Computer Science and Engineering, University of Nebraska, September 1992.
M. Tompa and H. Woll, How to share a secret with cheaters.Journal of Cryptology, Vol. 1 (1988) pp. 133–139.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carpentieri, M. A perfect threshold secret sharing scheme to identify cheaters. Des Codes Crypt 5, 183–187 (1995). https://doi.org/10.1007/BF01388382
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388382