Skip to main content
SpringerLink
Log in

Cheating detectable threshold scheme against most powerful cheaters for long secrets

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper, we propose a framework of cheating-detectable threshold schemes against the most powerful cheaters. Our scheme is used to distribute long secrets, and the share size is almost optimum. If the threshold is 2, our scheme is more efficient than the existing schemes even in the weaker adversarial model.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Araki T.: Efficient (k, n) threshold secret sharing schemes secure against cheating from n−1 cheaters. Proceedings of ACISP ’07. Lecture Notes in Computer Science, vol. 4586, pp. 133–142 (2007).

  2. Araki T., Obana S.: Flaws in some secret sharing schemes against cheating. Information Security and Privacy, Lecture Notes in Computer Science, vol. 4586, pp. 122–132 (2007).

  3. Blakley G.R.: Safeguarding cryptographic keys. Proceedings of the AFIPS 1979 National Computer Conference, pp. 313–317. AFIPS Press, Monval, (1979).

  4. Carpentieri M., De Santis A., Vaccaro U.: Size of shares and probability of cheating in threshold schemes. Advances in cryptography—eurocrypt ’93. Lecture Notes in Computer Science, vol. 765, pp. 118–125 (1994).

  5. Obana S.: A generic construction of Secret sharing schemes secure against n-1 cheaters. Proceedings of 2008 Symposium on Cryptography and Information Security, CD-ROM, 4F1–6, (In Japanese), (2008).

  6. Obana S., Araki T.: Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution. Proceedings of ASIACRYPT 2006, Lecture Notes in Computer Science, vol. 428, pp. 364–379 (2006).

  7. Ogata W., Kurosawa K., Stinson D.R.: Optimum secret sharing scheme secure against cheating. SIAM J. Discrete Math. 20, 79–95 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

  9. Tompa M., Woll H.: How to share a secret with cheaters. J. Cryptol. 1, 133–138 (1988)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tokyo Institute of Technology, Tokyo, Japan

    Wakaha Ogata & Hiroshi Eguchi

Authors
  1. Wakaha Ogata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Eguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wakaha Ogata.

Additional information

Communicated by C. M. O'Keefe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ogata, W., Eguchi, H. Cheating detectable threshold scheme against most powerful cheaters for long secrets. Des. Codes Cryptogr. 71, 527–539 (2014). https://doi.org/10.1007/s10623-012-9756-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9756-5

Keywords

Mathematics Subject Classification (2000)

Search

Navigation