{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T05:15:59Z","timestamp":1694063759233},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00521-012-1006-2","type":"journal-article","created":{"date-parts":[[2012,6,30]],"date-time":"2012-06-30T01:19:58Z","timestamp":1341019198000},"page":"843-856","source":"Crossref","is-referenced-by-count":1,"title":["Privacy preserving perceptron learning in malicious model"],"prefix":"10.1007","volume":"23","author":[{"given":"Yuan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,1]]},"reference":[{"key":"1006_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. SIGMODREC: ACM SIGMOD record 29","DOI":"10.1145\/342009.335438"},{"issue":"1","key":"1006_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti R (2000) Security and composition of multiparty cryptographic protocols. J Cryptol 13(1):143\u2013202","journal-title":"J Cryptol"},{"key":"1006_CR3","doi-asserted-by":"crossref","unstructured":"Chen K, Liu L (2005) Privacy preserving data classification with rotation perturbation. In: Proceedings of the fifth IEEE international conference on data mining, IEEE Computer Society, pp 589\u2013592","DOI":"10.1109\/ICDM.2005.121"},{"issue":"10","key":"1006_CR4","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/TNN.2009.2026902","volume":"20","author":"T Chen","year":"2009","unstructured":"Chen T, Zhong S (2009) Privacy-preserving backpropagation neural network learning. IEEE Trans Neural Netw 20(10):1554\u20131564","journal-title":"IEEE Trans Neural Netw"},{"key":"1006_CR5","doi-asserted-by":"crossref","unstructured":"Cramer R, Damg\u00e5rd I, Nielsen J (2001) Multiparty computation from threshold homomorphic encryption. In: EUROCRYPT: advances in cryptology: proceedings of EUROCRYPT","DOI":"10.1007\/3-540-44987-6_18"},{"key":"1006_CR6","doi-asserted-by":"crossref","unstructured":"Cristofaro ED, Kim J, Tsudik G (2010) Linear-complexity private set intersection protocols secure in malicious model. In: ASIACRYPT, Lecture Notes in Computer Science, vol 6477. Springer, pp 213\u2013231","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"1006_CR7","unstructured":"Dai W Crypto++ library (2010). http:\/\/www.cryptopp.com"},{"key":"1006_CR8","volume-title":"Efficient protocols based on probabilistic encryption using composite degree residue classes","author":"I Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd I, Jurik M (2000) Efficient protocols based on probabilistic encryption using composite degree residue classes. BRICS, Department of Computer Science, University of Aarhus, Aarhus"},{"key":"1006_CR9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1504\/IJACT.2008.017048","volume":"1","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd I, Geisler M, Kroigard M (2008) Homomorphic encryption and secure comparison. Int J Appl Cryptogr 1:22\u201331","journal-title":"Int J Appl Cryptogr"},{"key":"1006_CR10","volume-title":"Pattern classification","author":"RO Duda","year":"2001","unstructured":"Duda RO, Hart PE, Stork DG (2001) Pattern classification, vol 2. Wiley, New York"},{"key":"1006_CR11","doi-asserted-by":"crossref","unstructured":"Fouque PA, Poupard G, Stern J (2001) Sharing decryption in the context of voting or lotteries. In: Financial cryptography, Springer, pp 90\u2013104","DOI":"10.1007\/3-540-45472-1_7"},{"key":"1006_CR12","unstructured":"Frank A, Asuncion A (2010) UCI machine learning repository. University of California, School of Information and Computer Science, Irvine. http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html"},{"key":"1006_CR13","doi-asserted-by":"crossref","unstructured":"F\u00fcrer M (2007) Faster integer multiplication. In: Proceedings of the thirty-ninth annual ACM symposium on theory of computing, ACM, pp 57\u201366","DOI":"10.1145\/1250790.1250800"},{"key":"1006_CR14","doi-asserted-by":"crossref","unstructured":"Gilburd B, Schuster A, Wolff R (2004) Privacy-preserving data mining on data grids in the presence of malicious participants. In: HPDC. IEEE computer society, pp 225\u2013234","DOI":"10.1109\/HPDC.2004.1323540"},{"key":"1006_CR15","unstructured":"Goldreich O (2010) A short tutorial of zero-knowledge. http:\/\/www.wisdom.weizmann.ac.il\/oded\/PS\/zk-tut10.ps"},{"key":"1006_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: Proceedings of the nineteenth annual ACM symposium on theory of computing, ACM, pp 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"1006_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser S, Micali S, Rackoff C (1985) The knowledge complexity of interactive proof-systems. In: Proceedings of the seventeenth annual ACM symposium on theory of computing, ACM, pp 291\u2013304","DOI":"10.1145\/22145.22178"},{"key":"1006_CR18","unstructured":"Heer GR (1993) A bootstrap procedure to preserve statistical confidentiality in contingency tables. In: Proceedings of the international seminar on statistical confidentiality, pp 261\u2013271"},{"key":"1006_CR19","first-page":"353","volume":"2","author":"M Kantarcioglu","year":"2009","unstructured":"Kantarcioglu M, Kardes O (2009) Privacy-preserving data mining in the malicious model. Int J Inf Comput Secur 2:353\u2013375","journal-title":"Int J Inf Comput Secur"},{"key":"1006_CR20","doi-asserted-by":"crossref","unstructured":"Laur S, Lipmaa H, Mielik\u00e4nen T (2006) Cryptographically private sup-a port vector machines. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 618\u2013624","DOI":"10.1145\/1150402.1150477"},{"issue":"1","key":"1006_CR21","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s10115-004-0148-7","volume":"8","author":"X Lin","year":"2005","unstructured":"Lin X, Clifton C, Zhu M (2005) Privacy-preserving clustering with distributed em mixture modeling. Knowl Inf Syst 8(1):68\u201381","journal-title":"Knowl Inf Syst"},{"key":"1006_CR22","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2007) An efficient protocol for secure two-party computation in the presence of malicious adversaries. Advances in cryptology- EUROCRYPT 2007, pp 52\u201378","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"1006_CR23","first-page":"36","volume-title":"CRYPTO, volume 1880 of Lecture Notes in Computer Science","author":"Y Lindell","year":"2000","unstructured":"Lindell Y, Pinkas B (2000) Privacy preserving data mining. In: Bellare M (ed) CRYPTO, volume 1880 of Lecture Notes in Computer Science. Springer, New York, pp 36\u201354"},{"key":"1006_CR24","volume-title":"Perceptrons: an introduction to computational geometry","author":"M Minsky","year":"1969","unstructured":"Minsky M, Papert S (1969) Perceptrons: an introduction to computational geometry. MIT Press, Cambridge"},{"key":"1006_CR25","doi-asserted-by":"crossref","unstructured":"Nishide T, Ohta K (2007) Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. Public key cryptography PKC 2007, pp 343\u2013360","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"1006_CR26","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Advances in cryptology EUROCRYPT99, Springer, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"1006_CR27","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F Rosenblatt","year":"1958","unstructured":"Rosenblatt F (1958) The perceptron: a probabilistic model for information storage and organization in the brain. Psychol Rev 65:386\u2013408","journal-title":"Psychol Rev"},{"issue":"23","key":"1006_CR28","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1016\/j.ins.2007.07.013","volume":"177","author":"D Shah","year":"2007","unstructured":"Shah D, Zhong S (2007) Two methods for privacy preserving data mining with malicious participants. Inf Sci 177(23):5468\u20135483","journal-title":"Inf Sci"},{"key":"1006_CR29","first-page":"206","volume-title":"KDD","author":"J Vaidya","year":"2003","unstructured":"Vaidya J, Clifton C (2003) Privacy-preserving k-means clustering over vertically partitioned data. In: Getoor L, Senator TE, Domingos P, Faloutsos C (eds) KDD. ACM, New York, pp 206\u2013215"},{"issue":"4","key":"1006_CR30","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s00778-006-0041-y","volume":"17","author":"J Vaidya","year":"2008","unstructured":"Vaidya J, Kantarcioglu M, Clifton C (2008) Privacy-preserving naive bayes classification. VLDB J 17(4):879\u2013898","journal-title":"VLDB J."}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-012-1006-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-012-1006-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-012-1006-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T23:22:57Z","timestamp":1642634577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-012-1006-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,1]]},"references-count":30,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1006"],"URL":"https:\/\/doi.org\/10.1007\/s00521-012-1006-2","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,1]]}}}