Abstract
In this paper we investigate the construction of efficient secret sharing schemes by using a technique called hypergraph decomposition, extending in a non-trivial way the previously studied graph decomposition technique. A major advantage advantage of hypergraph decomposition is that it applies to any access structure, rather than only structures representable as graphs. As a consequence we obtain secret sharing schemes for several classes of access structures with improved efficiency over previous results. We also obtain an elementary characterization of the ideal access structures among the hyperstars, which is of independent interest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1989)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, American Federation of Information Processing Societies Proceedings, vol. 48, pp. 313–317 (1979)
Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Tight Bounds on the Information Rate of Secret Sharing Schemes. Design, Codes, and Cryptography 11, 107–122 (1997)
Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the Information Rate of Secret Sharing Schemes. Theoretical Computer Science 154, 283–306 (1996)
Blundo, C., De Santis, A., Stinson, D.R., Vaccaro, U.: Graph Decomposition and Secret Sharing Schemes. Journal of Cryptology 8, 39–64 (1995); Preliminary version appeared in EuroCrypt 92
Brickell, E.F., Davenport, D.M.: On the Classification of Ideal Secret Sharing Schemes. Journal of Cryptology 4, 123–134 (1991)
Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the Size of Shares for Secret Sharing Schemes. Journal of Cryptology 6(3), 157–169 (1993)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Singapore (1991)
Csirmaz, L.: The Size of a Share Must be Large. Journal of Cryptology 10(4), 223–231 (1997)
Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Proceedings of the IEEE Global Telecommunications Conference, Globecom 1987, pp. 99–102. IEEE Press, Los Alamitos (1987)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Stinson, D.R.: New General Lower ounds on the Information Rate of Secret Sharing Schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 170–184. Springer, Heidelberg (1993)
Stinson, D.R.: Decomposition Constructions for Secret Sharing Schemes. IEEE Transactions on Information Theory 40 (1994)
Stinson, D.R.: An Explication of Secret Sharing Schemes. Design, Codes and Cryptography 2, 357–390 (1992)
van Dijk, M.: On the Information Rate of Perfect Secret Sharing Schemes. Design, Codes and Cryptography 6, 143–169 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Crescenzo, G., Galdi, C. (2003). Hypergraph Decomposition and Secret Sharing. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive