{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:39:49Z","timestamp":1743086389053,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030373511"},{"type":"electronic","value":"9783030373528"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37352-8_24","type":"book-chapter","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T20:03:00Z","timestamp":1577995380000},"page":"275-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Secure Computation of Similar Patient Query on Genomic Data Under Multiple Keys"],"prefix":"10.1007","author":[{"given":"Chuan","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Shengnan","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shan","family":"Jing","sequence":"additional","affiliation":[]},{"given":"Zhenxiang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/s12920-017-0279-9","volume":"10","author":"MMA Aziz","year":"2017","unstructured":"Aziz, M.M.A., Alhadidi, D., Mohammed, N.: Secure approximation of edit distance on genomic data. BMC Med. Genomics 10(2), 41 (2017)","journal-title":"BMC Med. Genomics"},{"issue":"6","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1137\/090767182","volume":"41","author":"A Andoni","year":"2012","unstructured":"Andoni, A., Onak, K.: Approximating edit distance in near-linear time. SIAM J. Comput. 41(6), 1635\u20131648 (2012)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1515\/popets-2018-0034","volume":"2018","author":"G Asharov","year":"2018","unstructured":"Asharov, G., Halevi, S., Lindell, Y., Rabin, T.: Privacy-preserving search of similar patients in genomic data. Proc. Priv. Enhancing Technol. 2018(4), 104\u2013124 (2018)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"24_CR4","unstructured":"Aziz, A., Momin, Md., Hasan, M.Z., Mohammed, N., Alhadidi, D.: Secure and efficient multiparty computation on genomic data. In: Proceedings of the 20th International Database Engineering & Applications Symposium, pp. 278\u2013283. ACM (2016)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-40061-5_3","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"E Bresson","year":"2003","unstructured":"Bresson, E., Catalano, D., Pointcheval, D.: A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 37\u201354. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-40061-5_3"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ygeno.2015.11.003","volume":"107","author":"JM Heather","year":"2016","unstructured":"Heather, J.M., Chain, B.: The sequence of sequencers: the history of sequencing DNA. Genomics 107(1), 1\u20138 (2016)","journal-title":"Genomics"},{"key":"24_CR7","unstructured":"Jurafsky, D.: Speech & Language Processing. Pearson Education (2000)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"12","key":"24_CR9","doi-asserted-by":"publisher","first-page":"2046","DOI":"10.1109\/TIFS.2013.2288131","volume":"8","author":"A Peter","year":"2013","unstructured":"Peter, A., Tews, E., Katzenbeisser, S.: Efficiently outsourcing multiparty computation under multiple keys. IEEE Trans. Inf. Forensics Secur. 8(12), 2046\u20132058 (2013)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"5507","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.1058040","volume":"291","author":"JC Venter","year":"2001","unstructured":"Venter, J.C., et al.: The sequence of the human genome. Science 291(5507), 1304\u20131351 (2001)","journal-title":"Science"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM (JACM) 21(1), 168\u2013173 (1974)","journal-title":"J. ACM (JACM)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Huang, Y., Zhao, Y., Tang, H., Wang, X., Bu, D.: Efficient genome-wide, privacy-preserving similar patient query based on private edit distance. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 492\u2013503. ACM (2015)","DOI":"10.1145\/2810103.2813725"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"e19","DOI":"10.2196\/jmir.1549","volume":"12","author":"P Wicks","year":"2010","unstructured":"Wicks, P., et al.: Sharing health data for better outcomes on patientslikeme. J. Med. Internet Res. 12(2), e19 (2010)","journal-title":"J. Med. Internet Res."}],"container-title":["Lecture Notes in Computer Science","Cyberspace Safety and Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37352-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T00:37:43Z","timestamp":1578011863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37352-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030373511","9783030373528"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37352-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyberspace Safety and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"css2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/css2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"235","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}