{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:24:50Z","timestamp":1705015490544},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,10]],"date-time":"2009-06-10T00:00:00Z","timestamp":1244592000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s12083-009-0051-9","type":"journal-article","created":{"date-parts":[[2009,6,9]],"date-time":"2009-06-09T04:32:28Z","timestamp":1244521948000},"page":"129-144","source":"Crossref","is-referenced-by-count":10,"title":["Peer-to-peer secure multi-party numerical computation facing malicious adversaries"],"prefix":"10.1007","volume":"3","author":[{"given":"Danny","family":"Bickson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzachy","family":"Reinman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,10]]},"reference":[{"key":"51_CR1","unstructured":"GMP (2009) The GNU MP Bignum library. http:\/\/gmplib.org"},{"key":"51_CR2","unstructured":"Netflix (2009) Netflix homepage. www.netflix.org"},{"key":"51_CR3","unstructured":"Advanced Crypto Software Collection (2006) Paillier C implementation by John Bethencourt. http:\/\/acsc.csl.sri.com\/libpaillier\/"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, ACM, Dallas, 16\u201318 May 2000, pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"51_CR5","unstructured":"Anker T, Bickson D, Dolev D, Hod B (2008) Efficient clustering for improving network performance in wireless sensor networks. In: European conference on wireless sensor networks (EWSN\u201908)"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Bell RM, Koren Y (2007) Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In: IEEE international conference on data mining (ICDM\u201907)","DOI":"10.1109\/ICDM.2007.90"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Ben-David A, Nisan N, Pinkas B (2008) Fairplaymp\u2013a system for secure multi-party computation. Manuscript","DOI":"10.1145\/1455770.1455804"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or M (1983) Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: PODC \u201983: Proceedings of the second annual ACM symposium on principles of distributed computing, pp 27\u201330","DOI":"10.1145\/800221.806707"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or M, Goldwasser S, Wigderson A (1988) Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th STOC, pp 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"51_CR10","volume-title":"Parallel and distributed calculation. Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas DP, Tsitsiklis JN (1989) Parallel and distributed calculation. Numerical Methods. Prentice Hall, Englewood Cliffs"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Bickson D, Shental O, Siegel PH, Wolf JK, Dolev D (2008) Gaussian belief propagation based multiuser detection. In: IEEE Int Symp on Inform Theory (ISIT), Toronto","DOI":"10.1109\/ISIT.2008.4595314"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Bickson D, Malkhi D, Zhou L (2007) Peer to peer rating. In: The 7th IEEE Peer-to-peer computing, p 9","DOI":"10.1109\/P2P.2007.36"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Canetti R, Rabin T (1993) Fast asynchronous byzantine agreement with optimal resilience. In: 25th STOC, proceedings of the twenty-fifth annual ACM symposium on theory of computing","DOI":"10.1145\/167088.167105"},{"key":"51_CR14","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1145\/564376.564419","volume-title":"SIGIR \u201902: Proceedings of the 25th annual international ACM SIGIR conference on research and development in information retrieval","author":"J Canny","year":"2002","unstructured":"Canny J (2002) Collaborative filtering with privacy via factor analysis. In: SIGIR \u201902: Proceedings of the 25th annual international ACM SIGIR conference on research and development in information retrieval, ACM, New York, pp 238\u2013245"},{"key":"51_CR15","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/773153.773173","volume-title":"PODS \u201903: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems","author":"I Dinur","year":"2003","unstructured":"Dinur I, Nissim K (2003) Revealing information while preserving privacy. In: PODS \u201903: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, ACM, New York, pp 202\u2013210"},{"key":"51_CR16","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev D (1982) The byzantine generals strike again. J Algorithms 3:14\u201330","journal-title":"J Algorithms"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Dolev D, Strong RH (1982) Polynomial algorithms for multiple processor agreement. In: 14th STOC, proceedings of the twenty-fifth annual ACM symposium on theory of computing","DOI":"10.1145\/800070.802215"},{"key":"51_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1005140.1005145","volume-title":"WPES \u201903: Proceedings of the 2003 ACM workshop on privacy in the electronic society","author":"H Dutta","year":"2003","unstructured":"Dutta H, Kargupta H, Datta S, Sivakumar K (2003) Analysis of privacy preserving random perturbation techniques: further explorations. In: WPES \u201903: Proceedings of the 2003 ACM workshop on privacy in the electronic society, ACM, New York, pp 31\u201338"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Feldman P, Micali S (1989) An optimal probabilistic algorithm for synchronous byzantine agreement. In: ICALP \u201989: Proceedings of the 16th international colloquium on automata, languages and programming, pp 341\u2013378","DOI":"10.1007\/BFb0035770"},{"key":"51_CR20","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial cryptography","author":"P-A Fouque","year":"2001","unstructured":"Fouque P-A, Poupard G, Stern J (2001) Sharing decryption in the context of voting or lotteries. In: Financial cryptography. Lecture notes in computer science, vol 1962. Springer, New York, pp 90\u2013104"},{"key":"51_CR21","first-page":"218","volume-title":"Proceedings of the 19th annual symposium on theory of computing (STOC)","author":"O Goldreich","year":"1987","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game or A completeness theorem for protocols with honest majority. In: Proceedings of the 19th annual symposium on theory of computing (STOC), ACM, New York, pp\u00a0218\u2013229"},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Kamvar SD, Schlosser MT, Molina HG (2003) The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the twelfth international world wide web conference","DOI":"10.1145\/775240.775242"},{"issue":"2","key":"51_CR23","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"L Lamport","year":"1980","unstructured":"Lamport L, Shostak R, Pease M (1980) Reaching agreement in the presence of faults. J ACM 27(2):228\u2013234","journal-title":"J ACM"},{"issue":"3","key":"51_CR24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport L, Shostak R, Pease M (1982) The byzantine generals problem. ACM Trans Program Lang Syst 4(3):382\u2013301","journal-title":"ACM Trans Program Lang Syst"},{"key":"51_CR25","unstructured":"Malkhi D, Nisan N, Pinkas B, Sella Y (2004) Fairplay\u2014a secure two-party computation system. In: Proc usenix security symposium"},{"key":"51_CR26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1146381.1146401","volume-title":"PODC \u201906: Proceedings of the twenty-fifth annual ACM symposium on principles of distributed computing","author":"D Mosk-Aoyama","year":"2006","unstructured":"Mosk-Aoyama D, Shah D (2006) Computing separable functions via gossip. In: PODC \u201906: Proceedings of the twenty-fifth annual ACM symposium on principles of distributed computing, ACM, New York, pp 113\u2013122"},{"key":"51_CR27","first-page":"223","volume-title":"EUROCRYPT \u201999, Springer-Verlag (LNCS 1592)","author":"P Paillier","year":"1999","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT \u201999, Springer-Verlag (LNCS 1592). Springer, New York, pp 223\u2013238"},{"key":"51_CR28","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J Pearl","year":"1988","unstructured":"Pearl J (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Francisco"},{"key":"51_CR29","first-page":"129","volume-title":"Proc of CRYPTO 1991, the 11th Ann Intl Cryptology Conf, Springer-Verlag (LNCS 576)","author":"TP Pedersen","year":"1991","unstructured":"Pedersen TP (1991) Non-interactive and information-theoretic secure verifiable secret sharing. In: Proc of CRYPTO 1991, the 11th Ann Intl Cryptology Conf, Springer-Verlag (LNCS 576). Springer, New York, pp 129\u2013140"},{"key":"51_CR30","doi-asserted-by":"crossref","unstructured":"Shamir A (1979) How to share a secret. In communications of the ACM, vol\u00a022. pp 612\u2013613","DOI":"10.1145\/359168.359176"},{"issue":"5","key":"51_CR31","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/1096536.1096546","volume":"35","author":"Y Shavitt","year":"2005","unstructured":"Shavitt Y, Shir E (2005) Dimes: Let the internet measure itself. ACM SIGCOMM Comput Commun Rev 35(5):71\u201374","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"3","key":"51_CR32","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"S Toueg","year":"1987","unstructured":"Toueg S, Perry KJ, Srikanth TK (1987) Fast distributed agreement. SIAM J Comput 16(3):445\u2013457","journal-title":"SIAM J Comput"},{"key":"51_CR33","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/1281192.1281275","volume-title":"KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining","author":"L Wan","year":"2007","unstructured":"Wan L, Ng WK, Han S, Lee VCS (2007) Privacy-preservation for gradient descent methods. In: KDD \u201907: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, pp 775\u2013783"},{"key":"51_CR34","doi-asserted-by":"crossref","unstructured":"Yao A (1982) Protocols for secure computations. In: Proceedings of the 23rd symposium on foundations of computer science (FOCS), IEEE Computer Society Press, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"51_CR35","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1145\/1134707.1134742","volume-title":"EC \u201906: Proceedings of the 7th ACM conference on electronic commerce","author":"S Zhang","year":"2006","unstructured":"Zhang S, Ford J, Makedon F (2006) A privacy-preserving collaborative filtering scheme with two-way communication. In: EC \u201906: Proceedings of the 7th ACM conference on electronic commerce, ACM, New York, pp 316\u2013323"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-009-0051-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-009-0051-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-009-0051-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:44:46Z","timestamp":1559447086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-009-0051-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,10]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s12083-009-0051-9","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,10]]}}}