{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:49:54Z","timestamp":1774950594875,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642145766","type":"print"},{"value":"9783642145773","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14577-3_6","type":"book-chapter","created":{"date-parts":[[2010,7,16]],"date-time":"2010-07-16T08:11:34Z","timestamp":1279267894000},"page":"35-50","source":"Crossref","is-referenced-by-count":151,"title":["Secure Computation with Fixed-Point Numbers"],"prefix":"10.1007","author":[{"given":"Octavian","family":"Catrina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitabh","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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., Camenish, J., 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":"6_CR2","unstructured":"Atallah, M., Blanton, M., Deshpande, V., Frikken, K., Li, J., Schwarz, L.: Secure Collaborative Planning, Forecasting, and Replenishment (SCPFR). In: Multi-Echelon\/Public Applications of Supply Chain Management Conference (2006)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Atallah, M., Bykova, M., Li, J., Frikken, K., Topkara, M.: Private Collaborative Forecasting and Benchmarking. In: Proc. WPES 2004, Washington (2004)","DOI":"10.1145\/1029179.1029204"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10207-006-0001-y","volume":"5","author":"F. Brandt","year":"2006","unstructured":"Brandt, F.: How to obtain full privacy in auctions. International Journal of Information Security\u00a05(4), 201\u2013216 (2006)","journal-title":"International Journal of Information Security"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/DEXA.2009.84","volume-title":"Proc. 20th International Workshop on Database and Expert Systems Application (DEXA 2009)","author":"O. Catrina","year":"2009","unstructured":"Catrina, O., Dragulin, C.: Multiparty Computation of Fixed-Point Multiplication and Reciprocal. In: Proc. 20th International Workshop on Database and Expert Systems Application (DEXA 2009), pp. 107\u2013111. IEEE Computer Society, Los Alamitos (2009)"},{"key":"6_CR6","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":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","first-page":"142","volume-title":"Financial Cryptography and Data Security","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Nielsen, J., Toft, T., Pagter, J.I., Jakobsen, T., Bogetoft, P., Nielsen, K.: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 142\u2013147. Springer, Heidelberg (2006)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-72540-4_24","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Non-interactive Proofs for Integer Multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 412\u2013429. Springer, Heidelberg (2007)"},{"key":"6_CR11","unstructured":"Damgard, I., Thorbek, R.: Efficient Conversion of Secret-shared Values Between Different Fields. In: Cryptology ePrint Archive, Report 2008\/221 (2008)"},{"key":"6_CR12","volume-title":"Digital Arithmetic","author":"M.D. Ercegovac","year":"2003","unstructured":"Ercegovac, M.D., Lang, T.: Digital Arithmetic. Morgan Kaufmann, San Francisco (2003)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-36504-4_10","volume-title":"Financial Cryptography","author":"P. Fouque","year":"2003","unstructured":"Fouque, P., Stern, J., Wackers, G.: CryptoComputing with Rationals. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 136\u2013146. Springer, Heidelberg (2003)"},{"key":"6_CR14","unstructured":"From, S.L., Jakobsen, T.: Secure Multi-Party Computation on Integers. Master\u2019s thesis, Univ. of Aarhus, Denmark, BRICS, Dep. of Computer Science (2006)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-30576-7_16","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2005","unstructured":"Kiltz, E., Leander, G., Malone-Lee, J.: Secure Computation of the Mean and Related Statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 283\u2013302. Springer, Heidelberg (2005)"},{"key":"6_CR16","unstructured":"Markstein, P.: Software Division and Square Root Using Goldschmidt\u2019s Algorithms. In: Proc. 6th Conference on Real Numbers and Computers, pp. 146\u2013157 (2004)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Masayuki Ito, N.T., Yajima, S.: Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification. IEEE Transactions on Computers\u00a046(4) (1997)","DOI":"10.1109\/12.588066"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T. Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 343\u2013360. Springer, Heidelberg (2007)"},{"key":"6_CR19","unstructured":"Toft, T.: Primitives and Applications for Multi-party Computation. PhD dissertation, Univ. of Aarhus, Denmark, BRICS, Dep. of Computer Science (2007)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-03549-4_6","volume-title":"Financial Cryptography and Data Security","author":"T. Toft","year":"2009","unstructured":"Toft, T.: Solving Linear Programs Using Multiparty Computation. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 90\u2013107. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14577-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:54:59Z","timestamp":1606186499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14577-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145766","9783642145773"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14577-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}