{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:38:55Z","timestamp":1779896335462,"version":"3.53.1"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bibm.2018.8621291","type":"proceedings-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T17:32:01Z","timestamp":1551375121000},"page":"761-764","source":"Crossref","is-referenced-by-count":14,"title":["Efficient and Private Set Intersection of Human Genomes"],"prefix":"10.1109","author":[{"given":"Liyan","family":"Shen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dakui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binxing","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ye","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq559"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"ref3","first-page":"203","article-title":"Privacypreserving matching of dna profiles","volume":"2008","author":"bruekers","year":"2008","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref6","first-page":"143","article-title":"Practical private set intersection protocols with linear complexity","author":"de cristofaro","year":"2010","journal-title":"International Conference on Financial Cryptography and Data Security"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.fsigen.2008.03.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2381966.2381980"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1197\/jamia.M1603"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1000167"},{"key":"ref9","first-page":"145","article-title":"Extending oblivious transfers efficiently","author":"ishai","year":"2003","journal-title":"International Cryptology Conference on Advances in Cryptology"}],"event":{"name":"2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","location":"Madrid, Spain","start":{"date-parts":[[2018,12,3]]},"end":{"date-parts":[[2018,12,6]]}},"container-title":["2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8609864\/8621069\/08621291.pdf?arnumber=8621291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T20:26:34Z","timestamp":1598214394000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8621291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/bibm.2018.8621291","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}