{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T03:19:53Z","timestamp":1770347993302,"version":"3.49.0"},"reference-count":82,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"UC Irvine CORCL award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2023,8,30]]},"abstract":"<jats:p>Exciting recent advances in genome sequencing, coupled with greatly reduced storage and computation costs, make genomic testing increasingly accessible to individuals. Already today, one\u2019s digitized DNA can be easily obtained from a sequencing lab and later used to conduct numerous tests by engaging with a testing facility. Due to the inherent sensitivity of genetic material and the often-proprietary nature of genomic tests, privacy is a natural and crucial issue. While genomic privacy received a great deal of attention within and outside the research community, genomic security has not been sufficiently studied. This is surprising since the usage of fake or altered genomes can have grave consequences, such as erroneous drug prescriptions and genetic test outcomes.<\/jats:p>\n          <jats:p>\n            Unfortunately, in the genomic domain, privacy and security (as often happens) are at odds with each other. In this article, we attempt to reconcile security with privacy in genomic testing by designing a novel technique for a secure and private genomic range query protocol between a genomic testing facility and an individual user. The proposed technique ensures\n            <jats:italic>authenticity<\/jats:italic>\n            and\n            <jats:italic>completeness<\/jats:italic>\n            of user-supplied genomic material while maintaining its\n            <jats:italic>privacy<\/jats:italic>\n            by releasing only the minimum thereof. To confirm its broad usability, we show how to apply the proposed technique to a previously proposed genomic private substring matching protocol. Experiments show that the proposed technique offers good performance and is quite practical. Furthermore, we generalize the genomic range query problem to sparse integer sets and discuss potential use cases.\n          <\/jats:p>","DOI":"10.1145\/3575796","type":"journal-article","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T12:12:04Z","timestamp":1670587924000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Balancing Security and Privacy in Genomic Range Queries"],"prefix":"10.1145","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7674-6763","authenticated-orcid":false,"given":"Seoyeon","family":"Hwang","sequence":"first","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8789-8372","authenticated-orcid":false,"given":"Ercan","family":"Ozturk","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8467-8614","authenticated-orcid":false,"given":"Gene","family":"Tsudik","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"23andMe. Retrieved January 24 2022 from https:\/\/www.23andme.com\/."},{"key":"e_1_3_3_3_2","unstructured":"CRI Genetics. Retrieved January 24 2022 from https:\/\/www.crigenetics.com\/."},{"key":"e_1_3_3_4_2","unstructured":"GO. Retrieved January 24 2022 from https:\/\/golang.org\/."},{"key":"e_1_3_3_5_2","unstructured":"How do geneticists indicate the location of a gene? Retrieved January 24 2022 from https:\/\/ghr.nlm.nih.gov\/primer\/howgeneswork\/genelocation."},{"key":"e_1_3_3_6_2","unstructured":"The Legion of the Bouncy Castle. Retrieved January 24 2022 from https:\/\/www.bouncycastle.org\/."},{"key":"e_1_3_3_7_2","unstructured":"Paillier. Retrieved January 24 2022 from https:\/\/github.com\/didiercrunch\/paillier."},{"key":"e_1_3_3_8_2","unstructured":"SecureRandom (Java Platform SE 8). Retrieved January 24 2022 from https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/security\/SecureRandom.html."},{"key":"e_1_3_3_9_2","unstructured":"SNP. Retrieved January 24 2022 from https:\/\/www.nature.com\/scitable\/definition\/snp-295\/#::text=If%20more%20than%201%25%20of having%20more%20than%20one%20allele."},{"key":"e_1_3_3_10_2","unstructured":"Whole Genome Association Studies. Retrieved January 24 2022 from https:\/\/www.genome.gov\/17516714\/2006-release-about-whole-genome-association-studies."},{"key":"e_1_3_3_11_2","unstructured":"Zero-Knowledge Proofs. Retrieved January 24 2022 from https:\/\/github.com\/ing-bank\/zkproofs."},{"key":"e_1_3_3_12_2","unstructured":"National Research Council (US) Committee on Mapping and Sequencing the Human Genome. 1988. Mapping and Sequencing the Human Genome.Washington DC: National Academies Press (US) 1988. 2 Introduction. Retrieved January 31 2022 from https:\/\/www.ncbi.nlm.nih.gov\/books\/NBK218247\/."},{"key":"e_1_3_3_13_2","unstructured":"2012. Secure Hash Standard. FIPS PUB 180-4 Information Technology Laboratory National Institute of Standards and Technology Gaithersburg MD 2012."},{"key":"e_1_3_3_14_2","unstructured":"S. Hwang E. Ozturk and G. Tsudik. 2022. Source code for evaluation. https:\/\/github.com\/sprout-uci\/genomic-security-journal-code."},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","unstructured":"Mikhail J. Atallah Florian Kerschbaum and Wenliang Du. 2003. Secure and private sequence comparisons. In Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society (WPES\u201903) Association for Computing Machinery New York NY 39\u201344. 10.1145\/1005140.1005147","DOI":"10.1145\/1005140.1005147"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-005-0070-3"},{"key":"e_1_3_3_17_2","volume-title":"Proceeding of the Network and Distributed System Security Symposium (NDSS\u201913)","author":"Ayday Erman","year":"2013","unstructured":"Erman Ayday, Jean Louis Raisaro, and Jean-Pierre Hubaux. 2013. Privacy-enhancing technologies for medical tests using genomic data. In Proceeding of the Network and Distributed System Security Symposium (NDSS\u201913)."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2517840.2517843"},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"107538","DOI":"10.1016\/j.compbiolchem.2021.107538","article-title":"A survey on genomic data by privacy-preserving techniques perspective","volume":"93","author":"B. Abinaya","year":"2021","unstructured":"Abinaya B. and Santhi S.2021. A survey on genomic data by privacy-preserving techniques perspective. Computational Biology and Chemistry 93 (2021), 107538.","journal-title":"Computational Biology and Chemistry"},{"key":"e_1_3_3_20_2","doi-asserted-by":"crossref","unstructured":"Pierre Baldi Roberta Baronio Emiliano De Cristofaro Paolo Gasti and Gene Tsudik. 2011. Countering GATTACA: Efficient and secure testing of fully-sequenced human genomes. In Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS\u201911) Association for Computing Machinery New York NY 691\u2013702. 10.1145\/2046707.2046785","DOI":"10.1145\/2046707.2046785"},{"key":"e_1_3_3_21_2","first-page":"1","volume-title":"Advances in Cryptology (CRYPTO\u201996)","author":"Bellare Mihir","year":"1996","unstructured":"Mihir Bellare, Ran Canetti, and Hugo Krawczyk. 1996. Keying hash functions for message authentication. In Advances in Cryptology (CRYPTO\u201996), Neal Koblitz (Ed.). Springer, Berlin,1\u201315."},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology (EUROCRYPT\u201998)","author":"Blaze Matt","year":"1998","unstructured":"Matt Blaze, Gerrit Bleumer, and Martin Strauss. 1998. Divertible protocols and atomic proxy cryptography. In Advances in Cryptology (EUROCRYPT\u201998), Kaisa Nyberg (Ed.). Springer, Berlin,127\u2013144."},{"key":"e_1_3_3_23_2","first-page":"3","volume-title":"Fundamenta Mathematicae","author":"Blumberg Henry","year":"1939","unstructured":"Henry Blumberg. 1939. Exceptional sets. In Fundamenta Mathematicae. 3\u201332."},{"issue":"7","key":"e_1_3_3_24_2","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1038\/s41588-020-0651-0","article-title":"Privacy challenges and research opportunities for genomic data sharing","volume":"52","author":"Bonomi Luca","year":"2020","unstructured":"Luca Bonomi, Yingxiang Huang, and Lucila Ohno-Machado. 2020. Privacy challenges and research opportunities for genomic data sharing. Nature Genetics 52, 7 (July2020), 646\u2013654.","journal-title":"Nature Genetics"},{"key":"e_1_3_3_25_2","first-page":"431","volume-title":"International Conference on the Theory and Applications of Cryptographic Techniques","author":"Boudot Fabrice","year":"2000","unstructured":"Fabrice Boudot. 2000. Efficient proofs that a committed number lies in an interval. In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 431\u2013444."},{"issue":"5","key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MSP.2017.3681055","article-title":"Genomic security (lest we forget)","volume":"15","author":"Bradley Tatiana","year":"2017","unstructured":"Tatiana Bradley, Xuhua Ding, and Gene Tsudik. 2017. Genomic security (lest we forget). IEEE Security & Privacy 15, 5 (2017), 38\u201346.","journal-title":"IEEE Security & Privacy"},{"key":"e_1_3_3_27_2","first-page":"156","volume-title":"Conference on the Theory and Application of Cryptographic Techniques","author":"Brickell Ernest F.","year":"1987","unstructured":"Ernest F. Brickell, David Chaum, Ivan B. Damg\u00e5rd, and Jeroen van de Graaf. 1987. Gradual and verifiable release of a secret. In Conference on the Theory and Application of Cryptographic Techniques. Springer, 156\u2013166."},{"key":"e_1_3_3_28_2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/SP.2018.00020","volume-title":"2018 IEEE Symposium on Security and Privacy (SP\u201918)","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. 2018. Bulletproofs: Short proofs for confidential transactions and more. In 2018 IEEE Symposium on Security and Privacy (SP\u201918). IEEE, 315\u2013334."},{"key":"e_1_3_3_29_2","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Rafik Chaabouni and Abhi Shelat. 2008. Efficient protocols for set membership and range proofs. In Proceeding of the Advances in Cryptology-(ASIACRYPT\u201908) Josef Pieprzyk (Ed.). Springer Berlin Heidelberg 234\u2013252.","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-53997-8_4","volume-title":"Public Key Infrastructures, Services and Applications","author":"Canard S\u00e9bastien","year":"2014","unstructured":"S\u00e9bastien Canard, Iwen Coisel, Amandine Jambert, and Jacques Traor\u00e9. 2014. New results for the practical use of range proofs. In Public Key Infrastructures, Services and Applications, Sokratis Katsikas and Isaac Agudo (Eds.). Springer, Berlin,47\u201364."},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054154"},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-662-48051-9_15","volume-title":"Financial Cryptography and Data Security","author":"Cheon Jung Hee","year":"2015","unstructured":"Jung Hee Cheon, Miran Kim, and Kristin Lauter. 2015. Homomorphic computation of edit distance. In Financial Cryptography and Data Security, Michael Brenner, Nicolas Christin, Benjamin Johnson, and Kurt Rohloff (Eds.). Springer, Berlin,194\u2013212."},{"key":"e_1_3_3_33_2","first-page":"120","volume-title":"Proceedings of the Workshop on Selected Areas of Cryptography","author":"Clarkson Josh Benaloh","year":"1994","unstructured":"Josh Benaloh Clarkson. 1994. Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography. 120\u2013128."},{"key":"e_1_3_3_34_2","first-page":"103","volume-title":"Advances in Cryptology (EUROCRYPT\u201997)","author":"Cramer Ronald","year":"1997","unstructured":"Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers. 1997. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology (EUROCRYPT\u201997), Walter Fumy (Ed.). Springer, Berlin,103\u2013118."},{"key":"e_1_3_3_35_2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"Damg\u00e5rd Ivan","year":"2001","unstructured":"Ivan Damg\u00e5rd and Mads Jurik. 2001. A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In Public Key Cryptography, Kwangjo Kim (Ed.). Springer, Berlin,119\u2013136."},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/2665943.2665952","volume-title":"Proceedings of the 13th Workshop on Privacy in the Electronic Society","author":"Danezis George","year":"2014","unstructured":"George Danezis and Emiliano De Cristofaro. 2014. Fast and private genomic testing for disease susceptibility. In Proceedings of the 13th Workshop on Privacy in the Electronic Society. ACM, 31\u201334."},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/2381966.2381980","volume-title":"Proceedings of the 2012 ACM Workshop on Privacy in the Electronic Society","author":"Cristofaro Emiliano De","year":"2012","unstructured":"Emiliano De Cristofaro, Sky Faber, Paolo Gasti, and Gene Tsudik. 2012. Genodroid: Are privacy-preserving genomic tests ready for prime time? In Proceedings of the 2012 ACM Workshop on Privacy in the Electronic Society. ACM, 97\u2013108."},{"key":"e_1_3_3_38_2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/2517840.2517849","volume-title":"Proceedings of the 12th ACM Workshop on Workshop on Privacy in the Electronic Society","author":"Cristofaro Emiliano De","year":"2013","unstructured":"Emiliano De Cristofaro, Sky Faber, and Gene Tsudik. 2013. Secure genomic testing with size-and position-hiding private substring matching. In Proceedings of the 12th ACM Workshop on Workshop on Privacy in the Electronic Society. 107\u2013118."},{"key":"e_1_3_3_39_2","first-page":"1","volume-title":"2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC\u201919)","author":"Deng Chunhua","year":"2019","unstructured":"Chunhua Deng, Jia Fan, Zhen Wang, Yili Luo, Yue Zheng, Yixin Li, and Jianwei Ding. 2019. A survey on range proof and its applications on blockchain. In 2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC\u201919). 1\u20138. 10.1109\/CyberC.2019.00011"},{"issue":"3","key":"e_1_3_3_40_2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.3233\/JCS-2003-11302","article-title":"Authentic data publication over the Internet","volume":"11","author":"Devanbu Premkumar","year":"2003","unstructured":"Premkumar Devanbu, Michael Gertz, Charles Martel, and Stuart G. Stubblebine. 2003. Authentic data publication over the Internet. Journal of Computer Security 11, 3 (2003), 291\u2013314.","journal-title":"Journal of Computer Security"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3338498.3358652"},{"issue":"4","key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal Taher","year":"1985","unstructured":"Taher ElGamal. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 4 (1985), 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.gpb.2015.01.009","article-title":"Nanopore-based fourth-generation DNA sequencing technology","volume":"13","author":"Feng Yanxiao","year":"2015","unstructured":"Yanxiao Feng, Yuechuan Zhang, Cuifeng Ying, Deqiang Wang, and Chunlei Du. 2015. Nanopore-based fourth-generation DNA sequencing technology. Genomics, Proteomics & Bioinformatics 13, 1 (2015), 4\u201316.","journal-title":"Genomics, Proteomics & Bioinformatics"},{"key":"e_1_3_3_44_2","first-page":"186","volume-title":"Proceedings on Advances in Cryptology (CRYPTO\u201986)","author":"Fiat Amos","year":"1987","unstructured":"Amos Fiat and Adi Shamir. 1987. How to prove yourself: Practical solutions to identification and signature problems. In Proceedings on Advances in Cryptology (CRYPTO\u201986). Springer-Verlag, Berlin, 186\u2013194."},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052225"},{"key":"e_1_3_3_46_2","first-page":"365","volume-title":"Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC\u201982)","author":"Goldwasser Shafi","year":"1982","unstructured":"Shafi Goldwasser and Silvio Micali. 1982. Probabilistic encryption & how to play mental poker keeping secret all partial information. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC\u201982). Association for Computing Machinery, New York, NY, 365\u2013377. 10.1145\/800070.802212"},{"key":"e_1_3_3_47_2","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/11496137_32","volume-title":"Applied Cryptography and Network Security","author":"Groth Jens","year":"2005","unstructured":"Jens Groth. 2005. Non-interactive zero-knowledge arguments for voting. In Applied Cryptography and Network Security, John Ioannidis, Angelos Keromytis, and Moti Yung (Eds.). Springer, Berlin, 467\u2013482."},{"key":"e_1_3_3_48_2","article-title":"An Implementation of homomorphic encryption","author":"Halevi Shai","unstructured":"Shai Halevi and Victor Shoup. An Implementation of homomorphic encryption. Retrieved January 31, 2022, from https:\/\/github.com\/shaih\/HElib(2013).","journal-title":"https:\/\/github.com\/shaih\/HElib(2013)"},{"key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.jbi.2018.03.003","article-title":"Secure count query on encrypted genomic data","volume":"81","author":"Hasan Mohammad Zahidul","year":"2018","unstructured":"Mohammad Zahidul Hasan, Md Safiur Rahman Mahdi, Md Nazmus Sadat, and Noman Mohammed. 2018. Secure count query on encrypted genomic data. Journal of Biomedical Informatics 81 (2018), 41\u201352.","journal-title":"Journal of Biomedical Informatics"},{"issue":"2","key":"e_1_3_3_50_2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1038\/nnano.2015.307","article-title":"Graphene nanodevices for DNA sequencing","volume":"11","author":"Heerema Stephanie J.","year":"2016","unstructured":"Stephanie J. Heerema and Cees Dekker. 2016. Graphene nanodevices for DNA sequencing. Nature Nanotechnology 11, 2 (2016), 127.","journal-title":"Nature Nanotechnology"},{"key":"e_1_3_3_51_2","first-page":"720","volume-title":"Proceedings of the 30th International Conference on Very Large Data Bases-Volume 30","author":"Hore Bijit","year":"2004","unstructured":"Bijit Hore, Sharad Mehrotra, and Gene Tsudik. 2004. A privacy-preserving index for range queries. In Proceedings of the 30th International Conference on Very Large Data Bases-Volume 30. VLDB Endowment, 720\u2013731."},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.34"},{"issue":"5","key":"e_1_3_3_53_2","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/TITB.2007.908465","article-title":"A cryptographic approach to securely share and query genomic sequences","volume":"12","author":"Kantarcioglu Murat","year":"2008","unstructured":"Murat Kantarcioglu, Wei Jiang, Ying Liu, and Bradley Malin. 2008. A cryptographic approach to securely share and query genomic sequences. IEEE Transactions on Information Technology in Biomedicine 12, 5 (2008), 606\u2013617.","journal-title":"IEEE Transactions on Information Technology in Biomedicine"},{"key":"e_1_3_3_54_2","doi-asserted-by":"crossref","unstructured":"Akinori Kawachi Keisuke Tanaka and Keita Xagawa. 2007. Multi-bit cryptosystems based on lattice problems. In International Workshop on Public Key Cryptography 315\u2013329. 10.1007\/978-3-540-71677-8_21","DOI":"10.1007\/978-3-540-71677-8_21"},{"key":"e_1_3_3_55_2","article-title":"Cryptographic Extraction and Key Derivation: The HKDF Scheme","author":"Krawczyk Hugo","unstructured":"Hugo Krawczyk. Cryptographic Extraction and Key Derivation: The HKDF Scheme. Cryptology ePrint Archive, Report 2010\/264, https:\/\/ia.cr\/2010\/264.","journal-title":"Cryptology ePrint Archive, Report 2010\/264, https:\/\/ia.cr\/2010\/264"},{"key":"e_1_3_3_56_2","first-page":"3","volume-title":"Progress in Cryptology (LATINCRYPT\u201914)","author":"Lauter Kristin","year":"2015","unstructured":"Kristin Lauter, Adriana L\u00f3pez-Alt, and Michael Naehrig. 2015. Private computation on encrypted genomic data. In Progress in Cryptology (LATINCRYPT\u201914), Diego F. Aranha and Alfred Menezes (Eds.). Springer International Publishing, Cham, 3\u201327."},{"key":"e_1_3_3_57_2","first-page":"121","volume-title":"Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data","author":"Li Feifei","year":"2006","unstructured":"Feifei Li, Marios Hadjieleftheriou, George Kollios, and Leonid Reyzin. 2006. Dynamic authenticated index structures for outsourced databases. In Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data. ACM, 121\u2013132."},{"key":"e_1_3_3_58_2","first-page":"398","volume-title":"Advances in Cryptology (ASIACRYPT\u201903)","author":"Lipmaa Helger","year":"2003","unstructured":"Helger Lipmaa. 2003. On diophantine complexity and statistical zero-knowledge arguments. In Advances in Cryptology (ASIACRYPT\u201903), Chi-Sung Laih (Ed.). Springer, Berlin,398\u2013415."},{"key":"e_1_3_3_59_2","unstructured":"Helger Lipmaa N. Asokan and Valtteri Niemi. 2001. Secure Vickrey Auctions without Threshold Trust. (2001). http:\/\/eprint.iacr.org\/2001\/095.Published in Financial Cryptography 2002. helger@tcs.hut.fi 11810 received 13 Nov 2001 last revised 3 May 2002."},{"issue":"4","key":"e_1_3_3_60_2","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1142\/S0218196709005135","article-title":"Sparse, thin and other subsets of groups","volume":"19","author":"Lutsenko Ie","year":"2009","unstructured":"Ie Lutsenko and I. V. Protasov. 2009. Sparse, thin and other subsets of groups. International Journal of Algebra and Computation 19, 4 (2009), 491\u2013510.","journal-title":"International Journal of Algebra and Computation"},{"key":"e_1_3_3_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214086"},{"key":"e_1_3_3_62_2","doi-asserted-by":"crossref","first-page":"587","DOI":"10.18388\/abp.2001_3893","article-title":"The human genome structure and organization","volume":"48","author":"Makalowski Wojciech","year":"2001","unstructured":"Wojciech Makalowski. 2001. The human genome structure and organization. Acta Biochimica Polonica 48 (2001), 587\u2013598.","journal-title":"Acta Biochimica Polonica"},{"key":"e_1_3_3_63_2","first-page":"60","volume-title":"International Workshop on Public Key Cryptography","author":"Mao Wenbo","year":"1998","unstructured":"Wenbo Mao. 1998. Guaranteed correct sharing of integer factorization with off-line shareholders. In International Workshop on Public Key Cryptography. Springer, 60\u201371."},{"issue":"7333","key":"e_1_3_3_64_2","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1038\/nature09796","article-title":"A decade\u2019s perspective on DNA sequencing technology","volume":"470","author":"Mardis Elaine R.","year":"2011","unstructured":"Elaine R. Mardis. 2011. A decade\u2019s perspective on DNA sequencing technology. Nature 470, 7333 (2011), 198.","journal-title":"Nature"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbz013"},{"key":"e_1_3_3_66_2","doi-asserted-by":"crossref","unstructured":"Eduardo Morais Tommy Koens Cees Wijk and Aleksei Koren. 2019. A Survey on Zero Knowledge Range Proofs and Applications.","DOI":"10.1007\/s42452-019-0989-z"},{"key":"e_1_3_3_67_2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/288090.288106","volume-title":"Proceedings of the 5th ACM Conference on Computer and Communications Security (CCS\u201998)","author":"Naccache David","year":"1998","unstructured":"David Naccache and Jacques Stern. 1998. A new public key cryptosystem based on higher residues. In Proceedings of the 5th ACM Conference on Computer and Communications Security (CCS\u201998). Association for Computing Machinery, New York, NY, 59\u201366. 10.1145\/288090.288106"},{"issue":"1","key":"e_1_3_3_68_2","first-page":"6","article-title":"Privacy in the genomic era","volume":"48","author":"Naveed Muhammad","year":"2015","unstructured":"Muhammad Naveed, Erman Ayday, Ellen W. Clayton, Jacques Fellay, Carl A. Gunter, Jean-Pierre Hubaux, Bradley A. Malin, and XiaoFeng Wang. 2015. Privacy in the genomic era. ACM Computing Surveys (CSUR) 48, 1 (2015), 6.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"e_1_3_3_69_2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology (EUROCRYPT\u201998)","author":"Okamoto Tatsuaki","year":"1998","unstructured":"Tatsuaki Okamoto and Shigenori Uchiyama. 1998. A new public-key cryptosystem as secure as factoring. In Advances in Cryptology (EUROCRYPT\u201998), Kaisa Nyberg (Ed.). Springer, Berlin,308\u2013318."},{"key":"e_1_3_3_70_2","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_3_3_71_2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/1066157.1066204","volume-title":"Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data","author":"Pang HweeHwa","year":"2005","unstructured":"HweeHwa Pang, Arpit Jain, Krithi Ramamritham, and Kian-Lee Tan. 2005. Verifying completeness of relational query results in data publishing. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. ACM, 407\u2013418."},{"key":"e_1_3_3_72_2","first-page":"129","volume-title":"Annual International Cryptology Conference","author":"Pedersen Torben Pryds","year":"1991","unstructured":"Torben Pryds Pedersen. 1991. Non-interactive and information-theoretic secure verifiable secret sharing. In Annual International Cryptology Conference. Springer, 129\u2013140."},{"key":"e_1_3_3_73_2","first-page":"1","volume-title":"2012 IEEE 8th International Conference on E-Science (e-Science\u201912)","author":"Perl H.","year":"2012","unstructured":"H. Perl, Y. Mohammed, M. Brenner, and M. Smith. 2012. Fast confidential search for bio-medical data using Bloom filters and Homomorphic Cryptography. In 2012 IEEE 8th International Conference on E-Science (e-Science\u201912). IEEE Computer Society, Los Alamitos, CA, 1\u20138. 10.1109\/eScience.2012.6404484"},{"key":"e_1_3_3_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"issue":"6010","key":"e_1_3_3_75_2","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1126\/science.1195271","article-title":"The major genetic determinants of HIV-1 control affect HLA class I peptide presentation","volume":"330","year":"2010","unstructured":"International HIV Controllers Study and others. 2010. The major genetic determinants of HIV-1 control affect HLA class I peptide presentation. Science (New York, NY) 330, 6010 (2010), 1551.","journal-title":"Science (New York, NY)"},{"key":"e_1_3_3_76_2","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/1315245.1315309","volume-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security","author":"Troncoso-Pastoriza Juan Ram\u00f3n","year":"2007","unstructured":"Juan Ram\u00f3n Troncoso-Pastoriza, Stefan Katzenbeisser, and Mehmet Celik. 2007. Privacy preserving error resilient DNA searching through oblivious automata. In Proceedings of the 14th ACM Conference on Computer and Communications Security. ACM, 519\u2013528."},{"issue":"7","key":"e_1_3_3_77_2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1038\/s41576-022-00455-y","article-title":"Sociotechnical safeguards for genomic data privacy","volume":"23","author":"Wan Zhiyu","year":"2022","unstructured":"Zhiyu Wan, James W. Hazel, Ellen Wright Clayton, Yevgeniy Vorobeychik, Murat Kantarcioglu, and Bradley A. Malin. 2022. Sociotechnical safeguards for genomic data privacy. Nature Reviews Genetics 23, 7 (July2022), 429\u2013445.","journal-title":"Nature Reviews Genetics"},{"key":"e_1_3_3_78_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv563"},{"key":"e_1_3_3_79_2","first-page":"492","volume-title":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS\u201915)","author":"Wang Xiao Shaun","year":"2015","unstructured":"Xiao Shaun Wang, Yan Huang, Yongan Zhao, Haixu Tang, XiaoFeng Wang, and Diyue Bu. 2015. 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 (CCS\u201915). Association for Computing Machinery, New York, NY, 492\u2013503. 10.1145\/2810103.2813725"},{"key":"e_1_3_3_80_2","first-page":"162","volume-title":"27th Annual Symposium on Foundations of Computer Science (SFCS\u201986)","author":"Yao Andrew Chi-Chih","year":"1986","unstructured":"Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In 27th Annual Symposium on Foundations of Computer Science (SFCS\u201986). IEEE, 162\u2013167."},{"issue":"2","key":"e_1_3_3_81_2","doi-asserted-by":"crossref","first-page":"292","DOI":"10.21136\/CMJ.1983.101878","article-title":"Differentiability of the distance function and points of multi-valuedness of the metric projection in Banach space","volume":"33","author":"Zaj\u00ed\u010dek Lud\u011bk","year":"1983","unstructured":"Lud\u011bk Zaj\u00ed\u010dek. 1983. Differentiability of the distance function and points of multi-valuedness of the metric projection in Banach space. Czechoslovak Mathematical Journal 33, 2 (1983), 292\u2013308. http:\/\/eudml.org\/doc\/13383.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"e_1_3_3_82_2","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-15-S5-S4"},{"key":"e_1_3_3_83_2","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-15-S5-S5"}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3575796","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3575796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:21Z","timestamp":1750182681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3575796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,13]]},"references-count":82,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,8,30]]}},"alternative-id":["10.1145\/3575796"],"URL":"https:\/\/doi.org\/10.1145\/3575796","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,13]]},"assertion":[{"value":"2021-10-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-28","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}