Abstract
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.”
Chapter PDF
Similar content being viewed by others
Keywords
- 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.
References
M. Tompa and H. Woll. “How to share a secret with cheaters”. In Journal of Cryptology, vol. 1, pages 133–138, 1988.
A. Shamir. “How to Share a Secret”. In Communications of the ACM, vol.22, no. 11, pages 612–613, 1979.
G.R. Blakely. “Safeguarding cryptographic keys”. In Proc. of the AFIPS 1979 National Computer Conference, vol.48, pages 313–317, 1979.
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.
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.
F.J. MacWilliams and N.J.A. Sloane. “The theory of error-correcting codes”. In North-Holland, pages 397–398, 1981.
T. Beth, T, D. Jungnickel and H. Lenz. “Design Theory”. In Cambridge University Press, pages 260–264, 1993.
R.J. McEliece and D.V. Sarwate. “On sharing secrets and Reed-Solomon codes”. In Comm.ACM, 24, pages 583–584, 1981.
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.
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.
M. Carpentieri. “A perfect threshold secrety sahring scheme to identify cheaters”. In Designs, Codes and Cryptography, vol.5, no.3, pages 183–187, 1995.
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.
D.R. Stinson. “Cryptography: Theory and Practice”. In CRC Press, pages 330–331, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ogata, W., Kurosawa, K. (1996). Optimum Secret Sharing Scheme Secure against Cheating. In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive