Abstract
Given a set of parties {1, ..., n}, an access structure is a monotone collection of subsets of the parties. For a certain domain of secrets, a secret sharing scheme for an access structure is a method for a dealer to distribute shares to the parties, such that only subsets in the access structure can reconstruct the secret.
A secret sharing scheme is ideal if the domains of the shares are the same as the domain of the secrets. An access structure is universally ideal if there is an ideal secret sharing scheme for it over every finite domain of secrets. An obvious necessary condition for an access structure to be universally ideal is to be ideal over the binary and ternary domains of secrets. In this work, we prove that this condition is also sufficient. In addition, we given an exact characterization for each of these two conditions, and show that each condition by itself is not sufficient for universally ideal access structures.
“I weep for you,” the Walrus said, “I deeply sympathize.” With sobs arid tears he sorted out Those of the largest size, Holding his pocket-handkerchief Before his streaming eyes. “O Oyslers,” said the Carpenter. “You’ve had a pleasant run! Shall we be trotting home again?” But answer came there none — And this scarcely odd, because They’d eaten every one. from “Through the looking Glass” by Lewis Caroll
Supported by the Fund for Promotion of Research at the Technion.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E.F. Brickell and D.M. Davenport. On the classification of ideal secret sharing schemes. Journal of Cryptology, 4(73):123–134, 1991.
J.C. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In S. Goldwasser, editor, Advanced in Cryptology-CRYPTO’ 88 proceeding, volume 403 of Lecture notes in computer Science, pages 27–35. Springer-Verlag, 1988.
G.R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 NCC, vol. 48, pages 313–317, June 1979.
J.C. Benaloh and S. Rudich. Private communication, 1989.
E.F. Brickell. Some ideal secret sharing schemes. Journal of Combin. Math. and Combin. Comput., 6:105–113, 1989.
B. Chor and E. Kushilevitz. Secret sharing over infinite domains. In G. Brassard, editor, Advanced in Cryptology — CRYPTO’ 89 proceeding, volume 435 of Lecture notes in computer Science, pages 299–306. Springer-Verlag, 1989. To appear in Jour. of Cryptology.
M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structure. In Proc. IEEE Global Telecommunication Conf., Globecom 87, pages 99–102, 1987.
E.D. Karnin, J.W. Greene, and M.E. Hellman. On secret sharing systems. IEEE Trans. on Inform. Theory, IT-29 no. 1:35–41, 1983.
J. Kilian and N. Nisan. Private communication, 1990.
A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, November 1979.
D.J.A. Welsh. Matroid theory. Academic press, London, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beimel, A., Chor, B. (1993). Universally Ideal Secret Sharing Schemes. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive