期刊文献+

基于椭圆曲线加密的多关键词可搜索加密方案 被引量:2

Multiple Keywords Searchable Encryption Scheme Based on Elliptic Curve
下载PDF
导出
摘要 针对用户在使用云端数据过程中遇到遍历速度过慢和数据安全性过低的问题,对关键词可搜索加密技术进行改进;将椭圆曲线加密(elliptic curve cryptography,ECC)机制与多关键词可搜索加密方案相结合,在可搜索加密过程中用椭圆曲线对关键词进行编码、加密以及解密处理,同时对关键词进行相关性分数计算,根据分数选择最符合查询要求的文档,使用倒排序索引结构,提高遍历速度;从数据集文件中提取关键词,在虚拟机上进行实验。结果表明,基于ECC的多关键词可搜索加密方案既能减少关键词陷门的生成时间,又能提高检索效率,保证检索文件的高效性以及安全性。 Aiming at the problems of slow traversal speed and low data security encountered by users in the process of using cloud data,the keyword searchable encryption technology was improved.The elliptic curve cryptography(ECC) mechanism was combined with the multiple keywords searchable encryption scheme,and the elliptic curve was used to encode,encrypt and decrypt the keywords in a searchable encryption process.The relevance score for the keywords was calculated,then the documents that best meet the query requirements were choose according to score,and the inverted sort index structure was used to improve the traversal speed.The keywords are extracted from the dataset file and experiments were carried out on the virtual machine.The experimental results show that the searchable encryption scheme based on elliptic curve encryption improves the keyword trapping time and retrieval efficiency,and it indicates that the scheme has the efficiency and security of retrieving files.
作者 崔冉冉 张永胜 魏玉 CUI Ranran;ZHANG Yongsheng;WEI Yu(School of Information Science and Engineering,Shandong Normal University,Jinan 250358,China;Shandong NormalUniversity Key Laboratory of Distributed Computer Software New Technology,Shandong Normal University,Jinan 250014,China)
出处 《济南大学学报(自然科学版)》 CAS 北大核心 2019年第4期353-360,共8页 Journal of University of Jinan(Science and Technology)
基金 国家自然科学基金项目(61602287) 山东省研究生教育创新计划项目(SDYC15042)
关键词 数据安全 隐私保护 多关键词 可搜索加密 椭圆曲线加密机制 data security privacy protection multiple keywords searchable encryption elliptic curve cryptography
  • 相关文献

参考文献2

二级参考文献18

  • 1张串绒,尹忠海,肖国镇.不使用Hash和Redundancy函数的认证加密方案[J].电子学报,2006,34(5):874-877. 被引量:6
  • 2Wang C,Cao N,Li J, et al. Secure ranked keyword search over en- crypted cloud data. ICDCS' 10, 2010:253-262.
  • 3Kuzu M, Islam M S, Kantarcioglu M. Efficient similarity search over encrypted data. Proceedings of the 2012 IEEE 28th International Con- ference on Data Engineering ,2012 , 1156-1167.
  • 4Orencik C Savas E. Efficient and secure ranked multi-keyword search on encrypted cloud data. Proceedings of the 2012 Joint EDBT/ICDT Workshops. ACM, 2012:186-195.
  • 5Cao N, Wang C, Li M, et al. Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE INFOCOM, 2011:456-465.
  • 6Ogata W, Kurosawa K. Oblivious keyword search. Journal of Com- plexity, 2004 ,20 ( 3 ) :356-371.
  • 7Raykova M, Vo B, Bellovin S M, et al. Secure anonymous database search. Proceedings of the 2009 ACM workshop on Cloud Computing Security, CCSW 2009 , ACM, 2009 : 115-126.
  • 8Chen Z, Wu C,Wang D,et al. Conjunctive keywords searchable en- cryption with efficient pairing, constant ciphertext and short trap- door. PAISI, 2012 : 176-189.
  • 9Rajaraman A, Ullman D, Jeffrey. Mining of massive datasets. Cam- bridge University Press, 2011.
  • 10Christopher H S, Manning, D, Raghavan P. Introduction to informa- tion retrieval. Cambridge University Press, 2008.

共引文献21

同被引文献17

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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