{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T05:06:10Z","timestamp":1771563970193,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245735","type":"print"},{"value":"9783540305767","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_32","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"600-619","source":"Crossref","is-referenced-by-count":38,"title":["Characterizing Ideal Weighted Threshold Secret Sharing"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[]},{"given":"Enav","family":"Weinreb","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"32_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"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. Technical Report 04-05, Dept. of Computer Science, Ben-Gurion University (2004), Available at: www.cs.bgu.ac.il\/~beimel\/pub.html","DOI":"10.1007\/978-3-540-30576-7_32"},{"key":"32_CR3","unstructured":"Beimel, A., Weinreb, E.: Monotone circuits for weighted threshold functions (2004) (in preparation)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J.C. Benaloh","year":"1990","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"32_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"},{"key":"32_CR7","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":"32_CR8","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":"32_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02451112","volume":"5","author":"E.F. Brickell","year":"1992","unstructured":"Brickell, E.F., Stinson, D.R.: Some improved bounds on the information rate of perfect secret sharing schemes. J. of Cryptology\u00a05(3), 153\u2013166 (1992)","journal-title":"J. of Cryptology"},{"issue":"3","key":"32_CR10","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":"32_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th ACM STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"32_CR12","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.B., Maurer, U.M.: 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":"32_CR13","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.G. Desmedt","year":"1992","unstructured":"Desmedt, Y.G., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 457\u2013469. Springer, Heidelberg (1992)"},{"key":"32_CR14","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of Globecom 1987, pp. 99\u2013102 (1987)"},{"issue":"4","key":"32_CR15","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":"32_CR16","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"issue":"1","key":"32_CR17","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":"32_CR18","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)"},{"key":"32_CR19","unstructured":"Martin, K.M.: Discrete Structures in the Theory of Secret Sharing. PhD thesis. University of London (1991)"},{"key":"32_CR20","first-page":"65","volume":"14","author":"K.M. Martin","year":"1993","unstructured":"Martin, K.M.: New secret sharing schemes from old. J. Combin. Math. Combin. Comput.\u00a014, 65\u201377 (1993)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"5","key":"32_CR21","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., Villa, J.L.: Weighted threshold secret sharing schemes. Inform. Process. Lett.\u00a070(5), 211\u2013216 (1999)","journal-title":"Inform. Process. Lett."},{"key":"32_CR22","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"32_CR23","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":"32_CR24","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized Byzantine generals. In: Proc. of the 24th IEEE Symp. on Foundations of Computer Science, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"32_CR25","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":"32_CR26","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":"32_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"G.J. Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (Really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 390\u2013448. Springer, Heidelberg (1990)"},{"key":"32_CR28","first-page":"441","volume-title":"Contemporary Cryptology, The Science of Information Integrity","author":"G.J. Simmons","year":"1992","unstructured":"Simmons, G.J.: An introduction to shared secret and\/or shared control and their application. In: Contemporary Cryptology, The Science of Information Integrity, pp. 441\u2013497. IEEE Press, Los Alamitos (1992)"},{"key":"32_CR29","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":"32_CR30","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":"32_CR31","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"},{"key":"32_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-48071-4_12","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D.R. Stinson","year":"1993","unstructured":"Stinson, D.R.: New general lower bounds on the information rate of secret sharing schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 168\u2013182. Springer, Heidelberg (1993)"},{"key":"32_CR33","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)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:55Z","timestamp":1605759835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}