Abstract
We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the optimal information rate of bipartite access structures are given.
This work was partially supported by CICYT under project TIC97-0963
Chapter PDF
References
A. Beutelspacher and F. Wettl. On 2-Level Secret Sharing. Designs, Codes and Cryptography 3 (1993) 127–134.
G.R. Blakley. Safeguarding cryptographic keys. AFIPS Conference Proceedings 48 (1979) 313–317.
C. Blundo, A. De Santis, L. Gargano, U. Vaccaro. Tight Bounds on the Information Rate of Secret Sharing Schemes. Designs, Codes and Cryptography 11 (1997) 107–122.
C. Blundo, A. De Santis, L. Gargano, U. Vaccaro. On the Information Rate of Secret Sharing Schemes. Advances in Cryptology CRYPTO'92. Lecture Notes in Computer Science 740 148–167. Springer-Verlag.
C. Blundo, A. De Santis, D.R. Stinson, U. Vaccaro. Graph Decompositions and Secret Sharing Schemes. J. Cryptology 8 (1995) 39–64.
E.F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comprit, 9 (1989) 105–113.
E. F. Brickell, D. M. Davenport. On the Classification of Ideal Secret Sharing Schemes. J. Cryptology 4 (1991) 123–134.
E.F. Brickell and D.R. Stinson. Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes. J. Cryptology 5 (1992) 153–166.
R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro. On the Size of Shares of Secret Sharing Schemes. In Advances in Cryptology-CRYPTO 91, Lecture Notes in Computer Science 576, Springer-Verlag, 101–113. To appear in J. Of Cryptology.
M. Ito, A. Saito and T, Nishizeki. Secret sharing scheme realizing any access structure. Proc. IEEE Globecom'87 (1987) 99–102.
E.D. Karnin, J.W. Greene and M.E. Hellman. On secret sharing systems. IEEE Transactions on Information Theory 29 (1983) 35–41.
A. Shamir. How to share a secret. Commun. of the ACM 22 (1979) 612–613.
G.J. Simmons. An Introduction to Shared Secret and/or Shared Control Schemes and Their Application. Contemporary Cryptology. The Science of Information Integrity. IEEE Press (1991) 441–497.
D.R. Stinson. An explication of secret sharing schemes. Designs, Codes and Cryptography 2 (1992) 357–390.
D.R. Stinson. Decomposition Constructions for Secret-Sharing Schemes. IEEE Trans. on Information Theory 40 (1994) 118–125.
D.R. Stinson. Cryptography: Theory and Practice. CRC Press Inc., Boca Raton (1995).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Padró, C., Sáez, G. (1998). Secret sharing schemes with bipartite access structure. In: Nyberg, K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054149
Download citation
DOI: https://doi.org/10.1007/BFb0054149
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64518-4
Online ISBN: 978-3-540-69795-4
eBook Packages: Springer Book Archive