Skip to main content
SpringerLink
Log in
Book cover

Advances in Intelligent Systems and Applications - Volume 2 pp 25–32Cite as

An Extension of Harn-Lin’s Cheater Detection and Identification

  • Conference paper

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 21))

Abstract

Cheater detection and identification are important issues in the process of secret reconstruction. Most algorithms to detect and identify cheaters need the dealer to generate and distribute additional information to shareholders. In a recent paper, algorithms have been proposed to detect and identify cheaters based on shares only without needing any additional information. However, more than t (i.e. the threshold) shares are needed in the secret reconstruction. In this paper, we extend the algorithms to the situation when there are exact t shares in the secret reconstruction. We adopt the threshold changeable secret sharing which shareholders work together to change the threshold t into a new threshold t ′ (i.e., t ′ < t) and generate new shares of a (t ′, n) secret sharing; while at the same time, maintain the original secret. Since t ′ < t, there are redundant shares. We also include discussion on how to select the new threshold t ′ in order to detect and identify cheaters successfully.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Araki, T.: Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 133–142. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Benaloh, J.C.: Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251–260. Springer, Heidelberg (1987)

    Google Scholar 

  3. Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: Secret Sharing Schemes with Veto Capabilities. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S.N. (eds.) Algebraic Coding 1993. LNCS, vol. 781, pp. 82–89. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  4. Brickell, E.F., Stinson, D.R.: The Detection of Cheaters in Threshold Schemes. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 564–577. Springer, Heidelberg (1990)

    Google Scholar 

  5. Carpentieri, M.: A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography 5(3), 183–187 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Carpentieri, M., De Santis, A., Vaccaro, U.: Size of Shares and Probability of Cheating in Threshold Schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 118–125. Springer, Heidelberg (1994)

    Google Scholar 

  7. Harn, L., Lin, C.: Detection and identification of cheaters in (t,n) secret sharing scheme. Designs, Codes and Cryptography 52(1), 15–24 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Harn, L., Lin, C.: Strong (n,t,n) verifiable secret sharing scheme. Information Sciences 180(16), 3059–3064 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. He, J., Dawson, E.: Shared secret reconstruction. Designs, Codes and Cryptography 14(3), 221–237 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ghosting, H.: Comments on Harn-Lin’s cheating detection scheme. Designs, Codes and Cryptography 60(1), 63–66 (2011)

    Article  MathSciNet  Google Scholar 

  11. Kurosawa, K., Obana, S., Ogata, W.: t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 410–423. Springer, Heidelberg (1995)

    Google Scholar 

  12. McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Communications of the ACM 24(9), 583–584 (1981)

    Article  MathSciNet  Google Scholar 

  13. Ogata, W., Kurosawa, K., Stinson, D.R.: Optimum secret sharing scheme secure against cheating. SIAM Journal on Discrete Mathematics 20(1), 79–95 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pieprzyk, J., Zhang, X.-M.: Cheating Prevention in Linear Secret Sharing. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 121–135. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pp. 73–85 (1989)

    Google Scholar 

  16. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  17. Tompa, M., Woll, H.: How to share a secret with cheaters. Journal of Cryptology 1(3), 133–138 (1989)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Electrical Engineering, University of Missouri-Kansas City, Kansas City, MO, 64110-2499, USA

    Lein Harn

  2. Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fujian, 350007, P.R. China

    Changlu Lin

Authors
  1. Lein Harn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Changlu Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lein Harn .

Editor information

Editors and Affiliations

  1. of Applied Sciences, Department of Electronic Engineering, National Kaohsiung University, Jiàngōng Road, Kaohsiung, 807, Taiwan R.O.C.

    Jeng-Shyang Pan

  2. , Department of Computer Science and, National Dong Hwa University, #1, Sec. 2, Da Hsueh Rd., Hualien, Taiwan R.O.C.

    Ching-Nung Yang

  3. , Department of Computer Science and, Providence University, #200, Chung-shi Rd., Taichung, Taiwan R.O.C.

    Chia-Chen Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harn, L., Lin, C. (2013). An Extension of Harn-Lin’s Cheater Detection and Identification. In: Pan, JS., Yang, CN., Lin, CC. (eds) Advances in Intelligent Systems and Applications - Volume 2. Smart Innovation, Systems and Technologies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35473-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35473-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35472-4

  • Online ISBN: 978-3-642-35473-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation