{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:14Z","timestamp":1725516254123},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850922"},{"type":"electronic","value":"9783540850939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85093-9_18","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T10:24:37Z","timestamp":1218536677000},"page":"183-198","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting the Karnin, Greene and Hellman Bounds"],"prefix":"10.1007","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"18_CR2","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. Cryptology\u00a04, 123\u2013134 (1991)","journal-title":"J. Cryptology"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02451112","volume":"5","author":"E.F. Brickell","year":"1992","unstructured":"Brickell, E.F., Stinson, D.R.: Some improved bounds on the information rate of perfect secret sharing schemes. Journal of Cryptology\u00a05, 153\u2013166 (1992)","journal-title":"Journal of Cryptology"},{"key":"18_CR4","volume-title":"Algorthmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorthmic Number Theory, vol.\u00a01. MIT Press, Cambridge (1996)"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"K.A. Bush","year":"1952","unstructured":"Bush, K.A.: Orthogonal Arrays of Index Unity. The Annals of Mathematical Statistics\u00a023(3), 426\u2013434 (1952)","journal-title":"The Annals of Mathematical Statistics"},{"key":"18_CR6","first-page":"27","volume":"8","author":"E. Dawson","year":"1993","unstructured":"Dawson, E., Mahmoodian, E.S., Rahilly, A.: Orthogonal arrays and ordered threshold schemes. Australasian Journal of Combinatorics\u00a08, 27\u201344 (1993)","journal-title":"Australasian Journal of Combinatorics"},{"key":"18_CR7","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., Gargana, L., Vaccaro, U.: On the Size of shares for secret sharing schemes. Journal of Cryptology\u00a06, 157\u2013167 (1993)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"18_CR8","first-page":"61","volume":"17","author":"C. Charnes","year":"1995","unstructured":"Charnes, C., Pieprzyk, J.: Generalized cumulative arrays and their applications to secret sharing schemes. Proceeding of the 18th Australasian Computer Science Conference, Australasian Computer Science Communications\u00a017(1), 61\u201365 (1995)","journal-title":"Proceeding of the 18th Australasian Computer Science Conference, Australasian Computer Science Communications"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/11535218_21","volume-title":"Proceedings of 25th Annual IACR CRYPTO 2005","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Fehr, S., Stam, M.: Primitive Sets over Number Fields and Black-Box Secret Sharing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 344\u2013360. Springer, Heidelberg (2005)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45708-9_18","volume-title":"CRYPTO 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Fehr, S.: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 272\u2013287. Springer, Heidelberg (2002)"},{"key":"18_CR11","series-title":"Developments in Mathematics","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-1-4613-0283-4_13","volume-title":"Finite Geometries: Proceedings of the Fourth Isle of Thorns Conference (Chelwood Gate, 2000)","author":"J.W.P. Hirschfeld","year":"2001","unstructured":"Hirschfeld, J.W.P., Storme, L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. In: Blokhuis, A., Hirschfeld, J.W.P., Jungnickel, D., Thas, J.A. (eds.) Finite Geometries: Proceedings of the Fourth Isle of Thorns Conference (Chelwood Gate, 2000), July 16\u201321, 2001. Developments in Mathematics, vol.\u00a03, pp. 201\u2013246. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"18_CR12","first-page":"99","volume-title":"Proc. IEEE Global Telecommunications Conf., Globecom 1987","author":"M. Ito","year":"1987","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structures. In: Proc. IEEE Global Telecommunications Conf., Globecom 1987, pp. 99\u2013102. IEEE Communications Soc. Press, Los Alamitos (1987)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00022-003-1633-y","volume":"79","author":"W. Jackson","year":"2004","unstructured":"Jackson, W., Martin, K., O\u2019Keefe, C.: Geometrical contributions to secret sharing theory. Journal of Geometry\u00a079, 102\u2013133 (2004)","journal-title":"Journal of Geometry"},{"key":"18_CR14","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 Transactions on Information Theory\u00a029, 35\u201341 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR15","first-page":"228","volume":"37","author":"S. Kounias","year":"1975","unstructured":"Kounias, S., Petros, C.I.: Orthogonal arrays of strength three and four with index unity. Sankhya: The Indian Journal of Statistics\u00a037, 228\u2013240 (1975)","journal-title":"Sankhya: The Indian Journal of Statistics"},{"issue":"9","key":"18_CR16","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. Comm. ACM\u00a024(9), 583\u2013584 (1981)","journal-title":"Comm. ACM"},{"key":"18_CR17","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"18_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07324-7","volume-title":"Fundamantals of Computer Security","author":"J. Pieprzyk","year":"2003","unstructured":"Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamantals of Computer Security. Springer, Heidelberg (2003)"},{"issue":"2","key":"18_CR19","first-page":"471","volume":"6","author":"J. Pieprzyk","year":"2004","unstructured":"Pieprzyk, J., Zhang, X.: Characterisations of Ideal Threshold Schemes. Journal of Descrete Mathematics and Theoretical Computer Science (DMTCS)\u00a06(2), 471\u2013482 (2004)","journal-title":"Journal of Descrete Mathematics and Theoretical Computer Science (DMTCS)"},{"key":"18_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"R. Roth","year":"2006","unstructured":"Roth, R.: Introduction to Coding Theory. Cambridge Press, NY (2006)"},{"key":"18_CR21","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":"18_CR22","volume-title":"Cryptography: Theory and Practice","author":"D.R. Stinson","year":"1995","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice. CRC, Boca Raton (1995)"},{"key":"18_CR23","unstructured":"Bound for OAs with Index Unity, http:\/\/mint.sbg.ac.at\/desc_CBoundT0.html"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85093-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:21:48Z","timestamp":1606184508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850922","9783540850939"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}