{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T05:35:40Z","timestamp":1678080940642},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T00:00:00Z","timestamp":1589241600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T00:00:00Z","timestamp":1589241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00145-020-09349-w","type":"journal-article","created":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T00:02:43Z","timestamp":1589241763000},"page":"1362-1403","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Oblivious Sampling with Applications to Two-Party k-Means Clustering"],"prefix":"10.1007","volume":"33","author":[{"given":"Paul","family":"Bunn","sequence":"first","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,12]]},"reference":[{"key":"9349_CR1","doi-asserted-by":"crossref","unstructured":"D. Agrawal, C. Aggarwal, On the design and quantification of privacy preserving data mining algorithms, in Proc. of the 20th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (2001), pp. 247\u2013255","DOI":"10.1145\/375551.375602"},{"key":"9349_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, R. Srikant, Privacy-preserving data mining, in Proc. of the 2000 ACM SIGMOD Int. Conf. on Management of Data (2000), pp. 439\u2013450","DOI":"10.1145\/335191.335438"},{"key":"9349_CR3","doi-asserted-by":"crossref","unstructured":"J. Algesheimer, J. Camenish, V. Shoup, Efficient computation modulo a shared secret with application to the generation of shared safe-prime products, in CRYPTO\u201902, LNCS 2442 (2002), pp. 417\u2013432","DOI":"10.1007\/3-540-45708-9_27"},{"key":"9349_CR4","doi-asserted-by":"crossref","unstructured":"A. Blum, C. Dwork, F. McSherry, K. Nissim, Practical privacy: the SuLQ framework, in 24th Symposium on Principles of Database Systems (2005), pp. 128\u2013138","DOI":"10.1145\/1065167.1065184"},{"key":"9349_CR5","unstructured":"P. Bradley, U. Fayyad, Refining initial points for $$K$$-means clustering, in Proc. of the 15th International Conference on Machine Learning (1998), pp. 91\u201399"},{"issue":"1","key":"9349_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol., 13(1) 143\u2013202. (2000)","journal-title":"J. Cryptol."},{"key":"9349_CR7","doi-asserted-by":"crossref","unstructured":"O. Catrina, A. Saxena, Secure computation with fixed-point numbers, in 14th Financial Cryptography and Data Security (2010), pp. 35\u201350","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"9349_CR8","doi-asserted-by":"crossref","unstructured":"M. Ciampi, R. Ostrovsky, L. Siniscalchi, I. Visconti, Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds, in 15th Theory of Cryptography (TCC) (2017), pp. 711\u2013742","DOI":"10.1007\/978-3-319-70500-2_24"},{"key":"9349_CR9","doi-asserted-by":"crossref","unstructured":"M. Dahl, C. Ning, T. Toft, On secure two-party integer division, in 16th Financial Cryptography and Data Security (2012), pp. 164\u2013178","DOI":"10.1007\/978-3-642-32946-3_13"},{"key":"9349_CR10","doi-asserted-by":"crossref","unstructured":"C. Dwork, F. McSherry, K. Nissim, A. Smith, Calibrating noise to sensitivity private data analysis, in Proc. of the 3rd Theory of Cryptography Conference (2006), pp. 265\u2013284","DOI":"10.1007\/11681878_14"},{"key":"9349_CR11","doi-asserted-by":"crossref","unstructured":"I. Dinur, K. Nissim, Revealing information while preserving privacy, in Proc. of the 22nd ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (2003), pp. 202\u2013210","DOI":"10.1145\/773153.773173"},{"key":"9349_CR12","doi-asserted-by":"crossref","unstructured":"C. Dwork, K. Nissim, Privacy-preserving datamining on vertically partitioned data- bases, in CRYPTO\u201904, LNCS 3152 (2004), pp. 528\u2013544","DOI":"10.1007\/978-3-540-28628-8_32"},{"key":"9349_CR13","unstructured":"S. From, T. Jakobsen, Secure multi-party computation on integers. Master\u2019s thesis, Univ. of Aarhus, Denmark, BRICS, Dep. of Computer Science (2006)"},{"key":"9349_CR14","doi-asserted-by":"crossref","unstructured":"B. Goethals, S. Laur, H. Lipmaa, T. Mielik\u00e4inen, On private scalar product computation for privacy-preserving data mining, in ICISC, LNCS 3506. (2004), pp. 104\u2013120","DOI":"10.1007\/11496618_9"},{"key":"9349_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography, Basic Applications","author":"O Goldreich","year":"2004","unstructured":"O. Goldreich, The Foundations of Cryptography, Basic Applications (Cambridge University Press, Cambridge, 2004)"},{"key":"9349_CR16","doi-asserted-by":"crossref","unstructured":"J. Guajardo, B. Mennink, B. Schoenmakers, Modulo reduction for paillier encryptions and application to secure statistical analysis, in 14th Financial Cryptography and Data Security (2010), pp. 375\u2013382","DOI":"10.1007\/978-3-642-14577-3_32"},{"key":"9349_CR17","doi-asserted-by":"crossref","unstructured":"Y. Isahi, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, in ACM Symposium on Theory of Computing (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"9349_CR18","doi-asserted-by":"crossref","unstructured":"G. Jagannathan, R. Wright, Privacy-preserving distributed $$k$$-means clustering over arbitrarily partitioned data, in KDD\u201905 (2005), pp. 593\u2013599","DOI":"10.1145\/1081870.1081942"},{"key":"9349_CR19","doi-asserted-by":"crossref","unstructured":"S. Jha, L. Kruger, P. McDaniel, Privacy Preserving Clustering, in 10th European Symp. on Research in Computer Security (2005), pp. 397\u2013417","DOI":"10.1007\/11555827_23"},{"key":"9349_CR20","doi-asserted-by":"crossref","unstructured":"E. Kiltz, G. Leander, J. Malone-Lee, Secure computation of the mean and related statistics, in TCC\u201905, LNCS 3378 (2005), pp. 283\u2013302","DOI":"10.1007\/978-3-540-30576-7_16"},{"key":"9349_CR21","doi-asserted-by":"crossref","unstructured":"Y. Lindell, B. Pinkas, Privacy preserving data mining, in CRYPTO\u201900, LNCS 1880 (2000), pp. 36\u201354","DOI":"10.1007\/3-540-44598-6_3"},{"issue":"5","key":"9349_CR22","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"M. Naor, B. Pinkas, Oblivious polynomial evaluation. SIAM J. Comput., 35(5), 1254\u20131281. (2006)","journal-title":"SIAM J. Comput."},{"key":"9349_CR23","unstructured":"S. Oliveira, O.R. Za\u00efane, Privacy preserving clustering by data transformation, in Proc. 18th Brazilian Symposium on Databases (2003), pp. 304\u2013318"},{"key":"9349_CR24","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, Y. Rabani, L. Schulman, C. Swamy, The Effectiveness of Lloyd-Type Methods for the k-Means Problem (FOCS, 2006)","DOI":"10.1109\/FOCS.2006.75"},{"key":"9349_CR25","doi-asserted-by":"crossref","unstructured":"P. Paillier, Public key cryptosystems based on composite degree residuosity classes, in Advances in Cryptology EURO-CRYPT\u201999 Proceedings, LNCS 1592 (1999), pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9349_CR26","doi-asserted-by":"crossref","unstructured":"J. Reif, S. Tate, Optimal size integer division circuits. SIAM J. Comput, 912\u2013924 (1990)","DOI":"10.1137\/0219064"},{"key":"9349_CR27","doi-asserted-by":"crossref","unstructured":"C. Su, F. Bao, J. Zhou, T. Takagi, K. Sakurai, Privacy-preserving two-party $$K$$-means clustering via secure approximation, in 21st Inter. Conf. on Advanced Information Networking and Applications Workshops (2007), pp. 385\u2013391","DOI":"10.1109\/AINAW.2007.295"},{"key":"9349_CR28","doi-asserted-by":"crossref","unstructured":"J. Vaidya, C. Clifton, Privacy-preserving $$k$$-means clustering over vertically partitioned data, in Proc. 9th ACM SIGDD Inter. Conf. on Knowledge Discovery and Data Mining (2003), pp. 206\u2013215","DOI":"10.1145\/956750.956776"},{"issue":"2","key":"9349_CR29","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1504\/IJACT.2014.062738","volume":"3","author":"T Veugen","year":"2014","unstructured":"T. Veugen, Encrypted integer division and secure comparison. Int. J. Appl. Cryptogr., 3(2), 166\u2013180. (2014)","journal-title":"Int. J. Appl. Cryptogr."},{"key":"9349_CR30","doi-asserted-by":"crossref","unstructured":"R. Wright, Z. Yang, Privacy-preserving bayesian net- work structure computation on distributed heterogeneous data, in Proc. of the 10th ACM SIGKDD Inter. Conf. on Knowledge Discovery and Data Mining (2004), pp. 713\u2013718","DOI":"10.1145\/1014052.1014145"},{"key":"9349_CR31","doi-asserted-by":"crossref","unstructured":"A.C.C. Yao, How to generate and exchange secrets, in Proc. of the 27th IEEE Symp. on Foundations of Computer Science (1986), pp. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"9349_CR32","doi-asserted-by":"crossref","unstructured":"H. Zhu, F. Bao, Oblivious scalar-product protocols, in 11th Australasian Conference on Information Security and Privacy, LNCS 4058 (2006), pp. 313\u2013323","DOI":"10.1007\/11780656_26"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09349-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-020-09349-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09349-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T23:23:20Z","timestamp":1620775400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-020-09349-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,12]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9349"],"URL":"https:\/\/doi.org\/10.1007\/s00145-020-09349-w","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,12]]},"assertion":[{"value":"27 April 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}