譌･譎ゑｼ壹蟷ｳ謌�27蟷ｴ9譛�9譌･ 10譎�00蛻�-12譎�00蛻�蝣ｴ謇�壹諠��ｱ遘大ｭｦ遐皮ｩｶ遘� 5髫� 繧ｳ繝ｩ繝懊Ξ繝ｼ繧ｷ繝ｧ繝ｳ繝ｫ繝ｼ繝�6隰帶ｼ碑�ｰ丞錐�� Alex Kaitai Liang
繧｢繝ｼ繝ｫ繝亥､ｧ蟄ｦ�医ヵ繧｣繝ｳ繝ｩ繝ｳ繝会ｼ会ｼ檎ｧ大ｭｦ謚陦鍋�皮ｩｶ遘�
隰帶ｼ秘｡檎岼�� Privacy-preserving genomic relatedness test: a new cryptographic solution
Recent DNA sequencing technologies allow us to obtain large-scale genomic data efficiently. Especially, personal genome analysis is gathering a lot of attention due to its great potential benefit in the development of biology and medical science. Despite the high expectations, it is an emerging problem to develop efficient secure methods to handle personal genome data without compromising privacy. In this talk, we introduce a new cryptographic solution to protect personal genomic privacy while the genomic data is taken into relatedness test. Being different from traditional two/multi-party computation and fully homomorphic approaches, our solution is explored into another efficient way to guarantee personal privacy.
