Skip to main content
SpringerLink
Log in

Secret sharing schemes for compartmented access structures

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

In this paper, we devise ideal and probabilistic secret sharing schemes for two kinds of compartmented access structures. The first one is a compartmented access structures with hierarchical compartments. The second one is the compartmented access structures with strictly lower bounds. We propose ideal and probabilistic schemes for these two compartmented access structures by using the idea of bivariate interpolation.

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. Blakley, G.R.: Safeguarding cryptographic keys, National Computer Conference, New York, Montvale, NJ, USA, vol. 48 of AFIPS Conference Proceedings (1979)

  2. Brickell, E.F.: Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput. 9(2), 105–113 (1989)

    MathSciNet  MATH  Google Scholar 

  3. Beimel, A.: Secret-Sharing schemes: A survey. Proc. IWCC 2011, Qingdao, China LNCS 6639, 11–46 (2011)

    MathSciNet  MATH  Google Scholar 

  4. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. Proc. Adv. Cryptol, LNCS 403, 27–35 (1990)

    MathSciNet  MATH  Google Scholar 

  5. Ding, C., Laihonen, T., Renvall, A.: Linear multi-secret sharing schemes and error-correcting codes. J. Univ. Comput. Sci. 3(9), 1023–1036 (1997)

    MATH  Google Scholar 

  6. Ding, C., Kohel, D., Ling, S.: Secret sharing with a class of ternary codes. Theor. Comput. Sci. 246, 285–298 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding, C., Yuan, J.: Covering and secret sharing with linear codes. In: Discrete Mathematics and Theoretical Computer Science, Lecture Notes in Computer Science 2731, 2003, pp 11–25. Springer Verlag (2003)

  8. Ding, C., Salomaa, A.: Secret sharing schemes with nice access structures. Fundam. Inf. - icae 71(1-2), 65–79 (2006)

    MATH  Google Scholar 

  9. Farràs, O., Padró, C., Xing, C., Yang, A.: Natural generalizations of threshold secret sharing. IEEE Trans. Inf. Theory 60(3), 1652–1664 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Farràs, O., Martí-Farré, J., Padró, C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25(3), 434–463 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ito, M., Saito, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. J. Cryptol. 6(1), 15–20 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Liu, J., Mesnager, S., Chen, L.: Secret Sharing Schemes with General Access Structures. http://eprint.iacr.org/2015/1139.pdf

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Simmons, G.J.: How to (really) share a secret. Proc. Adv. Cryptol, LNCS 403, 390–448 (1990)

    MathSciNet  Google Scholar 

  15. Stinson, D.R.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2(4), 357–390 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  16. Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. J. Cryptol. 22(2), 227–258 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Tassa, T.: Hierarchical threshold secret sharing. J. Cryptol. 20(2), 237–264 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang, Y., Wu, Q., W, D., et al.: Further ideal multipartite access structures from integer polymatroids. Sci. China Inf. Sci. 58(7), 1–13 (2015)

    MathSciNet  Google Scholar 

  19. Wang, X., Fu, F. -W., Guang, X.: Probabilistic secret sharing schemes for multipartite access structures. IEICE Trans. Fundam. E99-A(4), 856–862 (2016)

    Article  Google Scholar 

  20. Yu, Y., Wang, M.: A probabilistic secret sharing scheme for a compartmented access structure. Proc. ICICS’ 2011, Beijing, China LNCS 7043, 136–142 (2011)

    Google Scholar 

Download references

Acknowledgments

The authors are very grateful to the reviewers and the Editor, for their comments and suggestions that improved the presentation and quality of this paper. This research was supported by NTU Tier 1 grant RG143/14, the National Key Basic Research Program of China (Grant No. 2013CB834204), and the National Natural Science Foundation of China (Grant Nos. 61571243 and 61171082).

Author information

Authors and Affiliations

  1. Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, 300071, People’s Republic of China

    Xianfang Wang & Fang-Wei Fu

  2. College of Mathematics and Informatics, South China Agricultural University, Guangzhou, 510642, People’s Republic of China

    Can Xiang

  3. Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, 637371, Singapore

    Can Xiang

Authors
  1. Xianfang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Can Xiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fang-Wei Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Can Xiang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, X., Xiang, C. & Fu, FW. Secret sharing schemes for compartmented access structures. Cryptogr. Commun. 9, 625–635 (2017). https://doi.org/10.1007/s12095-016-0205-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-016-0205-6

Keywords

Mathematics Subject Classification (2010)

Search

Navigation