{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:52:30Z","timestamp":1743094350618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9781071639887"},{"type":"electronic","value":"9781071639894"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-1-0716-3989-4_4","type":"book-chapter","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T08:02:38Z","timestamp":1715846558000},"page":"54-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Federated Boolean Count Queries Using Fully-Homomorphic Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7182-0124","authenticated-orcid":false,"given":"Alexander T.","family":"Leighton","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8275-9576","authenticated-orcid":false,"given":"Yun William","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,17]]},"reference":[{"key":"4_CR1","unstructured":"Lattigo v4 (2022). https:\/\/github.com\/tuneinsight\/lattigo. ePFL-LDS, Tune Insight SA"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold fhe. In: Advances in Cryptology\u2013EUROCRYPT 2012: 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, 15\u201319 April 2012. Proceedings, vol. 31, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29","DOI":"10.1007\/978-3-642-29011-4_29"},{"issue":"21","key":"4_CR3","doi-asserted-by":"publisher","first-page":"11608","DOI":"10.1073\/pnas.1918257117","volume":"117","author":"M Blatt","year":"2020","unstructured":"Blatt, M., Gusev, A., Polyakov, Y., Goldwasser, S.: Secure large-scale genome-wide association studies using homomorphic encryption. PNAS 117(21), 11608\u201311613 (2020)","journal-title":"PNAS"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Christian, Mouchet, J., Troncoso-Pastoriza, J.P., Bossuat, J.P., Hubaux: multiparty homomorphic encryption from ring-learning-with-errors. In: Proceedings on Privacy Enhancing Technologies, pp. 291\u2014311. Sciendo (2021)","DOI":"10.2478\/popets-2021-0071"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"De\u00a0Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Pieprzyk, J., Sadeghi, AR., Manulis, M. (eds.) International Conference on Cryptology and Network Security, pp. 218\u2013231. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35404-5_17","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Debnath, S.K., Dutta, R.: Secure and efficient private set intersection cardinality using bloom filter. In: Lopez, J., Mitchell, C. (eds.) International Conference on Information Security, pp. 209\u2013226. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-23318-5_12","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Desfontaines, D., Lochbihler, A., Basin, D.: Cardinality estimators do not preserve privacy. arXiv preprint arXiv:1808.05879 (2018)","DOI":"10.2478\/popets-2019-0018"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Durand, M., Flajolet, P.: Loglog counting of large cardinalities. In: Di Battista, G., Zwick, U. (eds.) Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary, 16\u201319 September 2003. Proceedings, vol. 11, pp. 605\u2013617. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_55","DOI":"10.1007\/978-3-540-39658-1_55"},{"issue":"3\u20134","key":"4_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014). https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: Discrete Mathematics and Theoretical Computer Science, pp. 137\u2013156 (2007)","DOI":"10.46298\/dmtcs.3545"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"5910","DOI":"10.1038\/s41467-021-25972-y","volume":"12","author":"D Froelicher","year":"2021","unstructured":"Froelicher, D., et al.: Truly privacy-preserving federated analytics for precision medicine with multiparty homomorphic encryption. Nat. Commun. 12(1), 5910 (2021). https:\/\/doi.org\/10.1038\/s41467-021-25972-y","journal-title":"Nat. Commun."},{"key":"4_CR12","unstructured":"Gao, J., Trieu, N., Yanai, A.: Multiparty private set intersection cardinality and its applications. Cryptology ePrint Archive (2022)"},{"key":"4_CR13","unstructured":"Gentry, C.: A fully homomorphic encryption scheme (2009). http:\/\/crypto.stanford.edu\/craig"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Halevi, S., Polyakov, Y., Shoup, V.: An improved rns variant of the bfv homomorphic encryption scheme. In: Matsui, M. (ed.) Topics in Cryptology\u2013CT-RSA 2019: The Cryptographers\u2019 Track at the RSA Conference 2019, San Francisco, CA, USA, 4\u20138 March 2019, Proceedings, pp. 83\u2013105. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_5","DOI":"10.1007\/978-3-030-12612-4_5"},{"key":"4_CR15","unstructured":"Hu, C., et al.: How to make private distributed cardinality estimation practical, and get differential privacy for free. In: 30th USENIX security symposium (USENIX Security 2021), pp. 965\u2013982 (2021)"},{"key":"4_CR16","unstructured":"Kreuter, B., Wright, C.W., Skvortsov, E.S., Mirisola, R., Wang, Y.: Privacy-preserving secure cardinality and frequency estimation (2020)"},{"key":"4_CR17","unstructured":"Polyakov, Y., Rohloff, K., Ryan, G.W.: Palisade lattice cryptography library user manual. Cybersecurity Research Center, New Jersey Institute ofTechnology (NJIT). Technical Report 15 (2017)"},{"issue":"05","key":"4_CR18","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzz. Knowl.-Based Syst. 10(05), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzz. Knowl.-Based Syst."},{"issue":"Supplement-1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"i151","DOI":"10.1093\/bioinformatics\/btab292","volume":"37","author":"Z Tao","year":"2021","unstructured":"Tao, Z., Weber, G.M., Yu, Y.W.: Expected 10-anonymity of hyperloglog sketches for federated queries of clinical data repositories. Bioinformatics 37(Supplement-1), i151\u2013i160 (2021)","journal-title":"Bioinformatics"},{"issue":"7","key":"4_CR20","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1038\/s41576-022-00455-y","volume":"23","author":"Z Wan","year":"2022","unstructured":"Wan, Z., Hazel, J.W., Clayton, E.W., Vorobeychik, Y., Kantarcioglu, M., Malin, B.A.: Sociotechnical safeguards for genomic data privacy. Nat. Rev. Genet. 23(7), 429\u2013445 (2022)","journal-title":"Nat. Rev. Genet."},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3588935","volume":"1","author":"P Wang","year":"2023","unstructured":"Wang, P., et al.: An effective and differentially private protocol for secure distributed cardinality estimation. Proc. ACM Manag. Data 1(1), 1\u201324 (2023)","journal-title":"Proc. ACM Manag. Data"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jbi.2015.04.012","volume":"55","author":"GM Weber","year":"2015","unstructured":"Weber, G.M.: Federated queries of clinical data repositories: scaling to a national network. J. Biomed. Inf. 55, 231\u2013236 (2015)","journal-title":"J. Biomed. Inf."},{"issue":"11","key":"4_CR23","doi-asserted-by":"publisher","DOI":"10.2196\/18735","volume":"22","author":"YW Yu","year":"2020","unstructured":"Yu, Y.W., Weber, G.M.: Balancing accuracy and privacy in federated queries of clinical data repositories: algorithm development and validation. J. Med. Internet Res. 22(11), e18735 (2020)","journal-title":"J. Med. Internet Res."},{"issue":"1","key":"4_CR24","first-page":"328","volume":"34","author":"YW Yu","year":"2022","unstructured":"Yu, Y.W., Weber, G.M.: Hyperminhash: minhash in loglog space. IEEE Trans. Knowl. Data Eng. 34(1), 328\u2013339 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-0716-3989-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T08:03:15Z","timestamp":1715846595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-0716-3989-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9781071639887","9781071639894"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-1-0716-3989-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb.org\/recomb2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}