{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:41:20Z","timestamp":1740242480966,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_28","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"510-528","source":"Crossref","is-referenced-by-count":10,"title":["Further Simplifications in Proactive RSA Signatures"],"prefix":"10.1007","author":[{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"first","affiliation":[]},{"given":"Nitesh","family":"Saxena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-47942-0_8","volume-title":"Information and Communication Security","author":"F. Boudot","year":"1999","unstructured":"Boudot, F., Traor\u00e9, J.: Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol.\u00a01726, pp. 87\u2013102. Springer, Heidelberg (1999)"},{"key":"28_CR4","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":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"J.L. Camenisch","year":"1999","unstructured":"Camenisch, J.L., Michels, M.: Proving in zero-knowledge that a number is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 107\u2013122. Springer, Heidelberg (1999)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","first-page":"106","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Separability and efficiency for generic group signature schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 106\u2013121. Springer, Heidelberg (1999)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"A.H. Chan","year":"1998","unstructured":"Chan, A.H., Frankel, Y., Tsiounis, Y.: Easy come - easy go divisible cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 561\u2013575. Springer, Heidelberg (1998), citeseer.ist.psu.edu\/chan98easy.html"},{"key":"28_CR9","first-page":"189","volume-title":"Cryptography and Coding","author":"R.A. Croft","year":"1989","unstructured":"Croft, R.A., Harris, S.P.: Public-key cryptography and re-usable shared secrets. In: Cryptography and Coding, May 1989, pp. 189\u2013201. Clarendon Press, Oxford (1989)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"28_CR11","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":"I.B. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Fujisaki, E.: 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":"28_CR12","doi-asserted-by":"crossref","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proc. 26th ACM Symp. on Theory of Computing, Montreal, Canada, pp. 522\u2013533 (1994)","DOI":"10.1145\/195058.195405"},{"key":"28_CR13","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.G. Desmedt","year":"1988","unstructured":"Desmedt, Y.G.: Society and Group Oriented Cryptosystems. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988)"},{"key":"28_CR14","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.G. Desmedt","year":"1990","unstructured":"Desmedt, Y.G., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Symposium on Foundations of Computer Science (FOCS), pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"28_CR16","unstructured":"Frankel, Y., Desmedt, Y.: Parallel reliable threshold multisignature. Technical Report TR-92-04-02, Dept. of EE and CS, U. of Winsconsin (April 1992)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal-resilience proactive public-key cryptosystems. In: 38th Symposium on Foundations of Computer Science FOCS, pp. 384\u2013393 (1997)","DOI":"10.1109\/SFCS.1997.646127"},{"key":"28_CR18","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., Gemmell, P.S., MacKenzie, P.D., Yung, M.: Proactive RSA. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 440\u2013454. Springer, Heidelberg (1997)"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., Yung, M.: Witness-based cryptographic program checking and robust function sharing. In: Proc. 28th ACM Symp. on Theory of Computing, Philadelphia, pp. 499\u2013508 (1996)","DOI":"10.1145\/237814.237998"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-48481-7_2","volume-title":"Algorithms - ESA\u201999","author":"Y. Frankel","year":"1999","unstructured":"Frankel, Y., MacKenzie, P., Yung, M.: Adaptively-secure distributed threshold public key systems. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 4\u201327. Springer, Heidelberg (1999)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-48000-6_15","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"Y. Frankel","year":"1999","unstructured":"Frankel, Y., MacKenzie, P.D., Yung, M.: Adaptively-secure optimal-resilience proactive RSA. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 180\u2013195. Springer, Heidelberg (1999)"},{"key":"28_CR22","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":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"28_CR24","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":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust Threshold DSS Signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 354\u2013371. Springer, Heidelberg (1996)"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 295\u2013310. Springer, Heidelberg (1999)"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., Yung, M.: Proactive public key and signature systems. In: ACM Conference on Computers and Communication Security, pp. 100\u2013110 (1997)","DOI":"10.1145\/266420.266442"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing, or how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Saxena, N., Yi, J.H.: An Attack on the Proactive RSA Signature Scheme in the URSA Ad Hoc Network Access Control Protocol. In: ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), October 2004, pp. 1\u20139 (2004)","DOI":"10.1145\/1029102.1029105"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Kong, J., Zerfos, P., Luo, H., Lu, S., Zhang, L.: Providing Robust and Ubiquitous Security Support for MANET. In: IEEE 9th International Conference on Network Protocols (ICNP), pp. 251\u2013260 (2001)","DOI":"10.1109\/ICNP.2001.992905"},{"key":"28_CR31","unstructured":"Luo, H., Lu, S.: Ubiquitous and Robust Authentication Services for Ad Hoc Wireless Networks. Technical Report TR-200030, Dept. of Computer Science, UCLA (2000), Available online at http:\/\/citeseer.ist.psu.edu\/luo00ubiquitous.html"},{"key":"28_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-39200-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Micciancio","year":"2003","unstructured":"Micciancio, D., Petrank, E.: Simulatable Commitments and Efficient Concurrent Zero-Knowledge. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 140\u2013159. Springer, Heidelberg (2003)"},{"key":"28_CR33","unstructured":"NIST. Digital signature standard (DSS). Technical Report 169. National Institute for Standards and Technology, August 30 (1991)"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: 10th ACM Symp. on the Princ. of Distr. Comp., pp. 51\u201361 (1991)","DOI":"10.1145\/112600.112605"},{"key":"28_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"28_CR36","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, pp. 89\u2013104. Springer, Heidelberg (1998)"},{"key":"28_CR37","doi-asserted-by":"crossref","unstructured":"Saxena, N., Tsudik, G., Yi, J.H.: Admission Control in Peer-to-Peer: Design and Performance Evaluation. In: ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), October 2003, pp. 104\u2013114 (2003)","DOI":"10.1145\/986858.986873"},{"issue":"3","key":"28_CR38","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"issue":"11","key":"28_CR39","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. CACM\u00a022(11), 612\u2013613 (1979)","journal-title":"CACM"},{"key":"28_CR40","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","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:16:27Z","timestamp":1740240987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}