{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T21:28:11Z","timestamp":1689888491401},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T00:00:00Z","timestamp":1620864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11432-018-9899-8","type":"journal-article","created":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T11:02:55Z","timestamp":1621249375000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Locally differentially private distributed algorithms for set intersection and union"],"prefix":"10.1007","volume":"64","author":[{"given":"Qiao","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youwen","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,13]]},"reference":[{"key":"9899_CR1","doi-asserted-by":"crossref","unstructured":"Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Proceedings of Eurocrypt 2004, Interlaken, 2004. 1\u201319","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"9899_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TDSC.2015.2415482","volume":"13","author":"B K Samanthula","year":"2016","unstructured":"Samanthula B K, Jiang W. Secure multiset intersection cardinality and its application to Jaccard coefficient. IEEE Trans Dependable Secure Comput, 2016, 13: 591\u2013604","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"9899_CR3","doi-asserted-by":"crossref","unstructured":"Yao A C C. How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, Toronto, 1986. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"9899_CR4","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1109\/TDSC.2017.2682244","volume":"15","author":"X X Li","year":"2018","unstructured":"Li X X, Zhu Y W, Wang J, et al. On the soundness and security of privacy-preserving SVM for outsourcing data classification. IEEE Trans Dependable Secure Comput, 2018, 15: 906\u2013912","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"9899_CR5","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/090756090","volume":"40","author":"S P Kasiviswanathan","year":"2011","unstructured":"Kasiviswanathan S P, Lee H K, Nissim K, et al. What can we learn privately? SIAM J Comput, 2011, 40: 793\u2013826","journal-title":"SIAM J Comput"},{"key":"9899_CR6","doi-asserted-by":"crossref","unstructured":"Dwork C, Mcsherry F, Nissim K. Calibrating noise to sensitivity in private data analysis. In: Proceedings of Conference on Theory of Cryptography, New York, 2006. 265\u2013284","DOI":"10.1007\/11681878_14"},{"key":"9899_CR7","doi-asserted-by":"crossref","unstructured":"Xue Q, Zhu Y W, Wang J, et al. Distributed set intersection and union with local differential privacy. In: Proceedings of IEEE 23rd International Conference on Parallel and Distributed Systems, Shenzhen, 2017. 198\u2013205","DOI":"10.1109\/ICPADS.2017.00036"},{"key":"9899_CR8","doi-asserted-by":"publisher","first-page":"2726","DOI":"10.1109\/TIFS.2017.2718487","volume":"12","author":"N Holohan","year":"2017","unstructured":"Holohan N, Leith D J, Mason O. Optimal differentially private mechanisms for randomised response. IEEE Trans Inform Forensic Secur, 2017, 12: 2726\u20132735","journal-title":"IEEE Trans Inform Forensic Secur"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9899-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9899-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9899-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T21:03:45Z","timestamp":1671570225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9899-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,13]]},"references-count":8,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["9899"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9899-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,13]]},"assertion":[{"value":"5 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"219101"}}