{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:49Z","timestamp":1740099229624,"version":"3.37.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030026400"},{"type":"electronic","value":"9783030026417"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-02641-7_4","type":"book-chapter","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T13:24:09Z","timestamp":1541769849000},"page":"71-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Privacy-Preserving Whole-Genome Variant Queries"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Demmler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kay","family":"Hamacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Stammler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,10]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, A., Momin, M., Hasan, M.Z., Mohammed, N., Alhadidi, D.: Secure and efficient multiparty computation on genomic data. In: 20th International Database Engineering and Applications Symposium (IDEAS 2016), pp. 278\u2013283. ACM (2016)","DOI":"10.1145\/2938503.2938507"},{"key":"4_CR2","unstructured":"Asharov, G., Halevi, S., Lindell, Y., Rabin, T.: Privacy-preserving search of similar patients in genomic data. Cryptology ePrint Archive, Report 2017\/144 (2017). https:\/\/eprint.iacr.org\/2017\/144"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: 20th ACM Conference on Computer and Communications Security (CCS 2013), pp. 535\u2013548. ACM (2013)","DOI":"10.1145\/2508859.2516738"},{"key":"4_CR4","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: 18th ACM Conference on Computer and Communications Security (CCS 2011), pp. 691\u2013702. ACM (2011)","DOI":"10.1145\/2046707.2046785"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143\u2013159. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_13"},{"issue":"15","key":"4_CR7","doi-asserted-by":"publisher","first-page":"2156","DOI":"10.1093\/bioinformatics\/btr330","volume":"27","author":"P Danecek","year":"2011","unstructured":"Danecek, P., et al.: The variant call format and VCFtools. Bioinformatics 27(15), 2156\u20132158 (2011)","journal-title":"Bioinformatics"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Faber, S., Tsudik, G.: Secure genomic testing with size- and position-hiding private substring matching. In: 12th ACM Workshop on Privacy in the Electronic Society (WPES 2013), pp. 107\u2013118. ACM (2013)","DOI":"10.1145\/2517840.2517849"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: 22th Network and Distributed System Security Symposium (NDSS 2015). The Internet Society (2015)","DOI":"10.14722\/ndss.2015.23113"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T Gamal El","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"4_CR11","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1101\/gr.114819.110","volume":"21","author":"MHY Fritz","year":"2011","unstructured":"Fritz, M.H.Y., Leinonen, R., Cochrane, G., Birney, E.: Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome Res. 21(5), 734\u2013740 (2011)","journal-title":"Genome Res."},{"key":"4_CR12","first-page":"152","volume":"4","author":"D Froelicher","year":"2017","unstructured":"Froelicher, D., et al.: UnLynx: a decentralized system for privacy-conscious data sharing. Proc. Priv. Enhancing Technol. 4, 152\u2013170 (2017)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Fuller, B., et al.: SoK: cryptographically protected database search. In: 38th IEEE Symposium on Security and Privacy (S&P 2017), pp. 172\u2013191 (2017)","DOI":"10.1109\/SP.2017.10"},{"key":"4_CR14","volume-title":"The Foundations of Cryptography - Volume 2, Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: 19th ACM Conference on Theory of Computing (STOC 1987), pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: The mastermind attack on genomic data. In: 30th IEEE Symposium on Security and Privacy (S&P 2009), pp. 204\u2013218. IEEE (2009)","DOI":"10.1109\/SP.2009.4"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-319-70697-9_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"D G\u00fcnther","year":"2017","unstructured":"G\u00fcnther, D., Kiss, \u00c1., Schneider, T.: More efficient universal circuit constructions. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 443\u2013470. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_16 . http:\/\/thomaschneider.de\/papers\/GKS17.pdf . Full version: http:\/\/ia.cr\/2017\/798"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-662-53357-4_20","volume-title":"Financial Cryptography and Data Security","author":"D Gupta","year":"2016","unstructured":"Gupta, D., Mood, B., Feigenbaum, J., Butler, K., Traynor, P.: Using intel software guard extensions for efficient two-party secure function evaluation. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 302\u2013318. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_20"},{"issue":"10","key":"4_CR19","first-page":"25","volume":"3","author":"K Hamacher","year":"2014","unstructured":"Hamacher, K., Hubaux, J.P., Tsudik, G.: Genomic Privacy (Dagstuhl Seminar 13412). Dagstuhl Rep. 3(10), 25\u201335 (2014). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2014\/4426","journal-title":"Dagstuhl Rep."},{"key":"4_CR20","unstructured":"Hasan, M.Z., Mahdi, M.S.R., Mohammed, N.: Secure count query on encrypted genomic data. In: 3rd International Workshop on Genome Privacy and Security (GenoPri 2016) (2017). https:\/\/arxiv.org\/abs\/1703.01534"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: 20th USENIX Security Symposium (USENIX Security 2011). USENIX (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Jha, S., Kruger, L., Shmatikov, V.: Towards practical privacy for genomic computation. In: 29th IEEE Symposium on Security and Privacy (S&P 2008), pp. 216\u2013230. IEEE (2008)","DOI":"10.1109\/SP.2008.34"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Karvelas, N., Peter, A., Katzenbeisser, S., Tews, E., Hamacher, K.: Privacy-preserving whole genome sequence processing through proxy-aided ORAM. In: 13rd Workshop on Privacy in the Electronic Society (WPES 2014), pp. 1\u201310. ACM (2014)","DOI":"10.1145\/2665943.2665962"},{"key":"4_CR25","unstructured":"Kerschbaum, F., Beck, M., Sch\u00f6nfeld, D.: Inference control for privacy-preserving genome matching. CoRR abs\/1405.0205 (2014). https:\/\/arxiv.org\/abs\/1405.0205"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-662-49890-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"\u00c1 Kiss","year":"2016","unstructured":"Kiss, \u00c1., Schneider, T.: Valiant\u2019s universal circuit is practical. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 699\u2013728. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_27"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-85230-8_7","volume-title":"Financial Cryptography and Data Security","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 83\u201397. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85230-8_7 . http:\/\/thomaschneider.de\/papers\/KS08UC.pdf . Code: http:\/\/encrypto.de\/code\/FairplayPF"},{"issue":"16","key":"4_CR28","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., et al.: The Sequence Alignment\/Map format and SAMtools. Bioinformatics 25(16), 2078\u20132079 (2009)","journal-title":"Bioinformatics"},{"key":"4_CR29","unstructured":"Lipmaa, H., Mohassel, P., Sadeghian, S.S.: Valiant\u2019s universal circuit: improvements, implementation, and applications. IACR Cryptology ePrint Archive 2016(17) (2016). http:\/\/ia.cr\/2016\/017"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K.E., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: 3rd ACM Cloud Computing Security Workshop (CCSW 2011), pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"4_CR32","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). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"4_CR33","unstructured":"Perillo, A.M., Cristofaro, E.D.: PAPEETE: private, authorized, and fast personal genomic testing. Technical report 770 (2017). https:\/\/ia.cr\/2017\/770"},{"issue":"5","key":"4_CR34","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/j.ajhg.2015.09.010","volume":"97","author":"S Shringarpure","year":"2015","unstructured":"Shringarpure, S., Bustamante, C.: Privacy risks from genomic data-sharing beacons. Am. J. Hum. Genet. 97(5), 631\u2013646 (2015)","journal-title":"Am. J. Hum. Genet."},{"issue":"2","key":"4_CR35","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1186\/s12920-017-0275-0","volume":"10","author":"JS Sousa","year":"2017","unstructured":"Sousa, J.S., et al.: Efficient and secure outsourcing of genomic data storage. BMC Med. Genomics 10(2), 46 (2017)","journal-title":"BMC Med. Genomics"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: 8th ACM Symposium on Theory of Computing (STOC 1976), pp. 196\u2013203. ACM (1976)","DOI":"10.1145\/800113.803649"},{"key":"4_CR37","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: 22nd ACM Conference on Computer and Communications (CCS 2015), pp. 492\u2013503. ACM (2015)","DOI":"10.1145\/2810103.2813725"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Symposium on Foundations of Computer Science (FOCS 1986), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"issue":"5","key":"4_CR39","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1093\/bioinformatics\/bts001","volume":"28","author":"N You","year":"2012","unstructured":"You, N., et al.: SNP calling using genotype model selection on high-throughput sequencing data. Bioinformatics 28(5), 643 (2012)","journal-title":"Bioinformatics"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-45744-4_7","volume-title":"Computer Security \u2013 ESORICS 2016","author":"J Zhou","year":"2016","unstructured":"Zhou, J., Cao, Z., Dong, X.: PPOPM: more efficient privacy preserving outsourced pattern matching. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 135\u2013153. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45744-4_7"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02641-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T18:07:30Z","timestamp":1662401250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02641-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030026400","9783030026417"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02641-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/crypto.ie.cuhk.edu.hk\/cans17\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"88","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23% - 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"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}