{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:33:11Z","timestamp":1725672791823},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291005"},{"type":"electronic","value":"9783642291012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29101-2_19","type":"book-chapter","created":{"date-parts":[[2012,4,2]],"date-time":"2012-04-02T04:10:23Z","timestamp":1333339823000},"page":"277-288","source":"Crossref","is-referenced-by-count":13,"title":["Secure Distributed Computation of the Square Root and Applications"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Liedel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1145\/100216.100287","volume-title":"Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, STOC 1990","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 503\u2013513. ACM, New York (1990)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 1\u201310. ACM, New York (1988)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"Security and Cryptography for Networks","author":"O. Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Improved Primitives for Secure Multiparty Integer Computation. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol.\u00a06280, pp. 182\u2013199. Springer, Heidelberg (2010)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-15497-3_9","volume-title":"Computer Security \u2013 ESORICS 2010","author":"O. Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Secure Multiparty Linear Programming Using Fixed-Point Arithmetic. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 134\u2013150. Springer, Heidelberg (2010)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-14577-3_6","volume-title":"Financial Cryptography and Data Security","author":"O. Catrina","year":"2010","unstructured":"Catrina, O., Saxena, A.: Secure Computation with Fixed-Point Numbers. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 35\u201350. Springer, Heidelberg (2010)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/62212.62214","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 11\u201319. ACM, New York (1988)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44647-8_7","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.: Secure Distributed Linear Algebra in a Constant Number of Rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 342\u2013362. Springer, Heidelberg (2005)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM, New York (1987)"},{"key":"19_CR10","unstructured":"Goldschmidt, R.E.: Applications of division by convergence. Master\u2019s thesis, M.I.T. (1964)"},{"key":"19_CR11","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press (1996)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/12.588066","volume":"46","author":"M. Ito","year":"1997","unstructured":"Ito, M., Takagi, N., Yajima, S.: Efficient initial approximation for multiplicative division and square root by a multiplication with operand modification. IEEE Transactions on Computers\u00a046, 495\u2013498 (1997)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR13","unstructured":"Markstein, P.: Software division and square root using goldschmidt\u2019s algorithms. In: 6th Conference on Real Numbers and Computers, pp. 146\u2013157 (2004)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM\u00a022, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"19_CR15","series-title":"Texts in applied mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21738-3","volume-title":"Introduction to numerical analysis","author":"J. Stoer","year":"2002","unstructured":"Stoer, J., Bulirsch, R.: Introduction to numerical analysis. Texts in applied mathematics. Springer, Heidelberg (2002)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/SFCS.1982.38","volume-title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982, pp. 160\u2013164. IEEE Computer Society, Washington, DC, USA (1982)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29101-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:36Z","timestamp":1620127416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29101-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291005","9783642291012"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29101-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}