{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:03:27Z","timestamp":1710266607929},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"8-10","license":[{"start":{"date-parts":[[2012,6,26]],"date-time":"2012-06-26T00:00:00Z","timestamp":1340668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00607-012-0200-5","type":"journal-article","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T11:04:59Z","timestamp":1340622299000},"page":"763-782","source":"Crossref","is-referenced-by-count":5,"title":["Asynchronous privacy-preserving iterative computation on peer-to-peer networks"],"prefix":"10.1007","volume":"94","author":[{"given":"J. A. M.","family":"Naranjo","sequence":"first","affiliation":[]},{"given":"L. G.","family":"Casado","sequence":"additional","affiliation":[]},{"given":"M\u00e1rk","family":"Jelasity","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,26]]},"reference":[{"key":"200_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu PS (2008) A general survey of privacy-preserving data mining models and algorithms. In: Aggarwal CC, Yu PS, Elmagarmid AK (eds) Privacy-preserving data mining. The Kluwer International Series on Advances in Database Systems, vol 34, pp 11\u201352. Springer, New York. doi: 10.1007\/978-0-387-70992-5_2","DOI":"10.1007\/978-0-387-70992-5_2"},{"issue":"2","key":"200_CR2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/335191.335438","volume":"29","author":"R Agrawal","year":"2000","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. SIGMOD Rec 29(2): 439\u2013450. doi: 10.1145\/335191.335438","journal-title":"SIGMOD Rec"},{"key":"200_CR3","volume-title":"Templates for the solution of algebraic eigenvalue problems: a practical guide","year":"2000","unstructured":"Bai, Z, Demmel, J, Dongarra, J, Ruhe, A, van der Vorst, H (eds) (2000) Templates for the solution of algebraic eigenvalue problems: a practical guide. SIAM, Philadelphia"},{"issue":"1","key":"200_CR4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/1052934.1052938","volume":"5","author":"M Bianchini","year":"2005","unstructured":"Bianchini M, Gori M, Scarselli F (2005) Inside pagerank. ACM Trans Int Technol 5(1): 92\u2013128. doi: 10.1145\/1052934.1052938","journal-title":"ACM Trans Int Technol"},{"key":"200_CR5","doi-asserted-by":"crossref","unstructured":"Bickson D, Dolev D, Bezman G, Pinkas B (2008) Peer-to-peer secure multi-party numerical computation. In: IEEE international conference on peer-to-peer computing. IEEE Computer Society, pp 257\u2013266. doi: 10.1109\/P2P.2008.22","DOI":"10.1109\/P2P.2008.22"},{"issue":"2","key":"200_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s12083-008-0008-4","volume":"1","author":"D Bickson","year":"2008","unstructured":"Bickson D, Malkhi D (2008) A unifying framework of rating users and data items in peer-to-peer and social networks. Peer-to-Peer Netw Appl 1(2): 93\u2013103. doi: 10.1007\/s12083-008-0008-4","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"2","key":"200_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s12083-009-0051-9","volume":"3","author":"D Bickson","year":"2010","unstructured":"Bickson D, Reinman T, Dolev D, Pinkas B (2010) Peer-to-peer secure multi-party numerical computation facing malicious adversaries. Peer-to-Peer Netw Appl 3(2): 129\u2013144. doi: 10.1007\/s12083-009-0051-9","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"2","key":"200_CR8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton C, Kantarcioglu M, Vaidya J, Lin X, Zhu MY (2002) Tools for privacy preserving distributed data mining. SIGKDD Explor Newsl 4(2): 28\u201334. doi: 10.1145\/772862.772867","journal-title":"SIGKDD Explor Newsl"},{"issue":"2","key":"200_CR9","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s12083-010-0075-1","volume":"4","author":"K Das","year":"2011","unstructured":"Das K, Bhaduri K, Kargupta H (2011) Multi-objective optimization based privacy preserving distributed data mining in peer-to-peer networks. Peer-to-Peer Netw Appl 4(2): 192\u2013209. doi: 10.1007\/s12083-010-0075-1","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"4","key":"200_CR10","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/MIC.2006.74","volume":"10","author":"S Datta","year":"2006","unstructured":"Datta S, Bhaduri K, Giannella C, Wolff R, Kargupta H (2006) Distributed data mining in peer-to-peer networks. IEEE Int Comput 10(4): 18\u201326. doi: 10.1109\/MIC.2006.74","journal-title":"IEEE Int Comput"},{"issue":"1\u20132","key":"200_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0377-0427(00)00409-X","volume":"123","author":"A Frommer","year":"2000","unstructured":"Frommer A, Szyld DB (2000) On asynchronous iterations. J Comput Appl Math 123(1\u20132): 201\u2013216. doi: 10.1016\/S0377-0427(00)00409-X","journal-title":"J Comput Appl Math"},{"key":"200_CR12","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, STOC \u201987. ACM, New York, pp 218\u2013229. doi: 10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"200_CR13","unstructured":"Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. The Johns Hopkins University Press"},{"issue":"1","key":"200_CR14","first-page":"6:1","volume":"8","author":"W He","year":"2011","unstructured":"He W, Liu X, Nguyen HV, Nahrstedt K, Abdelzaher T (2011) PDA: privacy-preserving data aggregation for information collection. ACM Trans Sen Netw 8(1): 6:1\u20136:22. doi: 10.1145\/1993042.1993048","journal-title":"ACM Trans Sen Netw"},{"key":"200_CR15","doi-asserted-by":"crossref","unstructured":"Jelasity M, Canright G, Eng\u00f8-Monsen K (2007) Asynchronous distributed power iteration with gossip-based normalization. In: Kermarrec AM, Boug\u00e9 L, Priol T (eds) Euro-Par 2007. Lecture notes in computer science, vol 4641. Springer, Berlin, pp 514\u2013525. doi: 10.1007\/978-3-540-74466-5_55","DOI":"10.1007\/978-3-540-74466-5_55"},{"issue":"3","key":"200_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M Jelasity","year":"2005","unstructured":"Jelasity M, Montresor A, Babaoglu O (2005) Gossip-based aggregation in large dynamic networks. ACM Trans Comput Syst 23(3): 219\u2013252. doi: 10.1145\/1082469.1082470","journal-title":"ACM Trans Comput Syst"},{"key":"200_CR17","doi-asserted-by":"crossref","unstructured":"Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th international conference on World Wide Web (WWW\u201903). ACM, New York, pp 640\u2013651. doi: 10.1145\/775152.775242","DOI":"10.1145\/775152.775242"},{"key":"200_CR18","doi-asserted-by":"crossref","unstructured":"Kempe D, Dobra A, Gehrke J (2003) Gossip-based computation of aggregate information. In: Proceedings of the 44th annual IEEE symposium on Foundations of Computer Science (FOCS\u201903). IEEE Computer Society, pp 482\u2013491. doi: 10.1109\/SFCS.2003.1238221","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"200_CR19","doi-asserted-by":"crossref","unstructured":"Kempe D, McSherry F (2004) A decentralized algorithm for spectral analysis. In: Proceedings of the 36th ACM symposium on theory of computing (STOC\u201904). ACM, New York, pp 561\u2013568. doi: 10.1145\/1007352.1007438","DOI":"10.1145\/1007352.1007438"},{"issue":"3","key":"200_CR20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2002","unstructured":"Lindell Y, Pinkas B (2002) Privacy preserving data mining. J Cryptol 15(3): 177\u2013206. doi: 10.1007\/s00145-001-0019-2","journal-title":"J Cryptol"},{"issue":"1","key":"200_CR21","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/4904.4801","volume":"33","author":"B Lubachevsky","year":"1986","unstructured":"Lubachevsky B, Mitra D (1986) A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit radius. J ACM 33(1): 130\u2013150. doi: 10.1145\/4904.4801","journal-title":"J ACM"},{"issue":"2","key":"200_CR22","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"U Maurer","year":"2006","unstructured":"Maurer U (2006) Secure multi-party computation made simple. Discrete Appl Math 154(2): 370\u2013381. doi: 10.1016\/j.dam.2005.03.020","journal-title":"Discrete Appl Math"},{"key":"200_CR23","doi-asserted-by":"crossref","unstructured":"Montresor A, Jelasity M (2009) Peersim: a scalable P2P simulator. In: Proceedings of the 9th IEEE international conference on Peer-to-Peer Computing (P2P 2009). IEEE, Seattle, pp 99\u2013100. doi: 10.1109\/P2P.2009.5284506 . Extended abstract","DOI":"10.1109\/P2P.2009.5284506"},{"issue":"7","key":"200_CR24","doi-asserted-by":"crossref","first-page":"2997","DOI":"10.1109\/TIT.2008.924648","volume":"54","author":"D Mosk-Aoyama","year":"2008","unstructured":"Mosk-Aoyama D, Shah D (2008) Fast distributed algorithms for computing separable functions. IEEE Trans Inf Theory 54(7): 2997\u20133007. doi: 10.1109\/TIT.2008.924648","journal-title":"IEEE Trans Inf Theory"},{"key":"200_CR25","unstructured":"Parreira JX, Donato D, Michel S, Weikum G (2006) Efficient and decentralized PageRank approximation in a peer-to-peer web search network. In: Proceedings of the 32nd international conference on Very large data bases (VLDB\u20192006). VLDB Endowment, pp 415\u2013426"},{"issue":"2","key":"200_CR26","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/762483.762485","volume":"21","author":"R Renesse van","year":"2003","unstructured":"van Renesse R, Birman KP, Vogels W (2003) Astrolabe: a robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans Comput Syst 21(2): 164\u2013206. doi: 10.1145\/762483.762485","journal-title":"ACM Trans Comput Syst"},{"issue":"11","key":"200_CR27","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11): 612\u2013613. doi: 10.1145\/359168.359176","journal-title":"Commun ACM"},{"key":"200_CR28","doi-asserted-by":"crossref","unstructured":"Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement (IMC\u201906). ACM, New York, pp 189\u2013202. doi: 10.1145\/1177080.1177105","DOI":"10.1145\/1177080.1177105"},{"key":"200_CR29","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: Proceedings of the 23rd annual symposium on Foundations of Computer Science (FOCS), pp 160\u2013164. doi: 10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"200_CR30","doi-asserted-by":"crossref","unstructured":"Yao ACC (1986) How to generate and exchange secrets. In: Proceedings of 27th annual symposium on Foundations of Computer Science (FOCS), pp 162\u2013167. doi: 10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0200-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-012-0200-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0200-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:24Z","timestamp":1559140224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-012-0200-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,26]]},"references-count":30,"journal-issue":{"issue":"8-10","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["200"],"URL":"https:\/\/doi.org\/10.1007\/s00607-012-0200-5","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,26]]}}}