{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:39Z","timestamp":1725558999789},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540244547"},{"type":"electronic","value":"9783540305804"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30580-4_9","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T15:51:09Z","timestamp":1278345069000},"page":"120-137","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing Robustness While Generating Shared Secret Safe Primes"],"prefix":"10.1007","author":[{"given":"Emil","family":"Ong","sequence":"first","affiliation":[]},{"given":"John","family":"Kubiatowicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","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)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J.L., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-45682-1_19","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Stern, J.: Fully distributed threshold RSA under standard assumptions. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 310\u2013330. Springer, Heidelberg (2001)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B., Koprowski, M.: Practical Threshold RSA Signatures Without a Trusted Dealer. Technical Report RS-00-30, Basic Research in Computer Science, University of Aarhus (2000)","DOI":"10.7146\/brics.v7i30.20164"},{"key":"9_CR5","unstructured":"Malkin, M., Wu, T., Boneh, D.: Experimenting with Shared Generation of RSA keys. In: Symposium on Network and Distributed System Security, pp. 43\u201356 (1999)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Shoup, V.: Signature Schemes Based on the Strong RSA Assumption. ACM Transactions on Information and System Security\u00a03, 161\u2013185 (2000)","journal-title":"ACM Transactions on Information and System Security"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-45539-6_14","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"D. Catalano","year":"2000","unstructured":"Catalano, D., Gennaro, R., Halevi, S.: Computing inverses over a shared secret modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 190\u2013207. Springer, Heidelberg (2000)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/502090.502094","volume":"48","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. Journal of the ACM (JACM)\u00a048, 702\u2013722 (2001)","journal-title":"Journal of the ACM (JACM)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Frankel, Y., MacKenzie, P.D., Yung, M.: Robust Efficient Distributed RSA-Key Generation. In: Annual ACM Symposium on Theory of Computing (1998)","DOI":"10.1145\/276698.276882"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-36108-1_2","volume-title":"Distributed Computing","author":"S. Goldwasser","year":"2002","unstructured":"Goldwasser, S., Lindell, Y.: Secure Multi-Party Computation Without Agreement. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 17\u201332. Springer, Heidelberg (2002)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022 (1979)","DOI":"10.1145\/359168.359176"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In: ASIACRYPT, pp. 125\u2013142 (2002)","DOI":"10.1007\/3-540-36178-2_8"},{"key":"9_CR13","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 1991","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":"9_CR14","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BFb0054015","volume-title":"Public Key Cryptography","author":"W. Mao","year":"1998","unstructured":"Mao, W.: Guaranteed correct sharing of integer factorization with off-line shareholders. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 60\u201371. Springer, Heidelberg (1998)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular Multiplication Without Trial Division. Mathematics of Computation\u00a044, 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Didier, L.S., Kornerup, P.: Modular Multiplication and Base Extensions in Residue Number Systems. In: Proceedings of the 15th IEEE Symposium on Computer Arithmetic, pp. 59\u201365 (2001)","DOI":"10.1109\/ARITH.2001.930104"},{"key":"9_CR18","unstructured":"C\u00b8 .K. Ko\u00b8c, Acar, T.: Fast Software Exponentiation in GF(2k). In: Symposium on Computer Arithmetic, pp. 225\u2013231 (1997)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-Cryptographic Fault-Tolerant Computing in a Constant Number of Rounds of Interaction. In: 8th ACM Symposium on Principles of Distributed Computation, pp. 201\u2013209 (1989)","DOI":"10.1145\/72981.72995"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0304-3975(01)00260-2","volume":"287","author":"Y. Frankel","year":"2002","unstructured":"Frankel, Y., MacKenzie, P., Yung, M.: Adaptively secure distributed public-key systems. Theoretical Computer Science\u00a0287, 535\u2013561 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30580-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:30Z","timestamp":1605741870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30580-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244547","9783540305804"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30580-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}