{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T05:28:05Z","timestamp":1736486885326,"version":"3.32.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1007\/s10623-006-0007-5","type":"journal-article","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T05:26:58Z","timestamp":1151990818000},"page":"191-209","source":"Crossref","is-referenced-by-count":4,"title":["Generalised Cumulative Arrays in Secret Sharing"],"prefix":"10.1007","volume":"40","author":[{"given":"Shoulun","family":"Long","sequence":"first","affiliation":[]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Duncan S.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N Alon","year":"1986","journal-title":"Disc Maths"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N Alon","year":"1996","journal-title":"Algorithmica"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"585","DOI":"10.2307\/2974672","volume":"103","author":"H Alzer","year":"1996","journal-title":"Am Math Mon"},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M Atici","year":"1996","journal-title":"J Comb Des"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Beimel A, Stahl Y (2003) Robust information-theoretic private information retrieval. Third Conference on Security in Communication Networks \u201902 September 12\u201313, 2002 Amalfi, Italy. Lect Notes Comput Sci 2576","DOI":"10.1007\/3-540-36413-7_24"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume":"403","author":"J Benaloh","year":"1988","journal-title":"Adv Cryptol\u2013CRYPTO \u201988, LNCS"},{"key":"7_CR7","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","journal-title":"Proceedings of AFIPS 1979 National Computer Conference"},{"key":"7_CR8","first-page":"242","volume":"196","author":"GR Blakley","year":"1985","journal-title":"Advances in Cryptology \u2013 Proceedings of CRYPTO \u201984, Lect Notes Comput Sci"},{"key":"7_CR9","unstructured":"Blackburn SR (1999) Combinatorics and threshold cryptography. In: Combinatorial designs and their applications. Chapman and Hall\/CRC Research Notes in Mathematics, 403, Holroyd, FC, Quinn KAS, Rowley C, Web BS (eds) CRC Press, London 49\u201370"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1006\/jcta.1999.3050","volume":"92","author":"SR Blackburn","year":"2000","journal-title":"J Comb Theory A"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume":"1070","author":"SR Blackburn","year":"1996","journal-title":"Advance in Cryptology\u2013Eurocrypt \u201996, LNCS"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/10718964_37","volume":"1841","author":"E Brickell","year":"2000","journal-title":"Information Security Privacy, Lect Notes Comput Sci"},{"key":"7_CR13","unstructured":"Cormen T, Leiserson C, Rivest R (1989) Introduction to algorithms. The MIT Press"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(96)00146-6","volume":"182","author":"ZJ Czech","year":"1997","journal-title":"Theor Comput Sci"},{"key":"7_CR15","first-page":"307","volume":"435","author":"Y Desmedt","year":"1989","journal-title":"Advances in Cryptology \u2013 CRYPTO \u201989, Lect Notes Comput Sci"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","journal-title":"Israel J Math"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"ML Fredman","year":"1984","journal-title":"SIAM J Alg Disc Methods"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","journal-title":"J Cryptol"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-57220-1_51","volume":"718","author":"W-A Jackson","year":"1993","journal-title":"Adv Crypt Auscrypt \u201992, Lect Notes Comput Sci"},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W-A Jackson","year":"1994","journal-title":"Des Codes Cryptogr"},{"key":"7_CR21","first-page":"51","volume":"14","author":"W-A Jackson","year":"1996","journal-title":"Austr J Combinatorics"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","journal-title":"IEEE Trans Inform Theory"},{"key":"7_CR23","first-page":"126","volume":"765","author":"K Kurosawa","year":"1993","journal-title":"Adv Cryptol: Eurocrypt \u201993, Lect Notes Comput Sci"},{"key":"7_CR24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10623-003-1719-4","volume":"36","author":"KM Martin","year":"2005","journal-title":"Des Codes Cryptogr"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-36552-4_17","volume":"2587","author":"KM Martin","year":"2003","journal-title":"Lect Notes Comput Sci"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Mehlhorn K (1982) On the program size of perfect and universal hash functions. Proc. 23rd Annual IEEE Symposium on Foundations of Compute Science 170\u2013175","DOI":"10.1109\/SFCS.1982.80"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Mehlhorn K (1984) Data Structures and Algorithms, vol 1. Springer-Verlag","DOI":"10.1007\/978-3-642-69672-5"},{"key":"7_CR28","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-44750-4_15","volume":"963","author":"S Micali","year":"1995","journal-title":"Adv Cryptol CRYPTO \u201995, Lect Notes Comput Sci"},{"key":"7_CR29","unstructured":"Ng S-L (2002) Generalised cumulative arrays. Manuscript"},{"issue":"8","key":"7_CR30","first-page":"690","volume":"4","author":"W Ogata","year":"1998","journal-title":"J Univers Comput Sci"},{"key":"7_CR31","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1976","journal-title":"Communications ACM"},{"key":"7_CR32","first-page":"71","volume":"1","author":"GJ Simmons","year":"1991","journal-title":"Bull ICA"},{"key":"7_CR33","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative combinatorics, vol. 1","author":"RP Stanley","year":"1997"},{"key":"7_CR34","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","journal-title":"Des Codes Cryptogr"},{"key":"7_CR35","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"DR Stinson","year":"2000","journal-title":"J Statist Plan Infer"},{"key":"7_CR36","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"DR Stinson","year":"2000","journal-title":"J Comb Theory A"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Wang H, Pieprzyk J Shared generation of pseudo-random function with cumulative maps. CT-RSA\u201903, LNCS 2612:281\u2013294","DOI":"10.1007\/3-540-36563-X_19"},{"key":"7_CR38","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jcta.2000.3068","volume":"93","author":"H Wang","year":"2001","journal-title":"J Comb Theory A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-0007-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-006-0007-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-0007-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T18:25:26Z","timestamp":1736447126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-006-0007-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s10623-006-0007-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}