{"references": ["G. R. Blakley, \"Safeguarding cryptographic keys\", in: Amer. Fed. Inf.\nProcess. Soc. Proc. 1979, vol.48, pp.313\u2013317.", "C. Blundo, A. De Santis, R. De Simone and U. Vaccaro, \"Tight bounds\non the information rate of secret sharing schemes\", Des. Codes Cryptogr.,\nvol.11, pp.107\u2013122, 1997", "C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, \"On the information\nrate of secret sharing schemes\", Theor. Comp. Soc., vol. 154, pp.283\u2013306,\n1996.", "C. Blundo, A. De Santis, A. Giorgio Gaggian and U. Vaccaro, \"New\nbounds on the information rate of secret sharing schemes\", IEEE Trans.\nInf. Theory, vol.41, pp.549\u2013554, 1995.", "C. Blundo, A. De Santis, D. R. Stinson and U. Vaccaro, \"Graph\ndecompositions and secret sharing schemes\", J. Cryptol., vol.8, pp.39\u201364,\n1995.", "E. F. Brickell and D. M. Davenport, \"On the classification of ideal secret\nsharing schemes\", J. Cryptol., vol.4, pp.123\u2013134, 1991.", "E. F. Brickell and D. R. Stinson, \"Some improved bounds on the\ninformation rate of perfect secret sharing schemes\", J. Cryptol., vol.5,\npp.153\u2013166, 1992.", "L. Csirmaz, \"The size of a share must be large\", J. Cryptol., vol.10,\npp.223-231, 1997.", "L. Csirmaz, \"An impossibility result on graph secret sharing\", Des. Codes\nCryptogr., vol.53, pp.195\u2013209, 2009.\n[10] L. Csirmaz, \"Secret sharing schemes on graphs\", Studia Mathematica\nHungarica, vol.10, pp.297\u2013306, 1997.\n[11] L. Csirmaz and P. Ligeti, \"On an infinite families of graphs with\ninformation ratio 2 \u2212 1/k\", Computing, vol.85, pp.127\u2013136, 2009.\n[12] L. Csirmaz and G. Tardos, \"Exact bounds on tree based secret sharing\nschemes\", Tatracrypt 2007, Slovakia.\n[13] I. Csisz\u00b4ar and J. K\u00a8orner, Information Theory. Coding Theorems for\nDiscrete Memoryless Systems, Academic Press, New York, 1981.\n[14] M. van Dijk, \"On the information rate of perfect secret sharing schemes\",\nDes. Codes Cryptogr., vol.6, pp.143\u2013169, 1995.\n[15] W.-A. Jackson and K. M. Martin, \"Perfect secret sharing schemes on\nfive participants\", Des. Codes Cryptogr., vol.9, pp.267\u2013286, 1996.\n[16] H-C Lu and H-L Fu, \"The exact values of the average information ratio\nof perfect secret-sharing schemes for tree-based access structures\", Des.\nCodes Cryptogr. DOI 10.1007/s10623-012-9792-1.\n[17] H-C Lu and H-L Fu, \"The average informaion ratio of perfect secretsharing\nschemes for access structures based on sparse bipartite graphs\",\nsubmitted.\n[18] A. Shamir, \"How to share a secret\", Commun. ACM, vol.22, pp.612\u2013\n613, 1979.\n[19] D. R. Stinson, \"An explication of secret sharing schemes\", Des. Codes\nCryptogr., vol.2, pp.357\u2013390, 1992.\n[20] D. R. Stinson, \"New general lower bounds on the information rate of\nperfect secret sharing schemes\", in Advances in Cryptology \u2013 CRYPTO\n'92, Lecture Notes in Computer Science, 1993, vol.740, pp.168\u2013182.\n[21] D. R. Stinson, \"Decomposition constructions for secret sharing\nschemes\", IEEE Trans. Inf. Theory, vol.40, pp.118\u2013125, 1994.\n[22] D. B. West, Introduction to graph Theory, Prentice Hall, 2001."]}

In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach.