{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:17:51Z","timestamp":1740097071743,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662449653"},{"type":"electronic","value":"9783662449660"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44966-0_14","type":"book-chapter","created":{"date-parts":[[2014,8,27]],"date-time":"2014-08-27T11:41:36Z","timestamp":1409139696000},"page":"149-161","source":"Crossref","is-referenced-by-count":0,"title":["Ideal and Computationally Perfect Secret Sharing Schemes for Generalized Access Structures"],"prefix":"10.1007","author":[{"given":"Dileep Kumar","family":"Pattipati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Appala Naidu","family":"Tentu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Ch.","family":"Venkaiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06639, pp. 11\u201346. Springer, Heidelberg (2011), http:\/\/dx.doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 1\u201310. ACM, New York (1988), http:\/\/doi.acm.org\/10.1145\/62212.62213"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proceedings of the 1979 AFIPS National Computer Conference, vol.\u00a048, pp. 313\u2013317 (June 1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-60693-9_22","volume-title":"Cryptography and Coding","author":"C. Cachin","year":"1995","unstructured":"Cachin, C.: On-line secret sharing. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol.\u00a01025, pp. 190\u2013198. Springer, Heidelberg (1995)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R. Capocelli","year":"1993","unstructured":"Capocelli, R., Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. Journal of Cryptology\u00a06(3), 157\u2013167 (1993), http:\/\/dx.doi.org\/10.1007\/BF00198463","journal-title":"Journal of Cryptology"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0028464","volume-title":"Information and Communications Security","author":"C. Charnes","year":"1997","unstructured":"Charnes, C., Martin, K.M., Pieprzyk, J., Safavi-Naini, R.: Secret sharing in hierarchical groups. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 81\u201386. Springer, Heidelberg (1997), http:\/\/dl.acm.org\/citation.cfm?id=646277.687203"},{"key":"14_CR7","first-page":"383","volume-title":"Proceedings of the 26th Annual Symposium on Foundations of Computer Science, SFCS 1985","author":"B. Chor","year":"1985","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, SFCS 1985, pp. 383\u2013395. IEEE Computer Society, Washington, DC (1985), http:\/\/dx.doi.org\/10.1109\/SFCS.1985.64"},{"issue":"9","key":"14_CR8","first-page":"1023","volume":"3","author":"C. Ding","year":"1997","unstructured":"Ding, C., Laihonen, T., Renvall, A.: Linear multisecret-sharing schemes and error-correcting codes. j-jucs\u00a03(9), 1023\u20131036 (1997)","journal-title":"j-jucs"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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), http:\/\/dl.acm.org\/citation.cfm?id=646758.705700"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/IAS.2009.279","volume-title":"Proceedings of the 2009 Fifth International Conference on Information Assurance and Security, IAS 2009","author":"C. Lin","year":"2009","unstructured":"Lin, C., Harn, L., Ye, D.: Ideal perfect multilevel threshold secret sharing scheme. In: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security, IAS 2009, vol.\u00a002, pp. 118\u2013121. IEEE Computer Society, Washington, DC (2009), http:\/\/dx.doi.org\/10.1109\/IAS.2009.279"},{"issue":"11","key":"14_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. Commun. ACM\u00a022(11), 612\u2013613 (1979), http:\/\/doi.acm.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"14_CR12","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), http:\/\/dx.doi.org\/10.1007\/0-387-34799-2_30"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Stadler","year":"1996","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996), http:\/\/dx.doi.org\/10.1007\/3-540-68339-9_17"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. Stinson","year":"1992","unstructured":"Stinson, D.: An explication of secret sharing schemes. Designs, Codes and Cryptography\u00a02(4), 357\u2013390 (1992), http:\/\/dx.doi.org\/10.1007\/BF00125203","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D. Stinson","year":"1994","unstructured":"Stinson, D.: Decomposition constructions for secret-sharing schemes. IEEE Transactions on Information Theory\u00a040(1), 118\u2013125 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR16","unstructured":"Tentu, A.N., Paul, P., Venkaiah, V.C.: Ideal and perfect hierarchical secret sharing schemes based on mds codes. IACR Cryptology ePrint Archive 2013, 189 (2013), http:\/\/dblp.uni-trier.de\/db\/journals\/iacr\/iacr2013.html#TentuPV13"},{"key":"14_CR17","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 scheme based on MDS codes. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol.\u00a08288, pp. 463\u2013467. Springer, Heidelberg (2013), http:\/\/dx.doi.org\/10.1007\/978-3-642-45278-9_44"},{"key":"14_CR18","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-54525-2_23","volume-title":"Recent Trends in Computer Networks and Distributed Systems Security","author":"A.N. Tentu","year":"2014","unstructured":"Tentu, A.N., Paul, P., Venkaiah, V.C.: Computationally perfect secret sharing scheme based on error-correcting codes. In: Mart\u00ednez P\u00e9rez, G., Thampi, S.M., Ko, R., Shu, L. (eds.) SNDS 2014. CCIS, vol.\u00a0420, pp. 251\u2013262. Springer, Heidelberg (2014), http:\/\/dx.doi.org\/10.1007\/978-3-642-54525-2_23"},{"key":"14_CR19","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), http:\/\/dx.doi.org\/10.1007\/978-3-540-24582-7_12"}],"container-title":["Communications in Computer and Information Science","Security in Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44966-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T19:30:10Z","timestamp":1598211010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44966-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662449653","9783662449660"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44966-0_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}