{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:00:54Z","timestamp":1725858054535},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_9","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T15:34:07Z","timestamp":1465832047000},"page":"89-98","source":"Crossref","is-referenced-by-count":3,"title":["Recent Advances in Non-perfect Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Oriol","family":"Farr\u00e0s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011)"},{"key":"9_CR2","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 1988","author":"JC Benaloh","year":"1990","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Advances in Cryptology","author":"GR Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 242\u2013268. Springer, Heidelberg (1985)"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"EF Brickell","year":"1991","unstructured":"Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. Cryptology 4, 123\u2013134 (1991)","journal-title":"J. Cryptology"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"5600","DOI":"10.1109\/TIT.2013.2264504","volume":"59","author":"I Cascudo","year":"2013","unstructured":"Cascudo, I., Cramer, R., Xing, C.: Bounds on the threshold gap in secret sharing and its applications. IEEE Trans. Inf. Theory 59, 5600\u20135612 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291\u2013310. Springer, Heidelberg (2007)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-540-78967-3_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"H Chen","year":"2008","unstructured":"Chen, H., Cramer, R., de Haan, R., Pueyo, I.C.: Strongly multiplicative ramp schemes from high degree rational points on curves. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 451\u2013470. Springer, Heidelberg (2008)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Q., Yeung, R.W.: Two-partition-symmetrical entropy function regions. In: ITW, pp. 1\u20135 (2013)","DOI":"10.1109\/ITW.2013.6691330"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-662-46803-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I.B., D\u00f6ttling, N., Fehr, S., Spini, G.: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 313\u2013336. Springer, Heidelberg (2015)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-540-72540-4_19","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R Cramer","year":"2007","unstructured":"Cramer, R., Damg\u00e5rd, I.B., de Haan, R.: Atomic secure multi-party multiplication with low communication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 329\u2013346. Springer, Heidelberg (2007)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)","DOI":"10.1002\/0471200611"},{"key":"9_CR13","doi-asserted-by":"crossref","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. Cryptology 10, 223\u2013231 (1997)","journal-title":"J. Cryptology"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the Gilbert-Varshamov bound and their cryptographic applications. In: ITCS, pp. 169\u2013182 (2014)","DOI":"10.1145\/2554797.2554815"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-3-662-44381-1_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"O Farr\u00e0s","year":"2014","unstructured":"Farr\u00e0s, O., Hansen, T., Kaced, T., Padr\u00f3, C.: Optimal non-perfect uniform secret sharing schemes. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 217\u2013234. Springer, Heidelberg (2014)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s, O., Hansen, T., Kaced, T., Padr\u00f3, C.: On the information ratio of non-perfect uniform secret sharing schemes. Cryptology ePrint Archive 2014\/124 (2014)","DOI":"10.1007\/978-3-662-44381-1_13"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s, O., Mart\u00edn, S., Padr\u00f3, C.: A note on ideal non-perfect secret sharing schemes. Cryptology ePrint Archive 2016\/348 (2016)","DOI":"10.1007\/978-3-319-40189-8_9"},{"issue":"2","key":"9_CR18","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10623-013-9858-8","volume":"74","author":"O Farr\u00e0s","year":"2015","unstructured":"Farr\u00e0s, O., Padr\u00f3, C.: Extending Brickell-Davenport theorem to non-perfect secret sharing schemes. Des. Codes Cryptogr. 74(2), 495\u2013510 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation. In: STOC, pp. 699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0019-9958(78)91063-X","volume":"39","author":"S Fujishige","year":"1978","unstructured":"Fujishige, S.: Polymatroidal dependence structure of a set of random variables. Inf. Control 39, 55\u201372 (1978)","journal-title":"Inf. Control"},{"key":"9_CR21","first-page":"14","volume":"61","author":"S Fujishige","year":"1978","unstructured":"Fujishige, S.: Entropy functions and polymatroids\u2013combinatorial structures in information theory. Electron. Comm. Japan 61, 14\u201318 (1978)","journal-title":"Electron. Comm. Japan"},{"key":"9_CR22","unstructured":"Geil, O., Martin, S., Mart\u00ednez-Pe\u0144as, U., Matsumoto, R., Ruano, D.: On asymptotically good ramp secret sharing schemes (2015). arXiv.org\/abs\/1502.05507"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"5938","DOI":"10.1109\/TIT.2014.2345375","volume":"60","author":"O Geil","year":"2014","unstructured":"Geil, O., Martin, S., Matsumoto, R., Ruano, D., Luo, Y.: Relative generalized hamming weights of one-point algebraic geometric codes. IEEE Trans. Inform. Theory 60, 5938\u20135949 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR24","unstructured":"Ishai, Y., Kushilevitz, E., Strulovich, O.: Lossy chains and fractional secret sharing. In: STACS 2013. LIPICS, vol. 20, pp. 160\u2013171 (2013)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 765, pp. 126\u2013141. Springer, Heidelberg (1994)"},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1515\/jmc.2010.004","volume":"4","author":"J Mart\u00ed-Farr\u00e9","year":"2010","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On secret sharing schemes, matroids polymatroids. J. Math. Cryptol. 4, 95\u2013120 (2010)","journal-title":"J. Math. Cryptol."},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BFb0000422","volume-title":"Advances in Cryptology - ASIACRYPT \u201994","author":"K Okada","year":"1995","unstructured":"Okada, K., Kurosawa, K.: Lower bound on the size of shares of nonperfect secret sharing schemes. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 33\u201341. Springer, Heidelberg (1995)"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-57220-1_52","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"W Ogata","year":"1993","unstructured":"Ogata, W., Kurosawa, K., Tsujii, S.: Nonperfect secret sharing schemes. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 56\u201366. Springer, Heidelberg (1993)"},{"key":"9_CR29","unstructured":"Padr\u00f3, C.: Lecture Notes in Secret Sharing. Cryptology ePrint Archive 2012\/674"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0028171","volume-title":"Security Protocols","author":"A Paillier","year":"1998","unstructured":"Paillier, A.: On ideal non-perfect secret sharing schemes. In: Christianson, B., Crispo, B., Lomas, M., Roe, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 207\u2013216. Springer, Heidelberg (1998)"},{"key":"9_CR31","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Yoshida, M., Fujiwara, T.: Secure construction for nonlinear function threshold ramp secret sharing. In: IEEE International Symposium on Information Theory, ISIT 2007, pp. 1041\u20131045 (2007)","DOI":"10.1109\/ISIT.2007.4557361"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-642-32284-6_11","volume-title":"Information Theoretic Security","author":"M Yoshida","year":"2012","unstructured":"Yoshida, M., Fujiwara, T., Fossorier, M.: Optimum general threshold secret sharing. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 187\u2013204. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T05:28:59Z","timestamp":1600752539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}