{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:28:31Z","timestamp":1778297311370,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633846","type":"print"},{"value":"9783540695288","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052253","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T18:37:31Z","timestamp":1155839851000},"page":"425-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":153,"title":["Efficient generation of shared RSA keys"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"30_CR1","unstructured":"N. Alon, Z. Galil and M. Yung, \u201cDynamic-resharing verifiable secret sharing,\u201d ESA 1995."},{"key":"30_CR2","unstructured":"D. Beaver, \u201cSecurity, fault tolerance, and communication complexity in distributed systems,\u201d Ph.D. thesis, Harvard University, May 1990."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, \u201cCompleteness theorems for noncryptographic fault tolerant distributed computation\u201d, STOC 1988, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"J. Benaloh (Cohen), \u201cSecret sharing homomorphisms: keeping shares of a secret secret,\u201d Crypto '86, 251\u2013260.","DOI":"10.1007\/3-540-47721-7_19"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Carter","year":"1979","unstructured":"J. Carter and M. Wegman, \u201cUniversal classes of hash functions\u201d, J. Comput. Syst. Sci. 18 (1979), 143\u2013154.","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd, \u201cMultiparty unconditionally secure protocols,\u201d ACM STOC 1988, 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"30_CR7","first-page":"803","volume":"53","author":"N. Bruijn De","year":"1950","unstructured":"N. De Bruijn, \u201dOn the number of uncanceled elements in the sieve of Eratosthenes\u201d, Proc. Neder. Akad. Wetensch, vol. 53, 1950, pp. 803\u2013812. Reviewed in LeVeque Reviews in Number Theory, Vol. 4, Section N-28, p. 221.","journal-title":"Proc. Neder. Akad. Wetensch"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"A. DeSantis, Y. Desmedt, Y. Frankel, M. Yung, \u201cHow to share a function securely\u201d, STOC 1994, pp. 522\u2013533.","DOI":"10.1145\/195058.195405"},{"issue":"No.4","key":"30_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. Desmedt","year":"1994","unstructured":"Y. Desmedt, \u201cThreshold cryptography,\u201d European Transactions on Telecommunications and Related Technologies, Vol. 5, No. 4, July\u2013August 1994, pp. 35\u201343.","journal-title":"European Transactions on Telecommunications and Related Technologies"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Y. Desmedt and Y. Frankel, \u201cShared generation of authenticators and signatures\u201d, Crypto '91, 457\u2013469.","DOI":"10.1007\/3-540-46766-1_37"},{"key":"30_CR11","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, \u201cZero-knowledge proofs of identity,\u201d Journal of Cryptology 1 (1988), 77\u201394.","journal-title":"Journal of Cryptology"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir, \u201cHow to prove yourself: Practical solutions to identification and signature problems,\u201d Crypto '86, 186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Y. Frankel, \u201cA practical protocol for large group oriented networks\u201d, Eurocrypt 89, pp. 56\u201361.","DOI":"10.1007\/3-540-46885-4_8"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M. Franklin","year":"1996","unstructured":"M. Franklin and S. Haber, \u201cJoint encryption and message-efficient secure computation,\u201d Journal of Cryptology, 9 (1996), 217\u2013232.","journal-title":"Journal of Cryptology"},{"issue":"No.5","key":"30_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"R. Fagin, M. Naor, P. Winkler, \u201cComparing information without leaking it\u201d, CACM, Vol 39, No. 5, May 1996, pp. 77\u201385.","journal-title":"CACM"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, \u201cRobust and efficient sharing of RSA functions\u201d, Crypto 96, pp. 157\u2013172.","DOI":"10.1007\/3-540-68697-5_13"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, \u201cHow to play any mental game\u201d, STOC 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"J. Gordon, \u201cStrong primes are easy to find\u201d, Eurocrypt 84, pp. 216\u2013223.","DOI":"10.1007\/3-540-39757-4_19"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"L. Guillou and J. Quisquater, \u201cA practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory,\u201d Eurocrypt '88, 123\u2013128.","DOI":"10.1007\/3-540-45961-8_11"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"K. Ohta and T. Okamoto, \u201cA modification of the Fiat-Shamir scheme,\u201d Crpto '88, 232\u2013243.","DOI":"10.1007\/0-387-34799-2_17"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"H. Ong and C. Schnorr, \u201cFast signature generation with a Fiat Shamir-like scheme,\u201d Eurocrypt '90, 432\u2013440.","DOI":"10.1007\/3-540-46877-3_38"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"T. Pederson, \u201cA threshold cryptosystem without a trusted party,\u201d Proceedings of Eurocrypt 91, pp. 522\u2013526.","DOI":"10.1007\/3-540-46416-6_47"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M. Rabin","year":"1980","unstructured":"M. Rabin, \u201cProbabilistic algorithm for testing primality\u201d, J. of Number Theory, vol. 12, pp. 128\u2013138, 1980.","journal-title":"J. of Number Theory"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"R. Solovay, V. Strassen, \u201cA fast monte carlo test for primality\u201d, SIAM journal of computing, vol. 6, pp. 84\u201385, 1977.","journal-title":"SIAM journal of computing"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and J. Carter, \u201cNew hash functions and their use in authentication and set equality\u201d, J. Comput. Syst. Sci. 22 (1981), 265\u2013279.","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"A. Yao, \u201cHow to generate and exchange secrets\u201d, FOCS 1986, pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T01:11:14Z","timestamp":1707181874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052253"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0052253","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}