{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:29:04Z","timestamp":1761708544182},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145766"},{"type":"electronic","value":"9783642145773"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14577-3_32","type":"book-chapter","created":{"date-parts":[[2010,7,16]],"date-time":"2010-07-16T04:11:34Z","timestamp":1279253494000},"page":"375-382","source":"Crossref","is-referenced-by-count":23,"title":["Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Guajardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Mennink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_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":"32_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1411328.1411344","volume-title":"MM&Sec 2008","author":"T. Bianchi","year":"2008","unstructured":"Bianchi, T., Piva, A., Barni, M.: Efficient pointwise and blockwise encrypted operations. In: MM&Sec 2008, pp. 85\u201390. ACM, New York (2008)"},{"key":"32_CR3","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":"32_CR4","first-page":"107","volume-title":"DEXA 2009","author":"O. Catrina","year":"2009","unstructured":"Catrina, O., Dragulin, C.: Multiparty computation of fixed-point multiplication and reciprocal. In: DEXA 2009, pp. 107\u2013111. IEEE Computer Society, Los Alamitos (2009)"},{"key":"32_CR5","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.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"32_CR6","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":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-73458-1_30","volume-title":"Information Security and Privacy","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: Efficient and secure comparison for on-line auctions. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 416\u2013430. Springer, Heidelberg (2007)"},{"key":"32_CR8","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.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"32_CR9","first-page":"102","volume-title":"ACSAC 2001","author":"W. Du","year":"2001","unstructured":"Du, W., Atallah, M.: Privacy-preserving cooperative statistical analysis. In: ACSAC 2001, pp. 102\u2013112. IEEE Computer Society, Los Alamitos (2001)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-03168-7_14","volume-title":"Privacy Enhancing Technologies","author":"Z. Erkin","year":"2009","unstructured":"Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 235\u2013253. Springer, Heidelberg (2009)"},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M. Franklin","year":"1996","unstructured":"Franklin, M., Haber, S.: Joint encryption and message-efficient secure computation. Journal of Cryptology\u00a09(4), 217\u2013232 (1996)","journal-title":"Journal of Cryptology"},{"issue":"5","key":"32_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/32.502223","volume":"22","author":"M. Franklin","year":"1996","unstructured":"Franklin, M., Reiter, M.: The design and implementation of a secure auction service. IEEE Transactions on Software Engineering\u00a022(5), 302\u2013312 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"32_CR13","unstructured":"From, S., Jakobsen, T.: Secure multi-party computation on integers. Master\u2019s thesis, University of \u00c5rhus, \u00c5rhus (2006), \n                  \n                    http:\/\/www.cs.au.dk\/~tpj\/uni\/thesis\/report.pdf"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-71677-8_22","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"J. Garay","year":"2007","unstructured":"Garay, J., Schoenmakers, B., Villegas, J.: Practical and secure solutions for integer comparison. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 330\u2013342. Springer, Heidelberg (2007)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/11496137_32","volume-title":"Applied Cryptography and Network Security","author":"J. Groth","year":"2005","unstructured":"Groth, J.: Non-interactive zero-knowledge arguments for voting. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 467\u2013482. Springer, Heidelberg (2005)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Guajardo, J., Mennink, B., Schoenmakers, B.: Modulo reduction for Paillier encryptions and application to secure statistical analysis. Full version of this paper, available from the authors (2009)","DOI":"10.1007\/978-3-642-14577-3_32"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-03549-4_3","volume-title":"Financial Cryptography and Data Security","author":"A. Kiayias","year":"2009","unstructured":"Kiayias, A., Yener, B., Yung, M.: Privacy-preserving information markets for computing statistical data. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 32\u201350. Springer, Heidelberg (2009)"},{"key":"32_CR18","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":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"32_CR20","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":"32_CR21","unstructured":"Schoenmakers, B., Sidorenko, A.: Distributed generation of uniformly random bounded integers (October 1, 2007) (unpublished manuscript)"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-30539-2_10","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"B. Schoenmakers","year":"2004","unstructured":"Schoenmakers, B., Tuyls, P.: Practical two-party computation based on the conditional gate. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 119\u2013136. Springer, Heidelberg (2004)"},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/11761679_31","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"B. Schoenmakers","year":"2006","unstructured":"Schoenmakers, B., Tuyls, P.: Efficient binary conversion for Paillier encrypted values. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 522\u2013537. Springer, Heidelberg (2006)"},{"key":"32_CR24","unstructured":"SecureSCM. Secure computation models and frameworks. Technical Report D9.1, SecureSCM (July 2008), \n                  \n                    http:\/\/www.securescm.org"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14577-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:39:28Z","timestamp":1578519568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14577-3_32"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145766","9783642145773"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14577-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}