{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T19:24:08Z","timestamp":1673378648502},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Math Organiz Theor"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10588-005-3941-2","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T03:39:25Z","timestamp":1131334765000},"page":"141-159","source":"Crossref","is-referenced-by-count":11,"title":["Privacy Preserving Link Analysis on Dynamic Weighted Graph"],"prefix":"10.1007","volume":"11","author":[{"given":"Yitao","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingtao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Kam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Canny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3941_CR1","doi-asserted-by":"crossref","unstructured":"Brin, S. and L. Page (1998), \u201cThe Anatomy of a Large-Scale Hypertextual Web Search Engine\u201d, in 7th World Wide Web Conference, Brisbane, Australia.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"3941_CR2","doi-asserted-by":"crossref","unstructured":"Canny, J. (2002), \u201cCollaborative Filtering with Privacy\u201d, in IEEE Symposium on Security and Privacy, Oakland, CA, U.S.A, pp. 45\u201357","DOI":"10.1109\/SECPRI.2002.1004361"},{"key":"3941_CR3","doi-asserted-by":"crossref","unstructured":"Canny, J. and S. Sorkin (2004), \u201cPractical Large-Scale Distributed Key Generation\u201d, Eurocrypt 2004.","DOI":"10.1007\/978-3-540-24676-3_9"},{"key":"3941_CR4","doi-asserted-by":"crossref","unstructured":"Carriere, J. and R. Kazman (1997), \u201cWebQuery: Searching and Visualizing the Web through Connectivity\u201d, in Proceedings of the International WWW Conference.","DOI":"10.1016\/S0169-7552(97)00062-7"},{"key":"3941_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan (1998), \u201cAutomatic Resource List Compilation by Analyzing Hyperlink Structure and Associated Text\u201d, in Proceedings of the 7th International World Wide Web Conference.","DOI":"10.1016\/S0169-7552(98)00087-7"},{"key":"3941_CR6","unstructured":"Cohen, W.W. (2005), Enron Email Dataset, http:\/\/www-2.cs.cmu.edu\/~enron\/."},{"key":"3941_CR7","unstructured":"Corrada-Emmanuel, A. (2005), Enron Email Dataset Research, http:\/\/ciir.cs.umass.edu\/~corrada\/enron\/."},{"key":"3941_CR8","doi-asserted-by":"crossref","unstructured":"Fouque, P. and J. Stern (2001), \u201cOne Round Threshold Discrete-Log Key Generation without Private Channels\u201d, Public Key Cryptography, pp. 300\u2013316.","DOI":"10.1007\/3-540-44586-2_22"},{"key":"3941_CR9","doi-asserted-by":"crossref","unstructured":"Gennaro, R., S. Jarecki, H. Krawczyk, and T. Rabin (1999), \u201cSecure Distributed Key Generation for Discrete-Log Based Cryptosystems\u201d, Lecture Notes in Computer Science, 1592, 295\u2013310.","DOI":"10.1007\/3-540-48910-X_21"},{"key":"3941_CR10","unstructured":"Golub, G.H. and C.F. Van Loan (1989), Matrix Computations. Johns Hopkins University Press."},{"key":"3941_CR11","unstructured":"Kautz, H., B. Selman, and A. Milewski (1996), \u201cAgent Amplified Communication\u201d, AAAI-96, Portland, Oregon, MIT Press, Cambridge, MA, 3\u20139."},{"issue":"3","key":"3941_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/245108.245123","volume":"40","author":"H. Kautz","year":"1997","unstructured":"Kautz, H., B. Selman, and M. Shah (1997), \u201cCombining Social Networks and Collaborative Filtering\u201d, Communications of ACM, 40(3), 63\u201365.","journal-title":"Communications of ACM"},{"issue":"5","key":"3941_CR13","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M. (1999), \u201cAuthoritative Sources in a Hyperlinked Environment\u201d, Journal of the ACM, 46(5), 604\u2013632.","journal-title":"Journal of the ACM"},{"key":"3941_CR14","doi-asserted-by":"crossref","unstructured":"MacDonald, D.W. and M.S. Ackerman (1998), \u201cJust Talk to Me: A Field Study of Expertise Location\u201d, in ACM CSCW-98, pp. 315\u2014324.","DOI":"10.1145\/289444.289506"},{"key":"3941_CR15","unstructured":"Newell, A. and P.S. Rosenbloom (1981), \u201cMechanisms of Skill Acquisition and the Law of Practice\u201d, in J.R. Anderson (Ed.), Cognitive Skills and their Acquisition, Hillsdale, NJ: Earlbaum, pp. 1\u201355."},{"key":"3941_CR16","unstructured":"Ng, A.Y., A.X. Zheng, and M.I. Jordan (2001a), \u201cLink Analysis, Eigenvectors and Stability\u201d, in Proceedings of the 17th International Joint Conference on Artificial Intelligence, Seattle, Washington, United States, pp. 903\u2013910."},{"key":"3941_CR17","doi-asserted-by":"crossref","unstructured":"Ng, A.Y., A.X. Zheng, and M.I. Jordan (2001b), \u201cStable Algorithms for Link Analysis\u201d, in Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, Louisiana, United States, pp. 258\u2013266.","DOI":"10.1145\/383952.384003"},{"key":"3941_CR18","doi-asserted-by":"crossref","unstructured":"Pedersen, T. (1991), \u201cA Threshold Cryptosystem without a Trusted Party\u201d, in Proceedings of EUROCRYPT \u201991, Springer-Verlag LNCS, vol. 547, pp. 522\u2013526.","DOI":"10.1007\/3-540-46416-6_47"},{"key":"3941_CR19","doi-asserted-by":"crossref","unstructured":"Pirolli, P., J. Pitkow, and R. Rao (1996), \u201cSilk from a Sow's Ear: Extracting Usable Structures from the Web\u201d, in Proceedings of ACM Conference on Human Factors in Computing Systems, ACM Press.","DOI":"10.1145\/238386.238450"},{"key":"3941_CR20","unstructured":"Polak, E. (1971), Computational Methods in Optimization. Academic Press."},{"issue":"8","key":"3941_CR21","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/163381.163402","volume":"36","author":"M.F. Schwartz","year":"1993","unstructured":"Schwartz, M.F. and D.C.M. Wood (1993), \u201cDiscovering Shared Interests Using Graph Analysis\u201d, Communications of ACM, 36(8), 78\u201389.","journal-title":"Communications of ACM"},{"key":"3941_CR22","unstructured":"Salton, G. (1989), Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley."},{"key":"3941_CR23","unstructured":"Stewart, G.W. and J. Sun (1990), Matrix Perturbation Theory. Academic Press."},{"key":"3941_CR24","unstructured":"Strang, G. (1980), Linear Algebra and Its Applications, 2nd edition. Academic Press."}],"container-title":["Computational and Mathematical Organization Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10588-005-3941-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10588-005-3941-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10588-005-3941-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T18:01:15Z","timestamp":1586541675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10588-005-3941-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["3941"],"URL":"https:\/\/doi.org\/10.1007\/s10588-005-3941-2","relation":{},"ISSN":["1381-298X","1572-9346"],"issn-type":[{"value":"1381-298X","type":"print"},{"value":"1572-9346","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}