{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:52:51Z","timestamp":1764996771912},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327318"},{"type":"electronic","value":"9783540327325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_25","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T07:41:35Z","timestamp":1141112495000},"page":"482-501","source":"Crossref","is-referenced-by-count":12,"title":["On Matroids and Non-ideal Secret Sharing"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Noam","family":"Livne","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A. Beimel","year":"1994","unstructured":"Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Trans. on Information Theory\u00a040(3), 786\u2013794 (1994)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480102412868","volume":"19","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Ishai, Y.: On the power of nonlinear secret-sharing. SIAM Journal on Discrete Mathematics\u00a019(1), 258\u2013280 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-540-30576-7_32","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 600\u2013619. Springer, Heidelberg (2005)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proc. of the 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. of the 1979 AFIPS National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","volume":"154","author":"C. Blundo","year":"1996","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. Theoretical Computer Science\u00a0154(2), 283\u2013306 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C. Blundo","year":"1995","unstructured":"Blundo, C., De Santis, A., Stinson, D.R., Vaccaro, U.: Graph decomposition and secret sharing schemes. J. of Cryptology\u00a08(1), 39\u201364 (1995)","journal-title":"J. of Cryptology"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0020-0190(99)00153-2","volume":"72","author":"C. Blundo","year":"1999","unstructured":"Blundo, C., De Santis, A., Giorgio Gaggia, A.: Probability of shares in secret sharing schemes. Inform. Process. Lett.\u00a072, 169\u2013175 (1999)","journal-title":"Inform. Process. Lett."},{"key":"25_CR10","first-page":"105","volume":"6","author":"E.F. Brickell","year":"1989","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combin. Math. And Combin. Comput.\u00a06, 105\u2013113 (1989)","journal-title":"Journal of Combin. Math. And Combin. Comput."},{"issue":"73","key":"25_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E.F. Brickell","year":"1991","unstructured":"Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. of Cryptology\u00a04(73), 123\u2013134 (1991)","journal-title":"J. of Cryptology"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R.M. Capocelli","year":"1993","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. of Cryptology\u00a06(3), 157\u2013168 (1993)","journal-title":"J. of Cryptology"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"25_CR14","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Chichester (1991)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/11535218_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Daza, V., Gracia, I., Jimenez Urroz, J., Leander, G., Marti-Farre, J., Padro, C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 327\u2013343. Springer, Heidelberg (2005)"},{"issue":"3\u20134","key":"25_CR17","first-page":"429","volume":"32","author":"L. Csirmaz","year":"1996","unstructured":"Csirmaz, L.: The dealer\u2019s random bits in perfect secret sharing schemes. Studia Sci. Math. Hungar.\u00a032(3\u20134), 429\u2013437 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"issue":"4","key":"25_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L. Csirmaz","year":"1997","unstructured":"Csirmaz, L.: The size of a share must be large. J. of Cryptology\u00a010(4), 223\u2013231 (1997)","journal-title":"J. of Cryptology"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"Y. Desmedt","year":"1992","unstructured":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 457\u2013469. Springer, Heidelberg (1992)"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M. Dijk van","year":"1995","unstructured":"van Dijk, M.: On the information rate of perfect secret sharing schemes. Designs, Codes and Cryptography\u00a06, 143\u2013169 (1995)","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1008259214236","volume":"12","author":"M. Dijk van","year":"1997","unstructured":"van Dijk, M.: A linear construction of secret sharing schemes. Designs, Codes and Cryptography\u00a012(2), 161\u2013201 (1997)","journal-title":"Designs, Codes and Cryptography"},{"key":"#cr-split#-25_CR22.1","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of Globecom 1987, pp. 99???102 (1987);"},{"key":"#cr-split#-25_CR22.2","doi-asserted-by":"crossref","unstructured":"Journal version: Multiple assignment scheme for sharing secret. J. of Cryptology 6(1), 15???20 (1993)","DOI":"10.1007\/BF02620229"},{"key":"25_CR23","first-page":"267","volume":"9","author":"W. Jackson","year":"1996","unstructured":"Jackson, W., Martin, K.M.: Perfect secret sharing schemes on five participants. Designs, Codes and Cryptography\u00a09, 267\u2013286 (1996)","journal-title":"Designs, Codes and Cryptography"},{"issue":"4","key":"25_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900014","volume":"9","author":"W. Jackson","year":"1996","unstructured":"Jackson, W., Martin, K.M., O\u2019Keefe, C.M.: Ideal secret sharing schemes with multiple secrets. J. of Cryptology\u00a09(4), 233\u2013250 (1996)","journal-title":"J. of Cryptology"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th Structure in Complexity Theory, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"issue":"1","key":"25_CR26","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E.D. Karnin","year":"1983","unstructured":"Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. on Information Theory\u00a029(1), 35\u201341 (1983)","journal-title":"IEEE Trans. on Information Theory"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-48285-7_11","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"K. Kurosawa","year":"1994","unstructured":"Kurosawa, K., Okada, K., Sakano, K., Ogata, W., Tsujii, S.: Nonperfect secret sharing schemes and matroids. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 126\u2013141. Springer, Heidelberg (1994)"},{"key":"25_CR28","unstructured":"Livne, N.: On matroids and non-ideal secret sharing. Master\u2019s thesis, Ben-Gurion University, Beer-Sheva (2005)"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-36413-7_26","volume-title":"Security in Communication Networks","author":"J. Mart\u00ed-Farr\u00e9","year":"2003","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes on access structures with intersection number equal to one. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 354\u2013363. Springer, Heidelberg (2003)"},{"issue":"1","key":"25_CR30","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10623-003-4192-1","volume":"34","author":"J. Mart\u00ed-Farr\u00e9","year":"2005","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes with three or four minimal qualified subsets. Designs, Codes and Cryptography\u00a034(1), 17\u201334 (2005)","journal-title":"Designs, Codes and Cryptography"},{"key":"25_CR31","unstructured":"Martin, K.M.: Discrete Structures in the Theory of Secret Sharing. PhD thesis, University of London (1991)"},{"issue":"5","key":"25_CR32","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(99)00070-8","volume":"70","author":"P. Morillo","year":"1999","unstructured":"Morillo, P., Padr\u00f3, C., S\u00e1ez, G., Villar, J.L.: Weighted threshold secret sharing schemes. Inform. Process. Lett.\u00a070(5), 211\u2013216 (1999)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/71.722223","volume":"9","author":"M. Naor","year":"1998","unstructured":"Naor, M., Wool, A.: Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems\u00a09(1), 909\u2013922 (1998)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"25_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1024741108241","volume":"30","author":"S.-L. Ng","year":"2003","unstructured":"Ng, S.-L.: A representation of a family of secret sharing matroids. Designs, Codes and Cryptography\u00a030(1), 5\u201319 (2003)","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"25_CR35","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1011225330458","volume":"24","author":"S.-L. Ng","year":"2001","unstructured":"Ng, S.-L., Walker, M.: On the composition of matroids and ideal secret sharing schemes. Designs, Codes and Cryptography\u00a024(1), 49\u201367 (2001)","journal-title":"Designs, Codes and Cryptography"},{"key":"25_CR36","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"25_CR37","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/18.887867","volume":"46","author":"C. Padr\u00f3","year":"2000","unstructured":"Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with bipartite access structure. IEEE Trans. on Information Theory\u00a046, 2596\u20132605 (2000)","journal-title":"IEEE Trans. on Information Theory"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized Byzantine generals. In: Proc. of the 24th FOCS, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"25_CR39","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"P.D. Seymour","year":"1992","unstructured":"Seymour, P.D.: On secret-sharing matroids. J. of Combinatorial Theory, Series B\u00a056, 69\u201373 (1992)","journal-title":"J. of Combinatorial Theory, Series B"},{"key":"25_CR40","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"25_CR41","first-page":"71","volume":"1","author":"G.J. Simmons","year":"1991","unstructured":"Simmons, G.J., Jackson, W., Martin, K.M.: The geometry of shared secret schemes. Bulletin of the ICA\u00a01, 71\u201388 (1991)","journal-title":"Bulletin of the ICA"},{"issue":"2","key":"25_CR42","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J. Simonis","year":"1998","unstructured":"Simonis, J., Ashikhmin, A.: Almost affine codes. Designs, Codes and Cryptography\u00a014(2), 179\u2013197 (1998)","journal-title":"Designs, Codes and Cryptography"},{"key":"25_CR43","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: An explication of secret sharing schemes. Designs, Codes and Cryptography\u00a02, 357\u2013390 (1992)","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"25_CR44","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition construction for secret sharing schemes. IEEE Trans. on Information Theory\u00a040(1), 118\u2013125 (1994)","journal-title":"IEEE Trans. on Information Theory"},{"key":"25_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-24638-1_26","volume-title":"Theory of Cryptography","author":"T. Tassa","year":"2004","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 473\u2013490. Springer, Heidelberg (2004)"},{"key":"25_CR46","unstructured":"Vamos, P.: On the representation of independence structures (unpublished manuscript, 1968)"},{"key":"25_CR47","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic Press, London (1976)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:28Z","timestamp":1605643528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/11681878_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}