[1] 23andMe. Find out what your DNA says about you and your family[EB/OL].[2019-01-09]. https://www.23andme.com/en-int/. [2] BALD P, BARONIO R, DE CRISTOFARO E, et al. Efficient and secure testing of fully-sequenced human genomes[J]. Biological Sciences Initiative, 2000, 470:7-10. [3] DE CRISTOFARO E, FABER S, GASTI P, et al. Genodroid:are privacy-preserving genomic tests ready for prime time?[C]//Proceedings of the 2012 ACM Workshop on Privacy in the Electronic Society. New York:ACM, 2012:97-108. [4] KIM M, LAUTER K. Private genome analysis through homomorphic encryption[J]. BMC Medical Informatics and Decision Making, 2015, 15(S5):No.S3. [5] YAO A C. Protocols for secure computations[C]//Proceeding of the 23rd Annual Symposium on Foundations of Computer Science. Piscataway:IEEE, 1982:160-164. [6] GOLDREICH O, MICALI S, WIGDERSON A. How to play ANY mental game[C]//Proceedings of the 9th Annual ACM Symposium on Theory of Computing. New York:ACM, 1987:218-229. [7] HUANG Y, EVANS D, KATZ J. Private set intersection:are garbled circuits better than custom protocols?[C]//Proceedings of the 19th Annual Network and Distributed System Security Symposium. Reston, VA:The Internet Society, 2012:1-15. [8] JHA S, KRUGER L, SHMATIKOV V. Towards practical privacy for genomic computation[C]//Proceedings of the 2008 IEEE Symposium on Security and Privacy. Piscataway:IEEE, 2008:216-230. [9] HUANG Y, EVANS D, KATZ J, et al. Faster secure two-party computation using garbled circuits[C]//Proceedings of the 20the USENIX Conference on Security. Berkeley, CA:USENIX Association, 2011:35-35. [10] BLANTON M, ATALLAH M J, FRIKKEN K B, et al. Secure and efficient outsourcing of sequence comparisons[C]//Proceedings of the 2012 European Symposium on Research in Computer Security, LNCS 7459. Berlin:Springer, 2012:505-522. [11] CHOI S G, HWANG K W, KATZ J, et al. Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces[C]//Proceedings of the 2012 Cryptographers' Track at the RSA Conference, LNCS 7178. Berlin:Springer, 2012:416-432. [12] GOLDREICH O, OSTROVSKY R. Software protection and simulation on oblivious RAMs[J]. Journal of the ACM, 1996, 43(3):431-473. [13] SHI E, CHAN T H H, STEFANOV E, et al. Oblivious RAM with O((log N)3) worst-case cost[C]//Proceedings of the 2011 International Conference on the Theory and Application of Cryptology and Information Security, LNCS 7073. Berlin:Springer, 2011:197-214. [14] 孙晓妮,蒋瀚,徐秋亮. 基于二叉树存储的多用户ORAM方案[J]. 软件学报, 2016, 27(6):1475-1486. (SUN X N, JIANG H, XU Q L. Multi-user binary tree based ORAM scheme[J]. Journal of Software, 2016, 27(6):1475-1486.) [15] GORDON S, HUANG X, MIYAJI A, et al. Recursive matrix oblivious RAM:an ORAM construction for constrained storage devices[J]. IEEE Transactions on Information Forensics and Security, 2017, 12(12):3024-3038. [16] GORDON S D, KATZ J, WANG X. Simple and efficient two-server ORAM[C]//Proceedings of the 2018 International Conference on the Theory and Application of Cryptology and Information Security, LNCS 11274. Cham:Springer, 2018:141-157. [17] GORDON S D, KATZ J, KOLESNIKOV V, et al. Secure two-party computation in sublinear (amortized) time[C]//Proceedings of the 2012 ACM Conference on Computer and Communications Security. New York:ACM, 2012:513-524. [18] LU S, OSTROVSKY R. Distributed oblivious RAM for secure two-party computation[C]//Proceedings of the 10th Theory of Cryptography Conference. Berlin:Springer, 2013:377-396. [19] WANG X S, HUANG Y, CHAN T H H, et al. SCORAM:oblivious RAM for secure computation[C]//Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security. New York:ACM, 2014:191-202. [20] WANG X, CHAN H, SHI E. Circuit ORAM:on tightness of the Goldreich-Ostrovsky lower bound[C]//Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. New York:ACM, 2015:850-861. [21] NAOR M, PINKAS B. Efficient oblivious transfer protocols[C]//Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA:Society for Industrial and Applied Mathematics, 2001:448-457. [22] 赵作鹏,尹志民,王潜平,等. 一种改进的编辑距离算法及其在数据处理中的应用[J]. 计算机应用, 2009, 29(2):424-426. (ZHAO Z P, YIN Z M, WANG Q P, et al. An improved algorithm of Levenshtein distance and its application in data processing[J]. Journal of Computer Applications, 2009, 29(2):424-426.) [23] KOLESNIKOV V, SCHNEIDER T. Improved garbled circuit:Free XOR gates and applications[C]//Proceedings of the 2008 International Colloquium on Automata, Languages, and Programming, LNCS 5126. Berlin:Springer, 2008:486-498. [24] NCBI. National Center for Biotechnology Information[EB/OL].[2019-02-18]. https://www.ncbi.nlm.nih.gov/. [25] 王立昌,方勇. 基于安全多方计算的分布式基因序列相似性计算[J]. 计算机应用研究, 2016, 33(12):3681-3685, 3704. (WANG L C, FANG Y. Distributed genome similarity calculation based on secure multiparty computation[J]. Application Research of Computers, 2016, 33(12):3681-3685, 3704.) |