Optimum Secret Sharing Scheme Secure against Cheating

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1070)


Tompa and Woll considered a problem of cheaters in (k, n) threshold secret sharing schemes. We first derive a tight lower bound on the size of shares |V i| for this problem: |V i| ≥ (|S| − 1)/δ + 1, where V i denotes the set of shares of participant P i, S denotes the set of secrets, and δ denotes the cheating probability. We next present an optimum scheme which meets the equality of our bound by using “difference sets.”


Secret Sharing Secret Sharing Scheme Reconstruction Phase Threshold Scheme Threshold Secret Sharing Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    M. Tompa and H. Woll. “How to share a secret with cheaters”. In Journal of Cryptology, vol. 1, pages 133–138, 1988.CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    A. Shamir. “How to Share a Secret”. In Communications of the ACM, vol.22, no. 11, pages 612–613, 1979.CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    G.R. Blakely. “Safeguarding cryptographic keys”. In Proc. of the AFIPS 1979 National Computer Conference, vol.48, pages 313–317, 1979.Google Scholar
  4. 4.
    E.D. Karnin, J.W. Green, and M.E. Hellman. “On secret sharing systems”. In IEEE Trans. IT-29, No.1, pages 35–41, 1982.Google Scholar
  5. 5.
    M. Carpentieri, A. De Santis, and U. Vaccaro. “Size of Shares and Probability of Cheating in Threshold Schemes”. In Proc. of Eurocrypto’93, Lecture Notes in Computer Science, LNCS 765, Springer Verlag, pages 118–125, 1993.Google Scholar
  6. 6.
    F.J. MacWilliams and N.J.A. Sloane. “The theory of error-correcting codes”. In North-Holland, pages 397–398, 1981.Google Scholar
  7. 7.
    T. Beth, T, D. Jungnickel and H. Lenz. “Design Theory”. In Cambridge University Press, pages 260–264, 1993.Google Scholar
  8. 8.
    R.J. McEliece and D.V. Sarwate. “On sharing secrets and Reed-Solomon codes”. In Comm.ACM, 24, pages 583–584, 1981.CrossRefMathSciNetGoogle Scholar
  9. 9.
    T. Rabin and M. Ben-Or. “Verifiable secret sharing and multiparty protocols with honest majority”. In Proc. 21st ACM Symposium on Theory of Computing, pages 73–85, 1989.Google Scholar
  10. 10.
    E.F. Brickell and D.R. Stinson. “The Detection of Cheaters in Threshold Schemes”. In SIAM J. DISC. MATH, Vol.4, No.4, pages 502–510, 1991.CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    M. Carpentieri. “A perfect threshold secrety sahring scheme to identify cheaters”. In Designs, Codes and Cryptography, vol.5, no.3, pages 183–187, 1995.CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    K. Kurosawa, S. Obana, and W. Ogata. “t-cheater identifiable (k,n) threshold secret sharing schemes”. In Proc. of Crypt’95, Lecture Notes in Computer Science, LNCS 963, Springer Verlag, pages 410–423, 1995.Google Scholar
  13. 13.
    D.R. Stinson. “Cryptography: Theory and Practice”. In CRC Press, pages 330–331, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  1. 1.Himeji Institute of TechnologyHyogoJapan
  2. 2.Tokyo Institute of TechnologyTokyoJapan

Personalised recommendations