{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:02:43Z","timestamp":1725580963241},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198953"},{"type":"electronic","value":"9783642198960"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19896-0_3","type":"book-chapter","created":{"date-parts":[[2011,4,16]],"date-time":"2011-04-16T07:43:17Z","timestamp":1302939797000},"page":"22-35","source":"Crossref","is-referenced-by-count":0,"title":["Quadratic Error Minimization in a Distributed Environment with Privacy Preserving"],"prefix":"10.1007","author":[{"given":"G\u00e9rald","family":"Gavin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Velcin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Bartlett, P.L.: For valid generalization the size of the weights is more important than the size of the network. In: NIPS, pp. 134\u2013140 (1996)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"6","key":"3_CR4","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1109\/TIT.2005.847729","volume":"51","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Lugosi, G., Stoltz, G.: Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory\u00a051(6), 2152\u20132162 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/TNN.2009.2026902","volume":"20","author":"T. Chen","year":"2009","unstructured":"Chen, T., Zhong, S.: Privacy-preserving backpropagation neural network learning. Trans. Neur. Netw.\u00a020(10), 1554\u20131564 (2009)","journal-title":"Trans. Neur. Netw."},{"key":"3_CR6","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\u2013299. Springer, Heidelberg (2001)"},{"key":"3_CR7","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":"3_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Elgamal","year":"1985","unstructured":"Elgamal, T.: A public key cryptosystem and a signature sheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Fouque, P., Stern, J.: Fully distributed threshold rsa under standard assumptions. In: IACR Cryptology ePrint Archive: Report 2001\/2008 (February 2001)","DOI":"10.1007\/3-540-45682-1_19"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10618-006-0051-9","volume":"14","author":"S. Gambs","year":"2007","unstructured":"Gambs, S., K\u00e9gl, B., A\u00efmeur, E.: Privacy-preserving boosting. Data Min. Knowl. Discov.\u00a014(1), 131\u2013170 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"3_CR11","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.A. Garay","year":"2007","unstructured":"Garay, J.A., 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":"3_CR12","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1109\/TKDE.2009.153","volume":"22","author":"S. Han","year":"2010","unstructured":"Han, S., Ng, W.K., Wan, L., Lee, V.C.S.: Privacy-preserving gradient-descent methods. IEEE Trans. Knowl. Data Eng.\u00a022(6), 884\u2013899 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR14","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)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 36\u201354. Springer, Heidelberg (2000)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Michali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","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":"3_CR18","volume-title":"C4.5: Programs for Machine Learning","author":"J. Ross Quinlan","year":"1993","unstructured":"Ross Quinlan, J.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"3_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49097-3_1","volume-title":"Computational Learning Theory","author":"R.E. Schapire","year":"1999","unstructured":"Schapire, R.E.: Theoretical views of boosting. In: Fischer, P., Simon, H.U. (eds.) EuroCOLT 1999. LNCS (LNAI), vol.\u00a01572, pp. 1\u201310. Springer, Heidelberg (1999)"},{"key":"3_CR20","unstructured":"Schapire, R.E., Freund, Y., Barlett, P., Lee, W.S.: Boosting the margin: A new explanation for the effectiveness of voting methods. In: ICML, pp. 322\u2013330 (1997)"},{"key":"3_CR21","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":"3_CR22","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C., Kantarcioglu, M., Scott Patterson, A.: Privacy-preserving decision trees over vertically partitioned data. TKDD\u00a02(3) (2008)","DOI":"10.1145\/1409620.1409624"},{"key":"3_CR23","unstructured":"Vapnik, V.: Principles of risk minimization for learning theory. In: NIPS, pp. 831\u2013838 (1991)"},{"key":"3_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11731139_74","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Yu","year":"2006","unstructured":"Yu, H., Vaidya, J., Jiang, X.: Privacy-preserving svm classification on vertically partitioned data. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol.\u00a03918, pp. 647\u2013656. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Privacy and Security Issues in Data Mining and Machine Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19896-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T03:47:13Z","timestamp":1558583233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19896-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198953","9783642198960"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19896-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}