{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T14:59:31Z","timestamp":1786978771655,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345466","type":"print"},{"value":"9783540345473","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11761679_35","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T10:11:19Z","timestamp":1152007879000},"page":"593-611","source":"Crossref","is-referenced-by-count":60,"title":["Simplified Threshold RSA with Adaptive and Proactive Security"],"prefix":"10.1007","author":[{"given":"Jes\u00fas F.","family":"Almansa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Almansa, J.F.: A Study for Cryptologic Protocols. PhD thesis, BRICS, University of Aarhus, Department of Computer Science, IT-parken, Aabogade 34, DK-8200 \u00c5rhus N, Denmark (2005)"},{"key":"35_CR2","unstructured":"Boyd, C. (ed.): Digital multisignatures. In: Cryptography and Coding. Oxford\u00a0University Press, Oxford, pp. 241\u2013246 (1989)"},{"key":"35_CR3","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science. In: FOCS 2001, p. 136 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication (Cryptology ePrint Archive) (August 2004). Corrected version of the paper in: Proceedings of the 17th IEEE Computer Security Foundations Workshop, pp. 219\u2013235 (2004)","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 98\u2013115. Springer, Heidelberg (1999)"},{"key":"35_CR7","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":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 247\u2013264. Springer, Heidelberg (2003)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"E. Fujisaki","year":"2002","unstructured":"Fujisaki, E., Damg\u00e5rd, I.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., Mackenzie, P., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, FOCS 1997, p. 384 (1997)","DOI":"10.1109\/SFCS.1997.646127"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BFb0052254","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"Y. Frankel","year":"1997","unstructured":"Frankel, Y., Gemmell, 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":"35_CR12","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., Yung, M.: Witness-based cryptographic program and robust function sharing. In: 28th Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 499\u2013508 (1996)","DOI":"10.1145\/237814.237998"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-44586-2_18","volume-title":"Public Key Cryptography","author":"Y. Frankel","year":"2001","unstructured":"Frankel, Y., MacKenzie, P.D., Yung, M.: Adaptive security for the additive-sharing based proactive RSA. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 240\u2013263. Springer, Heidelberg (2001)"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48390-X","volume-title":"Advances in Cryptology 1981 - 1997","author":"Y. Frankel","year":"1999","unstructured":"Frankel, Y.: A practical protocol for large group oriented networks. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol.\u00a01440, pp. 56\u201361. Springer, Heidelberg (1999)"},{"key":"35_CR15","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.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 157\u2013172. Springer, Heidelberg (1996)"},{"key":"35_CR16","unstructured":"Jakobsson, M., Jarecki, S., Krawczyk, H., Yung, M.: proactive RSA for constant-size thresholds (unpublished manuscript, 1995)"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-540-30576-7_28","volume-title":"Theory of Cryptography","author":"S. Jarecki","year":"2005","unstructured":"Jarecki, S., Saxena, N.: Further simplifications in proactive RSA signature schemes. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 510\u2013528. Springer, Heidelberg (2005)"},{"key":"35_CR18","unstructured":"Nielsen, J.B.: On Protocol Security in the Cryptographic Model. PhD thesis, BRICS, University of Aarhus, Department of Computer Science, IT-parken, Aabogade 34, DK-8200 \u00c5rhus N, Denmark (2004)"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attack. In: Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, PODC 1991, pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, pp. 89\u2013104. Springer, Heidelberg (1998)"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Santis, A.D., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: 26th Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 522\u2013533 (1994)","DOI":"10.1145\/195058.195405"},{"key":"35_CR22","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)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11761679_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T13:52:44Z","timestamp":1736430764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11761679_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345466","9783540345473"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11761679_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}