期刊文献+

实用安全两方计算及其在基因组序列比对中的应用 被引量:2

Advances in Practical Secure Two-party Computation and Its Application in Genomic Sequence Comparison
在线阅读 下载PDF
导出
摘要 安全两方计算(secure two-party computation)是密码学领域中的一个重要研究方向.作为安全多方计算中的一个特殊情形,安全两方计算中参与计算的实体仅为两方.相比于三方及更多参与方的情况,安全两方计算不仅在理论研究方面更具挑战性,在应用研究方面也具有更加广泛的应用场景.近年来,安全两方计算在实用性方面的研究取得了飞速发展,不仅在通用协议构造的效率上取得了重要突破,而且在涉及数据隐私计算的各个应用领域得到了广泛关注,比如基因组数据的隐私保护等.本文介绍了安全两方计算的基本概念、基本工具等基础知识,简要概述了安全两方计算近年来在实用性方面取得的重要研究成果,并重点介绍了安全两方计算在基因组序列比对中的应用及其研究进展.为了更加清晰地介绍相关研究进展,本文从安全两方计算的两个主要构造方法 (即同态加密和混乱电路)出发,分别给出了基于这两种不同底层工具的研究脉络.此外,本文指出了现阶段基于安全两方计算的基因组序列比对研究中存在的几点不足,并分析了未来可能的研究方向. Secure two-party computation is an important research direction in cryptography.As a special case of secure multi-party computation,secure two-party computation involves only two participants.Compared with the cases of three or more parties,secure two-party computation is more challenging in theory and has a wider range of applications.In recent years,research on practical secure two-party computation has achieved rapid development.Development has made important breakthroughs in the efficiency of generic protocol construction,and has received extensive attention in various applications involving data privacy computation,such as privacy-preserving genomic data analysis.This paper introduces basic concepts and tools of secure two-party computation,and gives a brief overview of some important research results of secure two-party computation in recent years.In addition,the application of secure two-party computation in genomic sequence comparison and its research progress is summarized.For a clear introduction on related work,we start with introducing two major construction techniques(i.e.,homomorphic encryption and garbled circuit),and give a clear development direction.In addition,the existing deficiencies in this research area and some possible research directions are pointed out.
作者 赵川 赵圣楠 贾忠田 张波 张斌 ZHAO Chuan;ZHAO Sheng-Nan;JIA Zhong-Tian;ZHANG Bo;ZHANG Bin(School of Information Science and Engineering,University of Jinan,Jinan 250022,China;Shandong Provincial Key Laboratory of Network Based Intelligent Computing,University of Jinan,Jinan 250022,China;School of Software,Shandong University,Jinan 250101,China;School of Information Engineering,Shandong Youth University of Political Science,Jinan 250103,China)
出处 《密码学报》 CSCD 2019年第2期194-204,共11页 Journal of Cryptologic Research
基金 国家自然科学基金(61702218) 山东省高等学校科技计划(J18KA349 J15LN16) 山东省高等学校优秀中青年骨干教师国际合作培养项目 济南大学科技计划(XKY1709) 济南大学博士基金~~
关键词 安全多方计算 基因组序列比对 实用安全多方计算 同态加密 混乱电路 secure multi-party computation genomic sequence comparison practical secure two-party computation homomorphic encryption garbled circuit
作者简介 通信作者:张波(1981–),山东德州人,讲师.主要研究领域为公钥密码学、无证书签名和隐私保护数据处理.ise_zhangb@ujn.edu.cn;赵川(1989–),山东泰安人,讲师.主要研究领域为实用安全多方计算、隐私保护.ise_zhaoc@ujn.edu.cn;赵圣楠(1994–),山东泰安人,博士生在读.主要研究领域为安全多方计算、区块链技术.zsn.sdu@gmail.com;贾忠田(1972–),山东聊城人,副教授.主要研究领域为密码学、隐私保护和身份认证.ise_jiazt@ujn.edu.cn;张斌(1975–),山东济南人,讲师.主要研究领域为安全多方计算和隐私保护数据处理.140011@sdyu.edu.cn
  • 相关文献

参考文献6

二级参考文献94

  • 1Sun Microsystems, Inc. Building customer trust in cloud computing with transparent security. 2009. https://www.sun. com/offers/det ails/sun_transparency.xml.
  • 2Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. Maryland, 2009. 169-178.
  • 3Gentry C. Toward basing fully homomorphic encryption on worst-case hardness. In: Proceedings of the 30th Annual Cryptology Conference. Santa Barbara, 2010. 116-137.
  • 4van Dijk M, Gentry C, Halevi S, et al. Fully homomorphic encryption over integers, In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 24-43.
  • 5Smart N P, Vercauteren F. Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Pro- ceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography. Paris, 2010. 420-443.
  • 6Stehle D, Steinfeld R. Faster fully homomorphic encryption. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. Singapore, 2010. 377-394.
  • 7Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 1-23.
  • 8Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). Palm Springs, 2011. 97-106.
  • 9Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Proceedings of the 31st Annual Cryptology Conference. Santa Barbara, 2011. 501-521.
  • 10Benjamin D, Atallah M J. Private and cheating-free outsourcing of algebraic computations. In: Proceedings of the 6th Conference on Privacy, Security, and Trust (PST). New Brunswick, 2008. 240 -245.

共引文献74

同被引文献5

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部