{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:07Z","timestamp":1747104187502},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677420"},{"type":"electronic","value":"9783540450306"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10718964_36","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T16:04:09Z","timestamp":1167408249000},"page":"443-456","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms to Speed Up Computations in Threshold RSA"],"prefix":"10.1007","author":[{"given":"Brian","family":"King","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_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, Heidelberg (1992)"},{"key":"36_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"36_CR3","volume-title":"Algorithmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. MIT Press, Cambridge (1996)"},{"key":"36_CR4","first-page":"241","volume-title":"Digital Multisignatures, Cryptography and coding","author":"C. Boyd","year":"1989","unstructured":"Boyd, C.: Digital Multisignatures, Cryptography and coding, pp. 241\u2013246. Clarendon Press, Oxford (1989)"},{"key":"36_CR5","volume-title":"A course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1996","unstructured":"Cohen, H.: A course in Computational Algebraic Number Theory. Springer, NY (1996)"},{"key":"36_CR6","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":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"Y. Desmedt","year":"1992","unstructured":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 457\u2013469. Springer, Heidelberg (1992)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Frankel, Y.: Homomorphic Zero Knowledge Threshold schemes over any finite Abelian Group Siam. J. Disc. Math.\u00a07(4), 667\u2013679","DOI":"10.1137\/S0895480192224713"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BFb0053750","volume-title":"Information Security and Privacy","author":"Y. Desmedt","year":"1998","unstructured":"Desmedt, Y., King, B., Kishimoto, W., Kurosawa, K.: A comment on the efficiency of secret sharing scheme over any finite abelian group. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol.\u00a01438, pp. 391\u2013402. Springer, Heidelberg (1998)"},{"key":"36_CR11","unstructured":"Frankel, Y., Desmedt, Y.: Parallel reliable threshold multisignature. Tech. report TR-92-04-02, Univ. of Wisconsin-Milwaukee (1992)"},{"key":"36_CR12","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":"36_CR13","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":"36_CR14","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":"36_CR15","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, NY (1982)"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T. Rabin","year":"1998","unstructured":"Rabin, T.: A Simplified Approach to threshold and proactive RSA. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 89. Springer, Heidelberg (1998)"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adelman, L.: A method for obtaining digital signatures and public key cryptosystems. Comm. ACM\u00a021, 294\u2013299 (1978)","journal-title":"Comm. ACM"},{"key":"36_CR18","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":"36_CR19","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, p. 207. Springer, Heidelberg (2000), http:\/\/philby.ucsd.edu\/cryptolib\/1999.html"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10718964_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:42:19Z","timestamp":1556005339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10718964_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677420","9783540450306"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/10718964_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}