{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T10:24:27Z","timestamp":1750501467611},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329456"},{"type":"electronic","value":"9783642329463"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32946-3_13","type":"book-chapter","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T04:56:16Z","timestamp":1344920176000},"page":"164-178","source":"Crossref","is-referenced-by-count":21,"title":["On Secure Two-Party Integer Division"],"prefix":"10.1007","author":[{"given":"Morten","family":"Dahl","sequence":"first","affiliation":[]},{"given":"Chao","family":"Ning","sequence":"additional","affiliation":[]},{"given":"Tomas","family":"Toft","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_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., Camenisch, 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":"13_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/72981.72995","volume-title":"Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing","author":"J. Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In: Rudnicki, P. (ed.) Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pp. 201\u2013209. ACM Press, New York (1989)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2009","unstructured":"Bogetoft, P., Christensen, D.L., Damg\u00e5rd, I., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 325\u2013343. Springer, Heidelberg (2009)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Catrina, O., Dragulin, C.: Multiparty computation of fixed-point multiplication and reciprocal. In: International Workshop on Database and Expert Systems Applications, pp. 107\u2013111 (2009)","DOI":"10.1109\/DEXA.2009.84"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty Computation from Threshold Homomorphic Encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"13_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.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Fitzi, M., Kiltz, E., Nielsen, J.B., 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":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Kim, K. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"13_CR10","unstructured":"Dahl, M., Ning, C., Toft, T.: On secure two-party integer division. Technical report (2012), \n                  \n                    http:\/\/eprint.iacr.org\/2012\/164"},{"key":"13_CR11","unstructured":"From, S., Jakobsen, T.: Secure multi-party computation on integers. Master\u2019s thesis, Aarhus University (2005), \n                  \n                    http:\/\/users-cs.au.dk\/tpj\/uni\/thesis\/"},{"key":"13_CR12","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, J.: Cryptocomputing with Rationals. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 136\u2013146. Springer, Heidelberg (2003)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-14577-3_32","volume-title":"Financial Cryptography and Data Security","author":"J. Guajardo","year":"2010","unstructured":"Guajardo, J., Mennink, B., Schoenmakers, B.: Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 375\u2013382. Springer, Heidelberg (2010)"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W. Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Mix Barrington, D.A.: Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computer and System Sciences\u00a065(4), 695\u2013716 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/1866307.1866358","volume-title":"CCS 2010: Proceedings of the 17th ACM Conference on Computer and Communications Security","author":"W. Henecka","year":"2010","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: CCS 2010: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 451\u2013462. ACM, New York (2010)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Grossman, R., Bayardo, R.J., Bennett, K.P. (eds.) KDD, pp. 593\u2013599. ACM (2005)","DOI":"10.1145\/1081870.1081942"},{"key":"13_CR17","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":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-40061-5_26","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: On Diophantine Complexity and Statistical Zero-Knowledge Arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 398\u2013415. Springer, Heidelberg (2003)"},{"key":"13_CR19","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":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-17373-8_28","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"C. Ning","year":"2010","unstructured":"Ning, C., Xu, Q.: Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 483\u2013500. Springer, Heidelberg (2010)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-14423-3_17","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"T. Reistad","year":"2010","unstructured":"Reistad, T., Toft, T.: Linear, Constant-Rounds Bit-Decomposition. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 245\u2013257. Springer, Heidelberg (2010)"},{"issue":"11","key":"13_CR23","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-19379-8_11","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"T. Toft","year":"2011","unstructured":"Toft, T.: Sub-linear, Secure Comparison with Two Non-colluding Parties. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 174\u2013191. Springer, Heidelberg (2011)"},{"key":"13_CR25","volume-title":"IEEE Workshop on Information Forensics and Security (WIFS 2010)","author":"T. Veugen","year":"2010","unstructured":"Veugen, T.: Encrypted integer division. In: IEEE Workshop on Information Forensics and Security (WIFS 2010). IEEE, Seattle (2010)"}],"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-32946-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:49:52Z","timestamp":1620114592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32946-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329456","9783642329463"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32946-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}