{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T17:14:23Z","timestamp":1781370863473,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":73,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642209000","type":"print"},{"value":"9783642209017","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_2","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T14:11:30Z","timestamp":1307196690000},"page":"11-46","source":"Crossref","is-referenced-by-count":429,"title":["Secret-Sharing Schemes: A Survey"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures & Algorithms\u00a03, 289\u2013304 (1992)","journal-title":"Random Structures & Algorithms"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930050058","volume":"19","author":"L. Babai","year":"1999","unstructured":"Babai, L., G\u00e1l, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica\u00a019(3), 301\u2013319 (1999)","journal-title":"Combinatorica"},{"key":"2_CR3","unstructured":"Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Technion (1996), http:\/\/www.cs.bgu.ac.il\/~beimel\/pub.html"},{"issue":"3","key":"2_CR4","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":"2_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01202040","volume":"6","author":"A. Beimel","year":"1997","unstructured":"Beimel, A., G\u00e1l, A., Paterson, M.: Lower bounds for monotone span programs. Computational Complexity\u00a06(1), 29\u201345 (1997); Conference version: FOCS 1995","journal-title":"Computational Complexity"},{"issue":"1","key":"2_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":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-78524-8_12","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Livne, N., Padr\u00f3, C.: Matroids can be far from ideal secret sharing. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 194\u2013212. Springer, Heidelberg (2008)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-00457-5_32","volume-title":"Theory of Cryptography","year":"2009","unstructured":"Beimel, A., Orlov, I.: Secret sharing and non-shannon information inequalities. IEEE Trans. on Information Theory (2011); Preliminary version Reingold, O. (ed.): TCC 2009. LNCS, vol.\u00a05444, pp. 539\u2013557. Springer, Heidelberg (2009)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-85855-3_12","volume-title":"Security and Cryptography for Networks","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Paskin, A.: On linear secret sharing for connectivity in directed graphs. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 172\u2013184. Springer, Heidelberg (2008)"},{"issue":"5","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S0097539704444038","volume":"34","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Weinreb, E.: Separating the power of monotone span programs over different fields. SIAM J. on Computing\u00a034(5), 1196\u20131215 (2005)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ipl.2005.09.008","volume":"97","author":"A. Beimel","year":"2006","unstructured":"Beimel, A., Weinreb, E.: Monotone circuits for monotone weighted threshold functions. Inform. Process. Lett.\u00a097(1), 12\u201318 (2006); Conference version: Proc. of 20th Annu. IEEE Conf. on Computational Complexity, pp. 67\u201375 (2005)","journal-title":"Inform. Process. Lett."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proc. of the 14th ACM Conference on Computer and Communications Security, pp. 172\u2013184 (2007)","DOI":"10.1145\/1315245.1315268"},{"key":"2_CR13","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 ACM Symp. on the Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"2_CR14","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.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":"2_CR15","unstructured":"Benaloh, J.C., Rudich, S.: Private communication (1989)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"M. Bertilsson","year":"1993","unstructured":"Bertilsson, M., Ingemarsson, I.: A construction of practical secret sharing schemes using linear block codes. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 67\u201379. Springer, Heidelberg (1993)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Merwin, R.E., Zanca, J.T., Smith, M. (eds.) Proc. of the 1979 AFIPS National Computer Conference. AFIPS Conference Proceedings, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"2_CR18","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":"2_CR19","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":"2_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(97)00194-4","volume":"65","author":"C. Blundo","year":"1998","unstructured":"Blundo, C., De Santis, A., Vaccaro, U.: On secret sharing schemes. Inform. Process. Lett.\u00a065(1), 25\u201332 (1998)","journal-title":"Inform. Process. Lett."},{"key":"2_CR21","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":"2_CR22","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":"2_CR23","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":"2_CR24","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: Proc. of the 26th IEEE Symp. on Foundations of Computer Science, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"issue":"2","key":"2_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02620136","volume":"6","author":"B. Chor","year":"1993","unstructured":"Chor, B., Kushilevitz, E.: Secret sharing over infinite domains. J. of Cryptology\u00a06(2), 87\u201396 (1993)","journal-title":"J. of Cryptology"},{"key":"2_CR27","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":"2_CR28","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":"#cr-split#-2_CR29.1","doi-asserted-by":"crossref","unstructured":"Csirmaz, L.: The size of a share must be large. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.??950, pp. 223???231. Springer, Heidelberg (1995);","DOI":"10.1007\/BFb0053420"},{"key":"#cr-split#-2_CR29.2","doi-asserted-by":"crossref","unstructured":"Journal version in: J. of Cryptology 10(4), 223???231 (1997)","DOI":"10.1007\/s001459900029"},{"issue":"3-4","key":"2_CR30","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-4), 429\u2013437 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"key":"2_CR31","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":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BFb0053421","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Dijk van","year":"1995","unstructured":"van Dijk, M.: A linear construction of perfect secret sharing schemes. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 23\u201334. Springer, Heidelberg (1995)"},{"key":"2_CR33","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":"4","key":"2_CR34","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ipl.2006.01.016","volume":"99","author":"M. Dijk van","year":"2006","unstructured":"van Dijk, M., Kevenaar, T., Schrijen, G.-J., Tuyls, P.: Improved constructions of secret sharing schemes by applying (\u03bb],\u03c9)-decompositions. Inform. Process. Lett.\u00a099(4), 154\u2013157 (2006)","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"2_CR35","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. CACM\u00a028(6), 637\u2013647 (1985)","journal-title":"CACM"},{"issue":"4","key":"2_CR36","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s000370100001","volume":"10","author":"A. G\u00e1l","year":"2002","unstructured":"G\u00e1l, A.: A characterization of span program size and improved lower bounds for monotone span programs. Computational Complexity\u00a010(4), 277\u2013296 (2002)","journal-title":"Computational Complexity"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0020-0190(03)00334-X","volume":"87","author":"A. G\u00e1l","year":"2003","unstructured":"G\u00e1l, A., Pudl\u00e1k, P.: Monotone complexity and the rank of matrices. Inform. Process. Lett.\u00a087, 321\u2013326 (2003)","journal-title":"Inform. Process. Lett."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified vss and fact-track multiparty computations with applications to threshold cryptography. In: Proc. of the 17th ACM Symp. on Principles of Distributed Computing, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. of the 19th ACM Symp. on the Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"2_CR40","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: Proc. of the 13th ACM Conference on Computer and Communications Security, pp. 89\u201398 (2006)","DOI":"10.1145\/1180405.1180418"},{"issue":"4","key":"2_CR41","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of a pseudo-random generator from any one-way function. SIAM J. on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"2_CR42","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. J. of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"J. of Cryptology"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Proc. of the 10th IEEE Structure in Complexity Theory, pp. 134\u2013147 (1995)","DOI":"10.1109\/SCT.1995.514853"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proc. of the 21st ACM Symp. on the Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"#cr-split#-2_CR45.1","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 1987, pp. 99???102 (1987);"},{"key":"#cr-split#-2_CR45.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":"2_CR46","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":"2_CR47","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":"2_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"2_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-70936-7_15","volume-title":"Theory of Cryptography","author":"J. Mart\u00ed-Farr\u00e9","year":"2007","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On secret sharing schemes, matroids and polymatroids. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 273\u2013290. Springer, Heidelberg (2007)"},{"key":"2_CR50","doi-asserted-by":"crossref","unstructured":"Mat\u00fa\u0161, F.: Infinitely many information inequalities. In: IEEE International Symposium on Information Theory 2007, pp. 41\u201344 (2007)","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"2_CR51","unstructured":"Metcalf-Burton, J.R.: Improved upper bounds for the information rates of the secret sharing schemes induced by the Vamos matroid. Technical Report abs\/0809.3010, CoRR (2008)"},{"issue":"1","key":"2_CR52","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":"2_CR53","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981), Available online in the Cryptology ePrint Archive, Report 2005\/187, http:\/\/eprint.iacr.org\/2005\/187"},{"key":"2_CR54","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":"2_CR55","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proc. of the 22nd ACM Symp. on the Theory of Computing, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"2_CR56","unstructured":"Rudich, S.: Private communication, via M. Naor (1989)"},{"key":"2_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A. Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 457\u2013473. Springer, Heidelberg (2005)"},{"key":"2_CR58","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":"2_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-77444-0_31","volume-title":"Distributed Computing and Networking","author":"B. Shankar","year":"2008","unstructured":"Shankar, B., Srinathan, K., Rangan, C.P.: Alternative protocols for generalized oblivious transfer. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol.\u00a04904, pp. 304\u2013309. Springer, Heidelberg (2008)"},{"key":"2_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"2_CR61","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":"2_CR62","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"},{"issue":"1","key":"2_CR63","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":"2_CR64","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":"2_CR65","doi-asserted-by":"crossref","unstructured":"Tassa, T.: Generalized oblivious transfer by secret sharing. Designs, Codes and Cryptography\u00a058 (2011)","DOI":"10.1007\/s10623-010-9378-8"},{"key":"2_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11787006_25","volume-title":"Automata, Languages and Programming","author":"T. Tassa","year":"2006","unstructured":"Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 288\u2013299. Springer, Heidelberg (2006)"},{"key":"2_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"2_CR68","unstructured":"Waters, B.: Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. Technical Report 2008\/290, Cryptology ePrint Archive (2008), http:\/\/eprint.iacr.org\/"},{"key":"2_CR69","unstructured":"Yao, A.C.: Unpublished manuscript. Presented at Oberwolfach and DIMACS Workshops (1989)"},{"key":"2_CR70","volume-title":"Information Theory and Network Coding","author":"R.W. Yeung","year":"2008","unstructured":"Yeung, R.W.: Information Theory and Network Coding. Springer, Heidelberg (2008)"},{"issue":"4","key":"2_CR71","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1109\/18.681320","volume":"44","author":"Z. Zhang","year":"1998","unstructured":"Zhang, Z., Yeung, R.W.: On characterization of entropy function via information inequalities. IEEE Trans. on Information Theory\u00a044(4), 1440\u20131452 (1998)","journal-title":"IEEE Trans. on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20901-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T21:41:25Z","timestamp":1592602885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}