{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:15:41Z","timestamp":1746159341062,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642545245"},{"type":"electronic","value":"9783642545252"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54525-2_23","type":"book-chapter","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T14:26:22Z","timestamp":1391783182000},"page":"251-262","source":"Crossref","is-referenced-by-count":2,"title":["Computationally Perfect Secret Sharing Scheme Based on Error-Correcting Codes"],"prefix":"10.1007","author":[{"given":"Appala Naidu","family":"Tentu","sequence":"first","affiliation":[]},{"given":"Prabal","family":"Paul","sequence":"additional","affiliation":[]},{"given":"V. Ch.","family":"Venkaiah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/S0895480104445654","volume":"22","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Disc. Math.\u00a022(1), 360\u2013397 (2008)","journal-title":"SIAM J. Disc. Math."},{"key":"23_CR2","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. AFIPS\u00a048, 313\u2013317 (1979)","journal-title":"AFIPS"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R., Kabatianski, A.: Ideal perfect threshold schemes and MDS codes. ISIT 1995, 488 (1995)","DOI":"10.1109\/ISIT.1995.550475"},{"key":"23_CR4","first-page":"105","volume":"9","author":"E.F. Brickell","year":"1989","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput.\u00a09, 105\u2013113 (1989)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"23_CR5","unstructured":"Collins, M.J.: A note on ideal tripartite access structures, manuscript available at http:\/\/eprint.iacr.org\/2002\/193\/2002"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-72540-4_26","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"O. Farr\u00e0s","year":"2007","unstructured":"Farr\u00e0s, O., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Ideal multipartite secret sharing schemes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 448\u2013465. Springer, Heidelberg (2007)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-642-25385-0_33","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"O. Farr\u00e0s","year":"2011","unstructured":"Farr\u00e0s, O., Padr\u00f3, C., Xing, C., Yang, A.: Natural generalizations of threshold secret sharing. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 610\u2013627. Springer, Heidelberg (2011)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0053748","volume-title":"Information Security and Privacy","author":"H. Ghodosi","year":"1998","unstructured":"Ghodosi, H., Pieprzyk, J., Safavi-Naini, R.: Secret Sharing in Multilevel and Compartmented Groups. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol.\u00a01438, pp. 367\u2013378. Springer, Heidelberg (1998)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1049\/ip-ifs:20060081","volume":"153","author":"J. Herranz","year":"2006","unstructured":"Herranz, J., Saez, G.: New results on multipartite access structures. IEEE Proc. Inf. Secur.\u00a0153, 153\u2013162 (2006)","journal-title":"IEEE Proc. Inf. Secur."},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-36552-4_18","volume-title":"Information Security and Cryptology - ICISC 2002","author":"J. Pieprzyk","year":"2003","unstructured":"Pieprzyk, J., Zhang, X.-M.: Ideal threshold schemes from MDS codes. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 253\u2013263. Springer, Heidelberg (2003)"},{"key":"23_CR11","doi-asserted-by":"crossref","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. Inf. Theory, IT-29, 35\u201341 (1983)","journal-title":"IEEE Trans. Inf. Theory, IT-"},{"key":"23_CR12","unstructured":"Kaskaloglu, K., Ozbudak, F.: On hierarchical threshold access structures. In: IST Panel Symposium, Tallinn, Estonia (November 2010)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed Solomon codes. Communications of the ACM\u00a024, 583\u2013584 (1981)","journal-title":"Communications of the ACM"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1049\/ip-com:20050073","volume":"153","author":"S.-L. Ng","year":"2006","unstructured":"Ng, S.-L.: Ideal Secret Sharing Schemes with multipartite access structures. IEEE Proc. Commun.\u00a0153, 165\u2013168 (2006)","journal-title":"IEEE Proc. Commun."},{"key":"23_CR15","unstructured":"Ozadam, H., Ozbudak, F., Saygi, Z.: Secret sharing schemes and linear codes. In: ISC, Ankara, pp. 101\u2013106 (2007)"},{"key":"23_CR16","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. Comm. ACM\u00a022, 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"23_CR17","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":"23_CR18","unstructured":"Naidu, T.A., Paul, P., Venkaiah, V.C.: Ideal and Perfect Hierarchical Secret Sharing Schemes based on MDS codes. In: Proceeding of International Conference on Applied and Computaional Mathematics, Ankara, Turkey, pp. 256\u2013272 (2012)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-45278-9_44","volume-title":"Combinatorial Algorithms","author":"A.N. Tentu","year":"2013","unstructured":"Tentu, A.N., Paul, P., Vadlamudi, C.V.: Conjunctive Hierarchical Secret Sharing Schemes based on MDS codes. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol.\u00a08288, pp. 463\u2013467. Springer, Heidelberg (2013)"},{"key":"23_CR20","unstructured":"Naidu, T.A., Paul, P., Venkaiah, V.C.: Ideal and Perfect Hierarchical Secret Sharing Schemes based on MDS codes, eprint.iacr.org\/2013\/189.pdf"},{"key":"23_CR21","unstructured":"The Theory of Error-Correcting Codes. Macwilliams, Sloane (1981)"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T. Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical Threshold Secret Sharing. Journal of Cryptology\u00a020, 237\u2013264 (2007)","journal-title":"Journal of Cryptology"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T. Tassa","year":"2009","unstructured":"Tassa, T., Dyn, N.: Multipartite Secret Sharing by Bivariate Interpolation. Journal of Cryptology\u00a022, 227\u2013258 (2009)","journal-title":"Journal of Cryptology"},{"key":"23_CR24","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":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-25243-3_11","volume-title":"Information and Communications Security","author":"Y. Yu","year":"2011","unstructured":"Yu, Y., Wang, M.: A Probabilistic secret sharing scheme for a compartmented access structure. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol.\u00a07043, pp. 136\u2013142. Springer, Heidelberg (2011)"}],"container-title":["Communications in Computer and Information Science","Recent Trends in Computer Networks and Distributed Systems Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54525-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T20:17:48Z","timestamp":1746130668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54525-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642545245","9783642545252"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54525-2_23","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}