{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T18:37:41Z","timestamp":1784399861319,"version":"3.55.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030299613","type":"print"},{"value":"9783030299620","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-29962-0_21","type":"book-chapter","created":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T23:03:29Z","timestamp":1568502209000},"page":"439-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Privacy-Preserving Collaborative Medical Time Series Analysis Based on Dynamic Time Warping"],"prefix":"10.1007","author":[{"given":"Xiaoning","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xun","family":"Yi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,15]]},"reference":[{"key":"21_CR1","unstructured":"PhysioBank ATM. http:\/\/physionet.org\/cgi-bin\/atm\/ATM"},{"key":"21_CR2","unstructured":"UCR time series classification archive. https:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data_2018\/"},{"key":"21_CR3","unstructured":"104th United States Congress: Health Insurance Portability and Accountability Act of 1996 (HIPPA) (1996). https:\/\/www.hhs.gov\/hipaa\/index.html"},{"key":"21_CR4","unstructured":"Aggarwal, G., et al.: Two can keep a secret: a distributed architecture for secure database services. In: Proceedings of CIDR (2005)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: Proceedings of ACM CCS (2013)","DOI":"10.1145\/2508859.2516738"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Atallah, M., Bykova, M., Li, J., Frikken, K., Topkara, M.: Private collaborative forecasting and benchmarking. In: Proceedings of WPES (2004)","DOI":"10.1145\/1029179.1029204"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Baldi, P., Baronio, R., De Cristofaro, E., Gasti, P., Tsudik, G.: Countering Gattaca: efficient and secure testing of fully-sequenced human genomes. In: Proceedings of ACM CCS (2011)","DOI":"10.1145\/2046707.2046785"},{"key":"21_CR8","first-page":"452","volume":"6","author":"M Barni","year":"2011","unstructured":"Barni, M., Failla, P., Lazzeretti, R., Sadeghi, A.R., Schneider, T.: Privacy-preserving ECG classification with branching programs and neural networks. IEEE TIFS 6, 452\u2013468 (2011)","journal-title":"IEEE TIFS"},{"key":"21_CR9","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Proceedings of Crypto (1991)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Begum, N., Ulanova, L., Wang, J., Keogh, E.: Accelerating dynamic time warping clustering with a novel admissible pruning strategy. In: Proceedings of ACM SIGKDD (2015)","DOI":"10.1145\/2783258.2783286"},{"key":"21_CR11","unstructured":"Berndt, D.J., Clifford, J.: Using dynamic time warping to find patterns in time series. In: Proceedings of KDD Workshop (1994)"},{"key":"21_CR12","unstructured":"Blanton, M., Kang, A.R., Karan, S., Zola, J.: Privacy preserving analytics on distributed medical data. CoRR abs\/1806.06477 (2018). http:\/\/arxiv.org\/abs\/1806.06477"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laud, P., Randmets, J.: Domain-polymorphic language for privacy-preserving applications. In: Proceedings of the ACM Workshop on Language Support for Privacy-Enhancing Technologies (2013)","DOI":"10.1145\/2517872.2517875"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Proceedings of ESORICS (2008)","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: Proceedings of ACM CCS (2007)","DOI":"10.1145\/1315245.1315307"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.jbi.2015.04.007","volume":"55","author":"C Camara","year":"2015","unstructured":"Camara, C., Peris-Lopez, P., Tapiador, J.E.: Security and privacy issues in implantable medical devices: a comprehensive survey. J. Biomed. Inform. 55, 272\u2013289 (2015)","journal-title":"J. Biomed. Inform."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (2000)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Chen, Y., Hu, B., Keogh, E., Batista, G.E.: DTW-D: time series semi-supervised learning from a single example. In: Proceedings of ACM SIGKDD (2013)","DOI":"10.1145\/2487575.2487633"},{"issue":"6","key":"21_CR19","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1038\/nbt.4108","volume":"36","author":"H Cho","year":"2018","unstructured":"Cho, H., Wu, D.J., Berger, B.: Secure genome-wide association analysis using multiparty computation. Nat. Biotechnol. 36(6), 547\u2013551 (2018)","journal-title":"Nat. Biotechnol."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY-a framework for efficient mixed-protocol secure two-party computation. In: Proceedings of NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"21_CR21","unstructured":"European Parliament and of the Council: The General Data Protection Regulation (GDPR) (2016). http:\/\/data.europa.eu\/eli\/reg\/2016\/679\/2016-05-04"},{"key":"21_CR22","unstructured":"Huang, Y., Malka, L., Evans, D., Katz, J.: Efficient privacy-preserving biometric identification. In: Proceedings of NDSS (2011)"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/B978-155860869-6\/50043-3","volume-title":"VLDB '02: Proceedings of the 28th International Conference on Very Large Databases","author":"Eamonn Keogh","year":"2002","unstructured":"Keogh, E.: Exact indexing of dynamic time warping. In: Proceedings of VLDB (2002)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-319-07536-5_33","volume-title":"Applied Cryptography and Network Security","author":"F Kerschbaum","year":"2014","unstructured":"Kerschbaum, F., Schneider, T., Schr\u00f6pfer, A.: Automatic protocol selection in secure two-party computations. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 566\u2013584. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_33"},{"issue":"3","key":"21_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. J. Cryptol. 15(3), 177\u2013206 (2002)","journal-title":"J. Cryptol."},{"key":"21_CR26","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y., et al.: Fairplay-secure two-party computation system. In: Proceedings of USENIX Security (2004)"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: Proceedings of IEEE S&P (2017)","DOI":"10.1109\/SP.2017.12"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.: Privacy-preserving ridge regression on hundreds of millions of records. In: Proceedings of IEEE S&P (2013)","DOI":"10.1109\/SP.2013.30"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Rakthanmanon, T., et al.: Searching and mining trillions of time series subsequences under dynamic time warping. In: Proceedings of ACM SIGKDD (2012)","DOI":"10.1145\/2339530.2339576"},{"issue":"6191","key":"21_CR30","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492\u20131496 (2014)","journal-title":"Science"},{"key":"21_CR31","first-page":"47","volume":"2019","author":"A Salem","year":"2019","unstructured":"Salem, A., Berrang, P., Humbert, M., Backes, M.: Privacy-preserving similar patient queries for combined biomedical data. Proc. PETS 2019, 47\u201367 (2019)","journal-title":"Proc. PETS"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Tkachenko, O., Weinert, C., Schneider, T., Hamacher, K.: Large-scale privacy-preserving statistical computations for distributed genome-wide association studies. In: Proceedings of ACM AsiaCCS (2018)","DOI":"10.1145\/3196494.3196541"},{"key":"21_CR33","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 ACM CCS (2015)","DOI":"10.1145\/2810103.2813725"},{"key":"21_CR34","unstructured":"Wang, X.: FlexSC (2018). https:\/\/github.com\/wangxiao1254\/FlexSC"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: Proceedings of IEEE FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Yi, X., Bertino, E., Rao, F.Y., Bouguettaya, A.: Practical privacy-preserving user profile matching in social networks. In: Proceedings of IEEE ICDE (2016)","DOI":"10.1109\/ICDE.2016.7498255"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"Zheng, W., Popa, R., Gonzalez, J.E., Stoica, I.: Helen: Maliciously secure coopetitive learning for linear models. In: Proceedings of IEEE S&P (2019)","DOI":"10.1109\/SP.2019.00045"},{"key":"21_CR38","unstructured":"Zheng, Y., Duan, H., Tang, X., Wang, C., Zhou, J.: Denoising in the dark: privacy-preserving deep neural network based image denoising. IEEE TDSC (2019)"},{"issue":"10","key":"21_CR39","first-page":"2475","volume":"13","author":"Y Zheng","year":"2018","unstructured":"Zheng, Y., Duan, H., Wang, C.: Learning the truth privately and confidently: encrypted confidence-aware truth discovery in mobile crowdsensing. IEEE TIFS 13(10), 2475\u20132489 (2018)","journal-title":"IEEE TIFS"},{"key":"21_CR40","unstructured":"Zhu, H., Meng, X., Kollios, G.: Privacy preserving similarity evaluation of time series data. In: Proceedings of EDBT (2014)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29962-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:14:15Z","timestamp":1726359255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29962-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299613","9783030299620"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29962-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","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":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.laas.fr\/esorics\/","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":"344","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":"67","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":"0","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":"19% - 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":"3,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":"11","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}