{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:51:31Z","timestamp":1725511891624},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709350"},{"type":"electronic","value":"9783540709367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_14","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T07:43:44Z","timestamp":1179301424000},"page":"253-272","source":"Crossref","is-referenced-by-count":13,"title":["Weakly-Private Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. In: Proc. of the 45th Symp. on Foundations of Computer Science, pp. 166\u2013175 (2004)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-49264-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"P. Beguin","year":"1995","unstructured":"Beguin, P., Cresti, A.: General short computational secret sharing schemes. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 194\u2013208. Springer, Heidelberg (1995)"},{"key":"14_CR3","unstructured":"Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Technion \u2013 Israel Institute of Technology (1996)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Beimel, A.: On private computation in incomplete networks. In: Distributed Computing (2006)","DOI":"10.1007\/s00446-006-0010-0"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/18.481774","volume":"42","author":"A. Beimel","year":"1996","unstructured":"Beimel, A., Chor, B.: Communication in key distribution schemes. IEEE Trans. on Information Theory\u00a042(1), 19\u201328 (1996)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"14_CR6","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 J. on Discrete Mathematics\u00a019(1), 258\u2013280 (2005)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/11681878_25","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2006","unstructured":"Beimel, A., Livne, N.: On matroids and non-ideal secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 482\u2013501. Springer, Heidelberg (2006)"},{"key":"14_CR8","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":"14_CR9","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. 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":"14_CR10","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":"14_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C. Blundo","year":"1997","unstructured":"Blundo, C., De Santis, A., de Simone, R., Vaccaro, U.: Tight bounds on the information rate of secret sharing schemes. Designs, Codes and Cryptography\u00a011(2), 107\u2013122 (1997)","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/18.370169","volume":"41","author":"C. Blundo","year":"1995","unstructured":"Blundo, C., De Santis, A., Giorgio Gaggia, A., Vaccaro, U.: New bounds on the information rate of secret sharing schemes. IEEE Trans. on Information Theory\u00a041(2), 549\u2013553 (1995)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2717","volume":"146","author":"C. Blundo","year":"1998","unstructured":"Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly secure key distribution for dynamic conferences. Info. and Comput.\u00a0146(1), 1\u201323 (1998)","journal-title":"Info. and Comput."},{"key":"14_CR14","first-page":"13","volume":"77","author":"C. Blundo","year":"1997","unstructured":"Blundo, C., Stinson, D.R.: Anonymous secret sharing schemes. Discrete Applied Math. and Combin. Operations Research and Comp. Sci.\u00a077, 13\u201328 (1997)","journal-title":"Discrete Applied Math. and Combin. Operations Research and Comp. Sci."},{"key":"14_CR15","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":"14_CR16","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":"14_CR17","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":"14_CR18","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":"14_CR19","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":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BFb0053420","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"L. Csirmaz","year":"1995","unstructured":"Csirmaz, L.: The size of a share must be large. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 223\u2013231. Springer, Heidelberg (1995), Also in: J. of Cryptology, 10(4), 223\u2013231, 1997"},{"issue":"3\u20134","key":"14_CR21","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."},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11745853_6","volume-title":"Public Key Cryptography - PKC 2006","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Linear integer secret sharing and distributed exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 75\u201390. Springer, Heidelberg (2006)"},{"key":"14_CR23","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":"14_CR24","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":"14_CR25","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":"14_CR26","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute based encryption for fine-grained access control of encrypted data. In: CCS 2006 (2006)","DOI":"10.1145\/1180405.1180418"},{"key":"14_CR27","unstructured":"Ishai, Y.: Personal communication (2006)"},{"key":"14_CR28","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of Globecom 87, pp. 99\u2013102 (1987)"},{"key":"14_CR29","first-page":"249","volume":"28","author":"W.-A. Jackson","year":"1998","unstructured":"Jackson, W.-A, Martin, K.M.: Combinatorial models for perfect secret sharing schemes. J. of Comb. Mathematics and Comb. Computing\u00a028, 249\u2013265 (1998)","journal-title":"J. of Comb. Mathematics and Comb. Computing"},{"key":"14_CR30","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":"14_CR31","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":"14_CR32","unstructured":"Kilian, J., Nisan, N.: Private communication (1990)"},{"issue":"1-3","key":"14_CR33","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0166-218X(01)00236-0","volume":"121","author":"W. Kishimoto","year":"2002","unstructured":"Kishimoto, W., Okada, K., Kurosawa, K., Ogata, W.: On the bound for anonymous secret sharing schemes. Discrete Appl. Math.\u00a0121(1-3), 193\u2013202 (2002)","journal-title":"Discrete Appl. Math."},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 136\u2013146. Springer, Heidelberg (1994)"},{"issue":"6","key":"14_CR35","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0020-0190(96)00178-0","volume":"60","author":"K. Kurosawa","year":"1996","unstructured":"Kurosawa, K., Okada, K.: Combinatorial lower bounds for secret sharing schemes. Inform. Process. Lett.\u00a060(6), 301\u2013304 (1996)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"14_CR36","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"Kushilevitz, E.: Privacy and communication complexity. SIAM J. on Discrete Mathematics\u00a05(2), 273\u2013284 (1992)","journal-title":"SIAM J. on Discrete Mathematics"},{"issue":"5","key":"14_CR37","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. of the ACM\u00a041(5), 960\u2013981 (1994)","journal-title":"J. of the ACM"},{"key":"14_CR38","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On secret sharing schemes, matroids and polymatroids. Technical Report 2006\/077, Cryptology ePrint Archive (2006)"},{"issue":"3","key":"14_CR39","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(02)00368-X","volume":"85","author":"Y. Miao","year":"2003","unstructured":"Miao, Y.: A combinatorial characterization of regular anonymous perfect threshold schemes. Inform. Process. Lett.\u00a085(3), 131\u2013135 (2003)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"14_CR40","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"},{"key":"14_CR41","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":"14_CR42","first-page":"403","volume-title":"Proc. of the 24th IEEE Symp. on Foundations of Computer Science","author":"M.O. Rabin","year":"1983","unstructured":"Rabin, M.O.: Randomized Byzantine generals. In: Proc. of the 24th IEEE Symp. on Foundations of Computer Science, pp. 403\u2013409. IEEE Computer Society Press, Los Alamitos (1983)"},{"key":"14_CR43","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":"14_CR44","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":"14_CR45","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":"1","key":"14_CR46","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"},{"issue":"2","key":"14_CR47","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0401024","volume":"1","author":"D.R. Stinson","year":"1988","unstructured":"Stinson, D.R., Vanstone, S.A.: A combinatorial approach to threshold schemes. SIAM J. on Discrete Mathematics\u00a01(2), 230\u2013236 (1988)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"14_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-24582-7_12","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"V. Vinod","year":"2003","unstructured":"Vinod, V., Narayanan, A., Srinathan, K., Pandu Rangan, C., Kim, K.: On the power of computational secret sharing. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol.\u00a02904, pp. 162\u2013176. Springer, Heidelberg (2003)"},{"key":"14_CR49","unstructured":"Yao, A.C.: Unpublished manuscript, Presented at Oberwolfach and DIMACS workshops (1989)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70936-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:12:51Z","timestamp":1605744771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_14","relation":{},"subject":[]}}