Skip to main content
SpringerLink
Log in

An Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency

  • Conference paper
Security, Privacy, and Applied Cryptography Engineering (SPACE 2014)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 8804))

Abstract

In this paper, we consider the problem of (t, δ) robust secret sharing secure against rushing adversary. We design a simple t-out-of-n secret sharing scheme, which can reconstruct the secret in presence of t cheating participants except with probability at most δ, provided t < n/2. The later condition on cheater resilience is optimal for the case of public reconstruction of the secret, on which we focus in this work.

Our construction improves the share size of Cevallos et al. (EUROCRYPT-2012) robust secret sharing scheme by applying the “authentication tag compression” technique devised by Carpentieri in 1995. Our improvement is by a constant factor that does not contradict the asymptotic near-optimality of the former scheme. To the best of our knowledge, the proposed scheme has the smallest share size, among other efficient rushing (t, δ) robust secret sharing schemes with optimal cheater resilience.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Araki, T., Obana, S.: Flaws in some secret sharing schemes against cheating. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 122–132. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. 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 

  3. Berlekamp, E.R., Welch, L.R.: Error correction of algebraic block codes. U.S. Patent Number 4, 633.470 (1986)

    Google Scholar 

  4. Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS 1979, pp. 313–317 (1979)

    Google Scholar 

  5. Cevallos, A., Fehr, S., Ostrovsky, R., Rabani, Y.: Unconditionally-secure robust secret sharing with compact shares. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 195–208. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Cabello, S., Padro, C., Saez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Design Codes Cryptography 25(2), 175–188 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Choudhury, A.: Brief announcement: optimal amortized secret sharing with cheater identification. In: PODC 2012, pp. 101–102 (2012)

    Google Scholar 

  9. Cramer, R., Damgård, I.B., Fehr, S.: On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 503–523. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Den Boer, B.: A simple and key-economical unconditional authentication scheme. Journal of Computer Security 2, 65–72 (1993)

    Google Scholar 

  11. Cramer, R., Dodis, Y., Fehr, S., Padró, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471–488. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In: FOCS 1985, pp. 383–395 (1985)

    Google Scholar 

  13. Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. In: FOCS 1990, pp. 36–45 (1990), Journal version in J. ACM 40(1), 17–47 (1993)

    Google Scholar 

  14. Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 21–38. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Jhanwar, M.P., Safavi-Naini, R.: Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure. Mathematical Cryptology 7(4), 279–296 (2013)

    MATH  MathSciNet  Google Scholar 

  16. Johansson, T., Kabatianskii, G., Smeets, B.: On the relation between A-codes and codes correcting independent errors. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 1–11. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  17. 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 

  18. Lakshmanan, S., Ahamad, M., Venkateswaran, H.: Responsive security for stored data. IEEE Trans. Parallel Distrib. Syst. 14(9), 818–828 (2003)

    Article  Google Scholar 

  19. MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes, vol. 16. Elsevier (1977)

    Google Scholar 

  20. Martin, K.M., Paterson, M.B., Stinson, D.R.: Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures. Cryptography and Communications 3(2), 65–86 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  21. McEliece, R., Sarwate, D.: On sharing secrets and reed-solomon codes. Commun. ACM 24(9), 583–584 (1981)

    Article  MathSciNet  Google Scholar 

  22. Obana, S.: Almost optimum t-cheater identifiable secret sharing schemes. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 284–302. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  23. Obana, S., Araki, T.: Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 364–379. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  25. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC 1989, pp. 73–85 (1989)

    Google Scholar 

  26. Shamir, A.: How to share a secret. Comm. ACM 22(11), 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  27. Taylor, R.: An Integrity Check Value Algorithm for Stream Ciphers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 40–48. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  29. Waldman, M., Rubin, A.D., Cranor, L.F.: The architecture of robust publishing systems. ACM Trans. Internet Techn. 1(2), 199–230 (2001)

    Article  Google Scholar 

  30. Wegman, M.N., Lawrence Carter, J.: New classes and applications of hash functions. In: FOCS 1979, pp. 175–182 (1979)

    Google Scholar 

  31. Xu, R., Morozov, K., Takagi, T.: On Cheater Identifiable Secret Sharing Schemes Secure Against Rushing Adversary. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 258–271. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics, University of Calcutta, India

    Partha Sarathi Roy & Avishek Adhikari

  2. Graduate School of Mathematics, Kyushu University, Japan

    Rui Xu

  3. Institute of Mathematics for Industry, Kyushu University, Japan

    Kirill Morozov

  4. Graduate School of Information Science and Electrical Engineering, Kyushu University, Japan

    Kouichi Sakurai

Authors
  1. Partha Sarathi Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Avishek Adhikari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rui Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kirill Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kouichi Sakurai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India

    Rajat Subhra Chakraborty

  2. Department of Computer Systems and Communications, Masaryk University, Brno, Czech Republic

    Vashek Matyas

  3. The Bradley Department of Electrical and Computer Engineering, Virginia Tech., 24060, Blacksburg, VA, USA

    Patrick Schaumont

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Roy, P.S., Adhikari, A., Xu, R., Morozov, K., Sakurai, K. (2014). An Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency. In: Chakraborty, R.S., Matyas, V., Schaumont, P. (eds) Security, Privacy, and Applied Cryptography Engineering. SPACE 2014. Lecture Notes in Computer Science, vol 8804. Springer, Cham. https://doi.org/10.1007/978-3-319-12060-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12060-7_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12059-1

  • Online ISBN: 978-3-319-12060-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation