Cheating Prevention in Linear Secret Sharing
Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.
KeywordsCryptography Secret Sharing Linear Secret Sharing Schemes Cheating Detection Cheating Identification
Unable to display preview. Download preview PDF.
- 2.J. Benaloh and J. Leichter. Generalised secret sharing and monotone functions. In S. Goldwasser, editor, Advances in Cryptology-CRYPTO’88, LNCS No. 403, pages 27–36. Springer-Verlag, 1988.Google Scholar
- 3.G. R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 National Computer Conference, pages 313–317. AFIPS, 1979.Google Scholar
- 4.E.F. Brickell and D.R. Stinson. The detection of cheaters in threshold schemes. In S. Goldwasser, editor, Advances in Cryptology-CRYPTO’88, LNCS No. 403, pages 564–577. Springer-Verlag, 1988.Google Scholar
- 6.M. Carpentieri, A. De Santis, and U. Vaccaro. Size of shares and probability of cheating in threshold schemes. In T. Helleseth, editor, Advances in Cryptology-EUROCRYPT’93, LNCS No. 765, pages 118–125. Springer, 1993.Google Scholar
- 7.H. Ghodosi, J. Pieprzyk, R. Safavi-Naini, and H. Wang. On construction of cumulative secret sharing. In C. Boyd and E. Dawson, editor, In Proceedings of the Third Australasian Conference on Information Security and Privacy (ACISP’98), LNCS No. 1438, pages 379–390. Springer-Verlag, 1998.Google Scholar
- 8.H. Lin, and L. Haen. A generalised secret sharing scheme with cheater detection. In H. Imai, R. Rivest, and T. Matsumoto, editor, In Proceedings of ASIACRYPT’91, LNCS No. 739, pages 149–158. Springer-Verlag, 1993.Google Scholar
- 9.M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In Proceedings IEEE Globecom’ 87, pages 99–102. IEEE, 1987.Google Scholar
- 11.K. Martin, J. Pieprzyk, R. Safavi-Naini, and H. Wang. Changing thresholds in the absence of secure channels. In Proceedings of the Fourth Australasian Conference on Information Security and Privacy (ACISP’99), LNCS No. 1587, pages 177–191. Springer-Verlag, 1999.Google Scholar
- 12.W. Ogata and K. Krurosawa. Optimum secret shares scheme secure against cheating. In U. Maurer, editor, Advances in Cryptology-EUROCRYPT’96, LNCS No. 1070, pages 200–211.Google Scholar
- 13.T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of 21st ACM Symposium on Theory of Computing, pages 73–85, 1989.Google Scholar
- 14.A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, November 1979.Google Scholar