{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:07Z","timestamp":1750221007998,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3341161.3342946","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T21:07:04Z","timestamp":1579122424000},"page":"532-533","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing node clustering coefficients securely"],"prefix":"10.1145","author":[{"given":"Katchaguy","family":"Areekijseree","sequence":"first","affiliation":[{"name":"Syracuse University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhe","family":"Tang","sequence":"additional","affiliation":[{"name":"Syracuse University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sucheta","family":"Soundarajan","sequence":"additional","affiliation":[{"name":"Syracuse University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract),\" in 27th Annual Symposium on Foundations of Computer Science, Toronto","author":"Yao A. C.","year":"1986","unstructured":"A. C. Yao , \" How to generate and exchange secrets (extended abstract),\" in 27th Annual Symposium on Foundations of Computer Science, Toronto , Canada, 27-- 29 October 1986, 1986 , pp. 162 -- 167 . A. C. Yao, \"How to generate and exchange secrets (extended abstract),\" in 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27--29 October 1986, 1986, pp. 162--167.","journal-title":"Canada, 27--"},{"key":"e_1_3_2_1_2_1","first-page":"218","volume-title":"How to play any mental game or A completeness theorem for protocols with honest majority,\" in Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"Goldreich O.","year":"1987","unstructured":"O. Goldreich , S. Micali , and A. Wigderson , \" How to play any mental game or A completeness theorem for protocols with honest majority,\" in Proceedings of the 19th Annual ACM Symposium on Theory of Computing , 1987 , pp. 218 -- 229 . O. Goldreich, S. Micali, and A. Wigderson, \"How to play any mental game or A completeness theorem for protocols with honest majority,\" in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 218--229."},{"key":"e_1_3_2_1_3_1","first-page":"257","article-title":"Fairplaymp: a system for secure multi-party computation","author":"Ben-David A.","year":"2008","unstructured":"A. Ben-David , N. Nisan , and B. Pinkas , \" Fairplaymp: a system for secure multi-party computation ,\" in ACM Conference on Computer and Communications Security , 2008 , pp. 257 -- 266 . A. Ben-David, N. Nisan, and B. Pinkas, \"Fairplaymp: a system for secure multi-party computation,\" in ACM Conference on Computer and Communications Security, 2008, pp. 257--266.","journal-title":"ACM Conference on Computer and Communications Security"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_3_2_1_5_1","first-page":"377","article-title":"Graphsc: Parallel secure computation made easy,\" in 2015 IEEE Symposium on Security and Privacy","author":"Nayak K.","year":"2015","unstructured":"K. Nayak , X. S. Wang , S. Ioannidis , U. Weinsberg , N. Taft , and E. Shi , \" Graphsc: Parallel secure computation made easy,\" in 2015 IEEE Symposium on Security and Privacy , SP , 2015 , pp. 377 -- 394 . K. Nayak, X. S. Wang, S. Ioannidis, U. Weinsberg, N. Taft, and E. Shi, \"Graphsc: Parallel secure computation made easy,\" in 2015 IEEE Symposium on Security and Privacy, SP, 2015, pp. 377--394.","journal-title":"SP"},{"key":"e_1_3_2_1_6_1","volume-title":"Privacy-preserving shortest path computation,\" in Network and Distributed System Security Symposium","author":"Wu D. J.","year":"2016","unstructured":"D. J. Wu , J. Zimmerman , J. Planul , and J. C. Mitchell , \" Privacy-preserving shortest path computation,\" in Network and Distributed System Security Symposium , 2016 . D. J. Wu, J. Zimmerman, J. Planul, and J. C. Mitchell, \"Privacy-preserving shortest path computation,\" in Network and Distributed System Security Symposium, 2016."},{"key":"e_1_3_2_1_7_1","volume-title":"Secure friend discovery via privacy-preserving and decentralized community detection,\" in ICML Workshop on Learning, Security, and Privacy","author":"Hu P.","year":"2014","unstructured":"P. Hu , S. Chow , and W. C. Lau , \" Secure friend discovery via privacy-preserving and decentralized community detection,\" in ICML Workshop on Learning, Security, and Privacy , 2014 . P. Hu, S. Chow, and W. C. Lau, \"Secure friend discovery via privacy-preserving and decentralized community detection,\" in ICML Workshop on Learning, Security, and Privacy, 2014."},{"key":"e_1_3_2_1_8_1","first-page":"321","article-title":"Pcf: A portable circuit format for scalable two-party secure communication","author":"Kreuter B.","year":"2013","unstructured":"B. Kreuter , A. Shelat , B. Mood , and K. R. B. Butler , \" Pcf: A portable circuit format for scalable two-party secure communication ,\" in USENIX Security Symposium , 2013 , pp. 321 -- 336 . B. Kreuter, A. Shelat, B. Mood, and K. R. B. Butler, \"Pcf: A portable circuit format for scalable two-party secure communication,\" in USENIX Security Symposium, 2013, pp. 321--336.","journal-title":"USENIX Security Symposium"},{"key":"e_1_3_2_1_9_1","first-page":"421","article-title":"A survey of privacy-preservation of graphs and social networks","volume":"40","author":"Wu X.","year":"2010","unstructured":"X. Wu , X. Ying , K. Liu , and L. Chen , \" A survey of privacy-preservation of graphs and social networks ,\" Managing and Mining Graph Data , vol. 40 , pp. 421 -- 453 , 2010 . X. Wu, X. Ying, K. Liu, and L. Chen, \"A survey of privacy-preservation of graphs and social networks,\" Managing and Mining Graph Data, vol. 40, pp. 421--453, 2010.","journal-title":"Managing and Mining Graph Data"}],"event":{"name":"ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Vancouver British Columbia Canada","acronym":"ASONAM '19"},"container-title":["Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342946","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341161.3342946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:58Z","timestamp":1750206358000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":9,"alternative-id":["10.1145\/3341161.3342946","10.1145\/3341161"],"URL":"https:\/\/doi.org\/10.1145\/3341161.3342946","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2020-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}