{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:28:16Z","timestamp":1725560896833},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208273"},{"type":"electronic","value":"9783540245919"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24591-9_32","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:36:56Z","timestamp":1280389016000},"page":"425-441","source":"Crossref","is-referenced-by-count":1,"title":["A Comment on Group Independent Threshold Sharing"],"prefix":"10.1007","author":[{"given":"Brian","family":"King","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","volume-title":"Algebra, an approach via module theory","author":"W. Adkins","year":"1992","unstructured":"Adkins, W., Weintrab, S.: Algebra, an approach via module theory. Springer, New York (1992)"},{"key":"32_CR2","unstructured":"Beimel, A.: Secure schemes for secret sharing and key distribution. Ph.D.-thesis, Technion, Haifa (June 1996)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","first-page":"274","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Benaloh","year":"1988","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0765, pp. 274\u2013285. Springer, Heidelberg (1988)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"S. Blackburn","year":"1996","unstructured":"Blackburn, S., Burmester, M., Desmedt, Y., Wild, P.: Efficient Multiplicative Sharing schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 107\u2013118. Springer, Heidelberg (1996)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Blundo, C., De Santis, A., Vaccaro, U.: Randomness in Distribution Protocols. Inform. Comput, 111\u2013139 (1996)","DOI":"10.1006\/inco.1996.0095"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008242111272","volume":"11","author":"C. Blundo","year":"1997","unstructured":"Blundo, C., Gaggia, A.G., Stinson, D.R.: On the Dealer\u2019s randomness Required in Secret Sharing Schemes. Design, Codes and Cryptography\u00a011, 235\u2013259 (1997)","journal-title":"Design, Codes and Cryptography"},{"issue":"7","key":"32_CR7","first-page":"367","volume":"5","author":"C. Blundo","year":"1999","unstructured":"Blundo, C., Masucci, B.: Randomness in Multi-Secret Sharing Schemes. Journal of Universal Computer Science\u00a05(7), 367\u2013389 (1999)","journal-title":"Journal of Universal Computer Science"},{"issue":"1","key":"32_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.3233\/JCS-1999-7104","volume":"7","author":"C. Blundo","year":"1999","unstructured":"Blundo, C., Masucci, B.: A note on the Randomness in Dynamic Threshold Scheme. Journal of Computer Security\u00a07(1), 73\u201385 (1999)","journal-title":"Journal of Computer Security"},{"key":"32_CR9","first-page":"241","volume-title":"Cryptography and coding","author":"C. Boyd","year":"1989","unstructured":"Boyd, C.: Digital Multisignatures. In: Cryptography and coding, pp. 241\u2013246. Clarendon Press, Oxford (1989)"},{"key":"32_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":"Advances in Cryptology - 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, p. 272. Springer, Heidelberg (2002)"},{"key":"32_CR11","first-page":"429","volume":"32","author":"L. Csirmaz","year":"1996","unstructured":"Csirmaz, L.: The dealer\u2019s random bits in perfect sharing schemes. Studia Sci. Math. Hungar.\u00a032, 429\u2013437 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"issue":"5","key":"32_CR12","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1109\/18.771255","volume":"45","author":"A. Santis De","year":"1999","unstructured":"De Santis, A., Masucucci, B.: Multiple Ramp Schemes. IEEE Transns. on Inform. Theory\u00a045(5), 1720\u20131728 (1999)","journal-title":"IEEE Transns. on Inform. Theory"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function. In: Proceedings of the twenty-sixth annual ACM Symp. Theory of Computing (STOC), pp. 522\u2013533 (1994)","DOI":"10.1145\/195058.195405"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"Y. Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0000421","volume-title":"Advances in Cryptology - ASIACRYPT \u201994","author":"Y. Desmedt","year":"1995","unstructured":"Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative non-Abelian sharing schemes and their application to threshold cryptography. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol.\u00a0917, pp. 21\u201332. Springer, Heidelberg (1995)"},{"issue":"4","key":"32_CR16","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y., Frankel, Y.: Homomorphic zero-knowledge threshold schemes over any finite Abelian group. Siam J. Disc. Math.\u00a07(4), 667\u2013679 (1994)","journal-title":"Siam J. Disc. Math."},{"key":"32_CR17","unstructured":"Desmedt, Y., Jajodia, S.: 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":"32_CR18","unstructured":"Fehr, S.: Efficient Construction of the Dual Span Program, Manuscript, ETH Zurich (May 1999)"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BFb0052254","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"Y. Frankel","year":"1997","unstructured":"Frankel, Y., Gemmel, P., Mackenzie, P., Yung, M.: Proactive RSA. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 440\u2013454. Springer, Heidelberg (1997)"},{"key":"32_CR20","first-page":"384","volume-title":"Proc. 38th FOCS","author":"Y. Frankel","year":"1997","unstructured":"Frankel, Y., Gemmel, P., Mackenzie, P., Yung, M.: Optimal-Resilience Proactive Public-key Cryptosystems. In: Proc. 38th FOCS, pp. 384\u2013393. IEEE, Los Alamitos (1997)"},{"key":"32_CR21","unstructured":"Gal, A.: Combinatorial methods in boolean function complexity. Ph.D.-thesis, University of Chicago (1995)"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 157\u2013172. Springer, Heidelberg (1996)"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proc. of 8th annual Complexity Theory Conference, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"32_CR24","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":"Keng, H.L.: Introduction to Number Theory. Springer, New York (1982)"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-47719-5_30","volume-title":"Information Security and Privacy","author":"B. King","year":"2001","unstructured":"King, B.: Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol.\u00a02119, pp. 376\u2013391. Springer, Heidelberg (2001)"},{"key":"32_CR26","unstructured":"King, B.: Some results in linear secret sharing. Ph.D. thesis, University of Wisconsin Milwaukee (2001)"},{"key":"32_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/b13389","volume-title":"Information Security Applications","author":"B. King","year":"2003","unstructured":"King, B.: A comment on group independent threshold sharing. In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol.\u00a02908, pp. 471\u2013488. Springer, Heidelberg (2003)"},{"key":"32_CR28","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":"32_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 207\u2013220. Springer, Heidelberg (2000)"},{"key":"32_CR30","volume-title":"Cryptography, Theory and Practice","author":"D. Stinson","year":"1995","unstructured":"Stinson, D.: Cryptography, Theory and Practice. CRC Press, New York (1995)"},{"key":"32_CR31","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1008259214236","volume":"12","author":"M. Dijk van","year":"1997","unstructured":"van Dijk, M.: A Linear Construction of Secret Sharing Schemes. Design, Codes and Cryptography\u00a012, 161\u2013201 (1997)","journal-title":"Design, Codes and Cryptography"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24591-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:40:45Z","timestamp":1559346045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24591-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208273","9783540245919"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24591-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}