《计算机应用研究》|Application Research of Computers

一种新型隐私数据库秘密同态检索协议

New homomorphic retrieval protocol for privacy database

免费全文下载 (已被下载 次)  
获取PDF全文
作者 白健
机构 保密通信重点实验室,成都 610041
统计 摘要被查看 次,已被下载
文章编号 1001-3695(2018)03-0892-03
DOI 10.3969/j.issn.1001-3695.2018.03.053
摘要 针对隐私数据查询中的隐私泄露威胁模型,提出了一种新型隐私数据库秘密同态检索协议。该协议基于SomeWhat部分同态算法进行设计,通过使用密文同态运算性质较好地解决了该威胁模型中涉及到的隐私泄露问题,同时在证明该协议正确性和安全性的基础上,通过适当的参数选择,对该协议的同态算法进行了测试,给出了算法的运行效率。
关键词 隐私泄露;隐私数据库;SomeWhat部分同态算法;秘密检索
基金项目 国家重点研发计划资助项目(2016YFC0801004)
本文URL http://www.arocmag.com/article/01-2018-03-053.html
英文标题 New homomorphic retrieval protocol for privacy database
作者英文名 Bai Jian
机构英文名 Science&TechnologyonCommunicationSecurityLaboratory,Chengdu610041,China
英文摘要 This paper proposed a new homomorphic retrieval protocol for privacy database based on the leakage of the privacy information treat model. It was designed with the SomeWhat homomorphic scheme to solve the leakage of the privacy information in the database which was in the specific treat model. It analyzed the correctness and the security of this protocol, and also tested the efficiency with appropriate parameters.
英文关键词 leakage of the privacy information; privacy database; SomeWhat homomorphic scheme; privacy retrieval
参考文献 查看稿件参考文献
  [1] Rivest R, Adleman L, Dertouzos M. On data banks and privacy homomorphisms[C] //Foundations of Secure Computation. 1978:169-180.
[2] Gentry C. A fully homomorphic encryption scheme[D] . Stanford:Stanford University, 2009.
[3] Brakerski Z, Gentry C, Vaikuntanathan V. Fully homomorphic encryption without bootstrapping[C] //Innovations in Theoretical Computer Science. 2012.
[4] Gentry C, Halevi S, Smar N P T. Homomorphic evaluation of the AES circuit[C] //Proc of CRYPTO. 2012:850-867.
[5] Gentry C, Halevi S, Smar N P T. Homomorphic evaluation of the AES circuit(updated implementation)[EB/OL] . (2015-01). http://eprint. iacr. org.
[6] Boneh D, Gentry C, Halevi S, et al. Database queries using SomeWhat homomorphic[C] //Proc of International Conference on Applied Cryptography and Network Security. Berlin:Springer, 2013:102-118.
[7] Osadchy M, Pinkas B, Jarrous A, et al. A system for secure face identification[C] //Proc of IEEE Symposium on Security and Privacy. 2010:239-254.
[8] Masaya Y, Takeshi S, Jun K. Packed homomorphic encryption based on ideal lattices and its application to biometrics[C] //Proc of MoCrySEn. 2013.
[9] Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings[J] . Journal of ACM, 2013, 60(6):No. 43.
[10] Lauter K, Naehrig M, Vaikuntanathan V. Can homomorphic encryption be practical?[EB/OL] . (2011). http://eprint. iacr. org/2011/405.
[11] Halevi S, Shoup V. Algorithms in HElib[C] //Proc of CRYPTO. 2014:554-571.
[12] Gentry C, Halvi S. Implementing gentry’s fully-homomorphic encryption scheme[C] //Proc of EUROCRYPT. 2011:129-148.
收稿日期 2016/11/14
修回日期 2017/1/17
页码 892-894
中图分类号 TP309
文献标志码 A