Skip to main content
SpringerLink
Log in

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures

  • Conference paper
Coding and Cryptology (IWCC 2011)

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

Included in the following conference series:

Abstract

This paper is a survey of the main results and open problems in a line of work that was initiated shortly after secret sharing was introduced. Namely, the construction of ideal linear secret sharing schemes for access structures that are natural generalizations of the threshold ones and have interesting properties for the applications. Some of them have hierarchical properties, while other ones are suitable for situations requiring the agreement of several parties. These access structures are multipartite, that is, the participants are distributed into several parts and all participants in the same part play an equivalent role in the structure. This line of work has received an impulse from a recently discovered connection between ideal multipartite secret sharing schemes and integer polymatroids.

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. Beimel, A., Chor, B.: Universally ideal secret-sharing schemes. IEEE Trans. Inform. Theory 40, 786–794 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beimel, A., Ishai, Y.: On the power of nonlinear secret sharing schemes. SIAM J. Discrete Math. 19, 258–280 (2005)

    Article  MATH  Google Scholar 

  3. Beimel, A., Livne, N., Padró, C.: Matroids Can Be Far from Ideal Secret Sharing. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 194–212. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Beimel, A., Orlov, I.: Secret Sharing and Non-Shannon Information Inequalities. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 539–557. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Beimel, A., Tassa, T., Weinreb, E.: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discrete Math. 22, 360–397 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Beimel, A., Weinreb, E.: Separating the power of monotone span programs over different fields. SIAM J. Comput. 34, 1196–1215 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Belenkiy, M.: Disjunctive Multi-Level Secret Sharing. Cryptology ePrint Archive, Report 2008/018, http://eprint.iacr.org/2008/018

  8. Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  9. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. ACM STOC 1988, pp. 1–10 (1988)

    Google Scholar 

  10. Beutelspacher, A., Wettl, F.: On 2-level secret sharing. Des. Codes Cryptogr. 3, 127–134 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313–317 (1979)

    Google Scholar 

  12. Bloom, J.R.: Threshold Schemes and Error Correcting Codes. Am. Math. Soc. 2, 230 (1981)

    Google Scholar 

  13. Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptogr. 11, 107–122 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  15. Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. Cryptology 4, 123–134 (1991)

    MATH  Google Scholar 

  16. Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares of secret sharing schemes. J. Cryptology 6, 157–168 (1993)

    Article  MATH  Google Scholar 

  17. Chaum, D., Crépeau, C., Damgård, I.: Multi-party unconditionally secure protocols. In: Proc. ACM STOC 1988, pp. 11–19 (1988)

    Google Scholar 

  18. Collins, M.J.: A Note on Ideal Tripartite Access Structures. Cryptology ePrint Archive, Report 2002/193, http://eprint.iacr.org/2002/193

  19. Cramer, R., Damgård, I.B., Maurer, U.M.: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316–334. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  20. Csirmaz, L.: The size of a share must be large. J. Cryptology 10, 223–231 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  21. Farràs, O.: Multipartite Secret Sharing Schemes. PhD Thesis, Universitat Politècnica de Catalunya (2010)

    Google Scholar 

  22. Farràs, O., Martí-Farré, J., Padró, C.: Ideal Multipartite Secret Sharing Schemes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 448–465. Springer, Heidelberg (2007), http://eprint.iacr.org/2006/292

    Chapter  Google Scholar 

  23. Farràs, O., Metcalf-Burton, J.R., Padró, C., Vázquez, L.: On the Optimization of Bipartite Secret Sharing Schemes. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 93–109. Springer, Heidelberg (2010)

    Google Scholar 

  24. Farràs, O., Padró, C.: Ideal hierarchical secret sharing schemes. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 219–236. Springer, Heidelberg (2010); The full version of this paper is available at the Cryptology ePrint Archive, Report 2009/141 (2010), http://eprint.iacr.org/2009/141

    Chapter  Google Scholar 

  25. Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics, vol. 47. North-Holland Elsevier, Amsterdam (1991)

    MATH  Google Scholar 

  26. Gál, A.: A characterization of span program size and improved lower bounds for monotone span programs. In: Proceedings of 30th ACM Symposium on the Theory of Computing, STOC 1998, pp. 429–437 (1998)

    Google Scholar 

  27. Giuletti, M., Vincenti, R.: Three-level secret sharing schemes from the twisted cubic. Discrete Mathematics 310, 3236–3240 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  28. Hammer, D., Romashchenko, A.E., Shen, A., Vereshchagin, N.K.: Inequalities for Shannon Entropy and Kolmogorov Complexity. J. Comput. Syst. Sci. 60, 442–464 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  29. Herranz, J., Sáez, G.: New Results on Multipartite Access Structures. IEEE Proceedings on Information Security 153, 153–162 (2006)

    Article  Google Scholar 

  30. Herzog, J., Hibi, T.: Discrete polymatroids. J. Algebraic Combin. 16, 239–268 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  31. Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing any access structure. In: Proc. IEEE Globecom 1987, pp. 99–102 (1987)

    Google Scholar 

  32. Jackson, W.-A., Martin, K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9, 267–286 (1996)

    MathSciNet  MATH  Google Scholar 

  33. Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inform. Theory 29, 35–41 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  34. Kothari, S.C.: Generalized Linear Threshold Scheme. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 231–241. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  35. Martí-Farré, J., Padró, C.: On Secret Sharing Schemes, Matroids and Polymatroids. J. Math. Cryptol. 4, 95–120 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  36. Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6-th Joint Swedish-Russian Workshop on Information Theory, Molle, Sweden, pp. 269–279 (August 1993)

    Google Scholar 

  37. Matúš, F.: Matroid representations by partitions. Discrete Math. 203, 169–194 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  38. Matúš, F.: Excluded minors of Boolean polymatroids. Discrete Math. 253, 317–321 (2001)

    MathSciNet  MATH  Google Scholar 

  39. Morillo, P., Padró, C., Sáez, G., Villar, J.L.: Weighted Threshold Secret Sharing Schemes. Inf. Process. Lett. 70, 211–216 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  40. Murota, K.: Discrete convex analysis. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2003)

    Book  MATH  Google Scholar 

  41. Ng, S.-L.: Ideal secret sharing schemes with multipartite access structures. IEEE Proc.-Commun. 153, 165–168 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  42. Padró, C., Sáez, G.: Secret sharing schemes with bipartite access structure. IEEE Trans. Inform. Theory 46, 2596–2604 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  43. Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin (2003)

    MATH  Google Scholar 

  44. Seymour, P.D.: On secret-sharing matroids. J. Combin. Theory Ser. B 56, 69–73 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  46. Simmons, G.J.: How to (Really) Share a Secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390–448. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  47. Simonis, J., Ashikhmin, A.: Almost affine codes. Des. Codes Cryptogr. 14, 179–197 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  49. Stinson, D.R.: Decomposition constructions for secret-sharing schemes. IEEE Transactions on Information Theory 40, 118–125 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  50. Tassa, T.: Hierarchical Threshold Secret Sharing. J. Cryptology 20, 237–264 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  51. Tassa, T., Dyn, N.: Multipartite Secret Sharing by Bivariate Interpolation. J. Cryptology 22, 227–258 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitat Rovira i Virgili, Tarragona, Catalonia, Spain

    Oriol Farràs

  2. Nanyang Technological University, Singapore

    Carles Padró

Authors
  1. Oriol Farràs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carles Padró
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Yeow Meng Chee , San Ling , Huaxiong Wang  & Chaoping Xing , ,  & 

  2. College of Information Engineering, Qingdao University, 266071, Shandong, P.R. China

    Zhenbo Guo

  3. Qingdao University, 266071, Shandong, P.R. China

    Fengjing Shao

  4. School of Mathematical Sciences, Yangzhou University, 225002, Jiangsu, P.R. China

    Yuansheng Tang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farràs, O., Padró, C. (2011). Ideal Secret Sharing Schemes for Useful Multipartite Access Structures. In: Chee, Y.M., et al. Coding and Cryptology. IWCC 2011. Lecture Notes in Computer Science, vol 6639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20901-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20901-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20900-0

  • Online ISBN: 978-3-642-20901-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation