{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:47:18Z","timestamp":1755838038128},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359074"},{"type":"electronic","value":"9783540359081"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11787006_25","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T23:23:09Z","timestamp":1151536989000},"page":"288-299","source":"Crossref","is-referenced-by-count":12,"title":["Multipartite Secret Sharing by Bivariate Interpolation"],"prefix":"10.1007","author":[{"given":"Tamir","family":"Tassa","sequence":"first","affiliation":[]},{"given":"Nira","family":"Dyn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","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, The Proceedings of the Second Theory of Cryptography Conference, TCC 2005, MIT. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 600\u2013619. Springer, Heidelberg (2005)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1006\/jath.2000.3473","volume":"105","author":"C. Boor de","year":"2000","unstructured":"de Boor, C., Dyn, N., Ron, A.: Polynomial interpolation to data on flats in R\n                           \n                    d\n                  . Journal of Approximation Theory\u00a0105, 313\u2013343 (2000)","journal-title":"Journal of Approximation Theory"},{"key":"25_CR3","first-page":"105","volume":"9","author":"E.F. Brickell","year":"1989","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a09, 105\u2013113 (1989)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1137\/0714050","volume":"14","author":"K.C. Chung","year":"1977","unstructured":"Chung, K.C., Yao, T.H.: On lattices admitting unique Lagrange interpolation. SIAM Journal on Numerical Analysis\u00a014, 735\u2013743 (1977)","journal-title":"SIAM Journal on Numerical Analysis"},{"unstructured":"M.J. Collins, A note on ideal tripartite access structures, available at \n                    \n                      http:\/\/eprint.iacr.org\/2002\/193\/\n                    \n                    \n                   (2002).","key":"25_CR5"},{"unstructured":"Fehr, S.: Efficient construction of the dual span program. In: Manuscript (May 1999)","key":"25_CR6"},{"unstructured":"G\u00e1l, A.: Combinatorial methods in Boolean function complexity, Ph.D. thesis, University of Chicago (1995)","key":"25_CR7"},{"unstructured":"Herranz, J., S\u00e1ez, G.: New results on multipartite access structures (2006), available at \n                    \n                      http:\/\/eprint.iacr.org\/2006\/048","key":"25_CR8"},{"doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: The Proceedings of the 8th Structures in Complexity conference, pp. 102\u2013111 (1993)","key":"25_CR9","DOI":"10.1109\/SCT.1993.336536"},{"key":"25_CR10","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 Transactions on Information Theory\u00a046, 2596\u20132604 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR11","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_CR12","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 1988","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":"25_CR13","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","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787006_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:20:07Z","timestamp":1619508007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787006_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359074","9783540359081"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11787006_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}