Towards Secure Computation of Similar Patient Query on Genomic Data Under Multiple Keys
暂无分享,去创建一个
[1] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[2] Stefan Katzenbeisser,et al. Efficiently Outsourcing Multiparty Computation Under Multiple Keys , 2013, IEEE Transactions on Information Forensics and Security.
[3] J. Frost,et al. Sharing Health Data for Better Outcomes on PatientsLikeMe , 2010, Journal of medical Internet research.
[4] Alexandr Andoni,et al. Approximating Edit Distance in Near-Linear Time , 2012, SIAM J. Comput..
[5] Timothy B. Stockwell,et al. The Sequence of the Human Genome , 2001, Science.
[6] Dima Alhadidi,et al. Secure approximation of edit distance on genomic data , 2017, BMC Medical Genomics.
[7] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[8] Emmanuel Bresson,et al. A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications , 2003, ASIACRYPT.
[9] Yehuda Lindell,et al. Privacy-Preserving Search of Similar Patients in Genomic Data , 2018, IACR Cryptol. ePrint Arch..
[10] Yan Huang,et al. Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance , 2015, CCS.
[11] B. Chain,et al. The sequence of sequencers: The history of sequencing DNA , 2016, Genomics.
[12] Dima Alhadidi,et al. Secure and Efficient Multiparty Computation on Genomic Data , 2016, IDEAS.