{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T14:22:27Z","timestamp":1737037347978,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438618"},{"type":"electronic","value":"9783540454502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45450-0_7","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T20:53:10Z","timestamp":1179607990000},"page":"89-106","source":"Crossref","is-referenced-by-count":0,"title":["Requirements for Group Independent Linear Threshold Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"Brian","family":"King","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"7_CR1","volume-title":"Algebra, an approach via module theory","author":"W. Adkins","year":"1992","unstructured":"W. Adkins and S. Weintrab. Algebra, an approach via module theory. Springer-Verlag, NY, 1992."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01202040","volume":"6","author":"A. Beimel","year":"1997","unstructured":"A. Beimel, A. G\u2019al, and M. Paterson. Lower bounds for monotone span programs. Computational Complexity, 6(1):29\u201345, 1997.","journal-title":"Computational Complexity"},{"key":"7_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advances in Cryptology-Eurocrypt\u2019 96","author":"S. Blackburn","year":"1996","unstructured":"S. Blackburn, M. Burmester, Y. Desmedt, and P. Wild. \u201cEfficient Multiplicative Sharing schemes\u201d. In Advances in Cryptology-Eurocrypt\u2019 96, LNCS 1070, pp. 107\u2013118, Springer-Verlag, 1996."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/18.370169","volume":"41","author":"C. Blundo","year":"1995","unstructured":"C. Blundo, A. De Santis, A.G. Gaggia, and U. Vaccaro. \u201cNew Bounds on the Information rate of Secret Sharing Schemes\u201d. In IEEE Trans. on Inform. Theory, 41, no. 2, pp. 549\u2013554, 1995.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C. Blundo","year":"1997","unstructured":"C. Blundo, A. De Santis, R. De Simone,, and U. Vaccaro. \u201cTight Bounds on the Information rate of secret Sharing Schemes\u201d. In Design, Codes and Cryptography, 11, pp. 107\u2013122, 1997.","journal-title":"Design, Codes and Cryptography"},{"key":"7_CR6","unstructured":"C. Boyd, Digital Multisignatures, Cryptography and coding, Clarendon Press, 1989, pp 241\u2013246."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R.M. Capocelli","year":"1993","unstructured":"R.M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, \u201cOn the Size of Shares for secret Sharing Schemes\u201d In Journal of Cryptology, 6, pp. 157\u2013167, 1993.","journal-title":"Journal of Cryptology"},{"key":"7_CR8","unstructured":"R. Cramer. Personal communication"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L. Csirmaz","year":"1997","unstructured":"L. Csirmaz. \u201cThe Size of a Share Must Be large\u201d. In Journal of Cryptology, 10, pp. 223\u2013231, 1997.","journal-title":"Journal of Cryptology"},{"key":"7_CR10","volume-title":"Advanced Calculus with applications","author":"N. Lillo De","year":"1982","unstructured":"N. De Lillo. Advanced Calculus with applications. MacMillan, NY, 1982."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. \u201cHow to share a function\u201d. In Proceedings of the twenty-sixth annual ACM Symp. Theory of Computing (STOC), pp. 522\u2013533, 1994.","DOI":"10.1145\/195058.195405"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Y. Desmedt. Society and group oriented cryptography: a new concept. In Advances of Cryptology-Crypto\u2019 87","DOI":"10.1007\/3-540-48184-2_8"},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0000421","volume-title":"Advances in Cryptology-Asiacrypt\u2019 94","author":"Y. Desmedt","year":"1995","unstructured":"Y. Desmedt, G. Di Crescenzo, and M. Burmester. \u201cMultiplicative non-Abelian sharing schemes and their application to threshold cryptography\u201d. In Advances in Cryptology-Asiacrypt\u2019 94, LNCS 917. pp. 21\u201332, Springer-Verlag, 1995."},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Y. Desmedt and Y. Frankel. \u201cHomomorphic zero-knowledge threshold schemes over any finite Abelian group\u201d. In Siam J. Disc. Math. vol 7, no. 4 pp. 667\u2013679, SIAM, 1994.","journal-title":"Siam J. Disc. Math."},{"key":"7_CR15","unstructured":"Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its applications. Tech. Report ISSE-TR-97-01, George Mason University, July 1997 ftp:\/\/isse.gmu.edu\/pub\/techrep\/97.01.jajodia.ps.gz"},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BFb0053750","volume-title":"Information Security and Privacy, ACISP\u201998 (Third Australasian Conference on Information Security and Privacy)","author":"Y. Desmedt","year":"1998","unstructured":"Y. Desmedt, B. King, W. Kishimoto, and K. Kurosawa, \u201cA comment on the efficiency of secret sharing scheme over any finite Abelian group\u201d, In Information Security and Privacy, ACISP\u201998 (Third Australasian Conference on Information Security and Privacy), LNCS 1438, 1998, 391\u2013402."},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-48071-4_39","volume":"740","author":"Y. Frankel","year":"1992","unstructured":"Y. Frankel, Y. Desmedt, and M. Burmester. \u201c Non-existence of homomorphic general sharing schemes for some key spaces\u201d, in Advances of Cryptology-Crypto\u2019 92, 740, 1992 pp 549\u2013557","journal-title":"Advances of Cryptology-Crypto\u2019 92"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmel, P. Mackenzie, and M. Yung. \u201cOptimal-Resilience Proactive Public-key Cryptosystems\u201d. In Proc. 38th FOCS, IEEE, 1997, p. 384\u2013393.","DOI":"10.1109\/SFCS.1997.646127"},{"key":"7_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances of Cryptology-Crypto\u2019 96","author":"R. Gennaro","year":"1996","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. \u201cRobust and efficient sharing of RSA functions\u201d. In Advances of Cryptology-Crypto\u2019 96, LNCS 1109, Springer Verlag, 1996, p. 157\u2013172."},{"key":"7_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6101-8","volume-title":"Algebra","author":"T. Hungerford","year":"1974","unstructured":"T. Hungerford. Algebra. Springer-Verlag, NY, 1974."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"M. Karchmer and A. Wigderson. On span programs In Proc. of 8 th annual Complexity Theory Conference, pp 102\u2013111, 1993.","DOI":"10.1109\/SCT.1993.336536"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E. Karnin","year":"1983","unstructured":"E. Karnin, J. Greene, and M. Hellman. \u201cOn secret sharing systems.\u201d In IEEE Trans. Inform. Theory, 29(1), pp. 35\u201341, 1983.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-68130-1","volume-title":"Introduction to Number Theory","author":"H.L. Keng","year":"1982","unstructured":"H.L. Keng. Introduction to Number Theory. Springer Verlag, NY 1982"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"B. King. \u201cRandomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group\u201d. In ACISP 2001. pp. 376\u2013391.","DOI":"10.1007\/3-540-47719-5_30"},{"key":"7_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6465-2","volume-title":"Applied Abstract Algebra","author":"R. Lidl","year":"1984","unstructured":"R. Lidl and G. Pilz. Applied Abstract Algebra. Springer Verlag, NY 1984"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adelman, A method for obtaining digital signatures and public key cryptosystems, Comm. ACM, 21(1978), pp 294\u2013299.","journal-title":"Comm. ACM"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Comm. ACM, 22(1979), pp 612\u2013613.","journal-title":"Comm. ACM"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1008259214236","volume":"12","author":"M. Dijk van","year":"1997","unstructured":"M. van Dijk. \u201cA Linear Construction of Secret Sharing Schemes\u201d. In Design, Codes and Cryptography 12, pp. 161\u2013201, 1997.","journal-title":"Design, Codes and Cryptography"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45450-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T13:32:05Z","timestamp":1737034325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45450-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438618","9783540454502"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45450-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}