Privacy-Preserving Search of Similar Patients in Genomic Data
暂无分享,去创建一个
Yehuda Lindell | Shai Halevi | Tal Rabin | Gilad Asharov | S. Halevi | Yehuda Lindell | T. Rabin | Gilad Asharov
[1] Emiliano De Cristofaro,et al. Countering GATTACA: efficient and secure testing of fully-sequenced human genomes , 2011, CCS '11.
[2] Silvio Micali,et al. How to play any mental game, or a completeness theorem for protocols with honest majority , 2019, Providing Sound Foundations for Cryptography.
[3] Yan Huang,et al. Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance , 2015, CCS.
[4] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[5] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[6] Christus,et al. A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .
[7] Piotr Indyk,et al. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.
[8] Jure Leskovec,et al. Mining of Massive Datasets, 2nd Ed , 2014 .
[9] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[10] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[11] Alexandr Andoni,et al. Approximating edit distance in near-linear time , 2009, STOC '09.
[12] David Evans,et al. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates , 2015, EUROCRYPT.
[13] Dima Alhadidi,et al. Secure approximation of edit distance on genomic data , 2017, BMC Medical Genomics.
[14] Yehuda Lindell,et al. More efficient oblivious transfer and extensions for faster secure computation , 2013, CCS.
[15] Din J. Wasem. Mining of Massive Datasets , 2014 .
[16] Marcel Keller,et al. Actively Secure OT Extension with Optimal Overhead , 2015, CRYPTO.
[17] Yan Huang,et al. Efficient Privacy-Preserving Edit Distance and Beyond , 2017, IACR Cryptol. ePrint Arch..
[18] Yan Huang,et al. Efficient Privacy-Preserving General Edit Distance and Beyond , 2017 .
[19] Abhi Shelat,et al. Efficient Secure Computation with Garbled Circuits , 2011, ICISS.
[20] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[21] Yehuda Lindell,et al. SCAPI: The Secure Computation Application Programming Interface , 2012, IACR Cryptol. ePrint Arch..
[22] Joan Feigenbaum,et al. Secure multiparty computation of approximations , 2001, TALG.
[23] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[24] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[25] Carl A. Gunter,et al. Privacy in the Genomic Era , 2014, ACM Comput. Surv..
[26] Mete Akgün,et al. Privacy preserving processing of genomic data: A survey , 2015, J. Biomed. Informatics.
[27] Vitaly Shmatikov,et al. Towards Practical Privacy for Genomic Computation , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[28] S. Rajsbaum. Foundations of Cryptography , 2014 .