{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:32:53Z","timestamp":1778297573201,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440505","type":"print"},{"value":"9783540457084","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45708-9_27","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T04:48:16Z","timestamp":1192769296000},"page":"417-432","source":"Crossref","is-referenced-by-count":79,"title":["Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products"],"prefix":"10.1007","author":[{"given":"Joy","family":"Algesheimer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Camenisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"key":"27_CR1","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"J. Algesheimer, J. Camenisch, and V. Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. http:\/\/www.eprint.iacr.org\/2002\/029 , 2002.","DOI":"10.1007\/3-540-45708-9_27"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology \u2014 CRYPTO 2000, vol. 1880 of LNCS, pp. 255\u2013270, 2000.","DOI":"10.1007\/3-540-44598-6_16"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In 8th ACM PODC, pp. 201\u2013209, 1989.","DOI":"10.1145\/72981.72995"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. 20th STOC, pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Advances in Cryptology \u2014 CRYPTO\u2019 97, vol. 1296 of LNCS, pp. 425\u2013439, 1997.","DOI":"10.1007\/BFb0052253"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multishow credential system with optional anonymity revocation. In Advances in Cryptology \u2014 EUROCRYPT 2001, vol. 2045 of LNCS, pp. 93\u2013118, 2001.","DOI":"10.1007\/3-540-44987-6_7"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"D. Catalano, R. Gennaro, and S. Halevi. Computing inverses over a shared secret modulus. In EUROCRYPT 2000, vol. 1807 of LNCS, pp. 190\u2013206, 2000.","DOI":"10.1007\/3-540-45539-6_14"},{"key":"27_CR10","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1992","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, 1992."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM CCS, pp. 46\u201352. ACM press, nov 1999.","DOI":"10.1145\/319709.319716"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3):161\u2013185, 2000.","journal-title":"ACM Transactions on Information and System Security"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"I. Damg\u00f8ard and M. Koprowski. Practical threshold RSA signatures without a trusted dealer. In EUROCRYPT 2001, vol. 2045 of LNCS, pp. 152\u2013165, 2001.","DOI":"10.1007\/3-540-44987-6_10"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1:77\u201394, 1988.","journal-title":"Journal of Cryptology"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"P.-A. Fouque and J. Stern. Fully distributed threshold RSA under standard assumptions. In ASIACRYPT 2001, vol. 2248 of LNCS, pp. 310\u2013330, 2001.","DOI":"10.1007\/3-540-45682-1_19"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. MacKenzie, and M. Yung. Robust efficient distributed RSA key generation. In Proc. 30th Annual ACM STOC, pp. 663\u2013672, 1998.","DOI":"10.1145\/276698.276882"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"M. Franklin and S. Haber. Joint encryption and message-efficient secure computation. In CRYPTO\u2019 93, vol. 773 of LNCS, pp. 266\u2013277, 1994.","DOI":"10.1007\/3-540-48329-2_23"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In EUROCRYPT\u2019 99, vol. 1592 of LNCS, pp. 123\u2013139, 1999.","DOI":"10.1007\/3-540-48910-X_9"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Advances in Cryptology \u2014 CRYPT0\u2019 96, vol. 1109 of LNCS, pp. 157\u2013172, 1996.","DOI":"10.1007\/3-540-68697-5_13"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. 17th ACM PODC, 1998.","DOI":"10.1145\/277697.277716"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"T. Rabin. A simplified approach to threshold and proactive RSA. In Advances in Cryptology \u2014 CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 89\u2013104, 1998.","DOI":"10.1007\/BFb0055722"},{"issue":"11","key":"27_CR22","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. Communications of the ACM, 22(11):612\u2013613, Nov. 1979.","journal-title":"Communications of the ACM"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"V. Shoup. Practical threshold signatures. In Advances in Cryptology: EUROCRYPT 2000, vol. 1087 of LNCS, pp. 207\u2013220, 2000.","DOI":"10.1007\/3-540-45539-6_15"},{"key":"27_CR24","unstructured":"M. M. T. Wu and D. Boneh. Experimenting with shared generation of RSA keys. In Proceedings of the Internet Society\u2019s 1999 Symposium on Network and Distributed System Security (SNDSS), pp. 43\u201356, 1999."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45708-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:27:43Z","timestamp":1556904463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45708-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440505","9783540457084"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45708-9_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}