Abstract
In a perfect secret sharing scheme the dealer distributes shares to participants so that qualified subsets can recover the secret, while unqualified subsets have no information on the secret. In an on-line secret sharing scheme the dealer assigns shares in the order the participants show up, knowing only those qualified subsets whose all members she has seen. We often assume that the overall access structure (the set of minimal qualified subsets) is known and only the order of the participants is unknown. On-line secret sharing is a useful primitive when the set of participants grows in time, and redistributing the secret when a new participant shows up is too expensive. In this paper we start the investigation of unconditionally secure on-line secret sharing schemes. The complexity of a secret sharing scheme is the size of the largest share a single participant can receive over the size of the secret. The infimum of this amount in the on-line or off-line setting is the on-line or off-line complexity of the access structure, respectively. For paths on at most five vertices and cycles on at most six vertices the on-line and offline complexities are equal, while for other paths and cycles these values differ. We show that the gap between these values can be arbitrarily large even for graph based access structures. We present a general on-line secret sharing scheme that we call first-fit. Its complexity is the maximal degree of the access structure. We show, however, that this on-line scheme is never optimal: the on-line complexity is always strictly less than the maximal degree. On the other hand, we give examples where the first-fit scheme is almost optimal, namely, the on-line complexity can be arbitrarily close to the maximal degree. The performance ratio is the ratio of the on-line and off-line complexities of the same access structure. We show that for graphs the performance ratio is smaller than the number of vertices, and for an infinite family of graphs the performance ratio is at least constant times the square root of the number of vertices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blundo C., Cresti A., De Santis A., Vaccaro U.: Fully dynamic secret sharing schemes. In: Stinson, D.R. (eds) Advances in Cryptology—Crypto’93. Lecture Notes in Computer Science, vol. 773, pp. 110–125. Springer-Verlag, New York (1994)
Blundo C., De Santis A., Gargano L., Vaccaro U.: On the information rate of secret sharing schemes. Theoret. Comp. Sci. 154, 283–306 (1996)
Blundo C., De Santis A., De Simone R., Vaccaro U.: Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptogr. 11(2), 107–110 (1997)
Bollobas B.: Combinatorics—Set Systems, Hypergraphs, Families Of Vectors and Probabilistic Combinatorics. Cambridge University Press, Cambridge (1986)
Cachin C.: On-line secret sharing. In: Proceedings of the 5th IMA Conference on Cryptography and Coding, pp. 190–198 (1995).
Capocelli R.M., De Santis A., Gargano L., Vaccaro U.: On the size of shares of secret sharing schemes. J. Cryptol. 6(3), 157–168 (1993)
Csirmaz L.: Secret sharing schemes on graphs. Studia Sci. Math. Hungar. 44, 297–306 (2007). IACR preprint. http://eprint.iacr.org/2005/059.
Csirmaz L.: Secret sharing on the d-dimensional cube. IACR preprint. http://eprint.iacr.org/2005/177.
Csirmaz L.:Online secret sharing. In: Presentation at the Conference. Combinatorics in secret sharing, March 2010, Amsterdam. http://eprints.renyi.hu/39.
Csirmaz L., Tardos G.: Secret sharing on trees: problem solved—IACR preprint. http://eprint.iacr.org/2009/071.
Csiszár I., Körner J.: Information theory. In: Coding Theorems for Discrete Memoryless Systems. Academic Press, New York (1981).
van Dijk M.: On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr. 6, 143–169 (1995)
Erdős P., Pyber L.: Covering a graph by complete bipartite graphs. Discrete math. 170, 249–251 (1997)
Ito M., Saito A., Nishizeki T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. 72(9), 56–64 (1989)
Lovász L., Saks M., Trotter W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math. 75(1–3), 319–325 (1989)
Martí-Farré J., Padró C.: On secret sharing schemes, matroids and polymatroids. In: Fourth IACR Theory of Cryptography Conference TCC 2007. Lecture Notes in Computer Science, vol. 4392, pp. 273–290 (2007).
Matuš F.: Two constructions on limits of entropy functions. IEEE Trans. Inform. Theory 53(1), 320–330 (2007)
Maurer U.: Secure multi-party computation made simple. Discrete Appl. Math. 154, 370–381 (2006)
Miller A.: Online graph colouring. In: Canadian Undergraduate Mathematics Conference (2004). http://www.cumc.math.ca/2005/papers/miller.pdf.
Stinson D.R.: Decomposition constructions for secret-sharing schemes. IEEE Trans. Inform. Theory 40(1), 118–125 (1994)
Stinson D.R., Wei R.: Bibliography on Secret Sharing Schemes. http://www.cacr.math.uwaterloo.ca/~dstinson/ssbib.html.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by H. Wang.
Rights and permissions
About this article
Cite this article
Csirmaz, L., Tardos, G. On-line secret sharing. Des. Codes Cryptogr. 63, 127–147 (2012). https://doi.org/10.1007/s10623-011-9540-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-011-9540-y