留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

支持联合查询的高效可搜索对称加密方案

古宜平 马昌社

古宜平, 马昌社. 支持联合查询的高效可搜索对称加密方案[J]. 华南师范大学学报(自然科学版), 2020, 52(3): 120-128. doi: 10.6054/j.jscnun.2020053
引用本文: 古宜平, 马昌社. 支持联合查询的高效可搜索对称加密方案[J]. 华南师范大学学报(自然科学版), 2020, 52(3): 120-128. doi: 10.6054/j.jscnun.2020053
GU Yiping, MA Changshe. Efficient Searchable Symmetric Encryption for Conjunctive Queries[J]. Journal of South China normal University (Natural Science Edition), 2020, 52(3): 120-128. doi: 10.6054/j.jscnun.2020053
Citation: GU Yiping, MA Changshe. Efficient Searchable Symmetric Encryption for Conjunctive Queries[J]. Journal of South China normal University (Natural Science Edition), 2020, 52(3): 120-128. doi: 10.6054/j.jscnun.2020053

支持联合查询的高效可搜索对称加密方案

doi: 10.6054/j.jscnun.2020053
基金项目: 

国家自然科学基金项目 61672243

详细信息
    通讯作者:

    马昌社,教授,Email:chsma@163.com

  • 中图分类号: TP309

Efficient Searchable Symmetric Encryption for Conjunctive Queries

  • 摘要: 采用基于Diffie-Hellman类型操作的安全两方计算实现的OXT方案是目前支持联合查询的最优可搜索对称加密方案,但Diffie-Hellman类型操作计算开销大,将成为该方案的计算性能瓶颈.为了提高计算性能,提出一个支持联合查询的高效可搜索对称加密方案(EXT方案).该方案采用客户端单独计算关键字与文档之间的关系,并交给服务器检验该关系的方法来实现联合查询,从而避免了Diffie-Hellman类型操作.并从正确性、安全性以及性能方面对EXT方案进行分析.分析结果表明:与OXT方案相比较,EXT方案将系统初始化的计算量、查询时客户端的计算量、查询时服务器的计算量、存储开销分别降低了95.05%、97.67%、98.48%、55.05%.
  • 图  1  EXT查询协议

    Figure  1.  The search protocol of EXT

    表  1  OXT方案与EXT方案的性能比较

    Table  1.   Evaluations of the overheads between OXT and EXT  %

    资源开销项 初始化 查询(客户端) 查询(服务器) 交互带宽 存储大小
    OEXT/OXT 4.95 2.33 1.52 100 44.95
    下载: 导出CSV
  • [1] SONG D X, WAGNER D, PERRIG A. Practical techniques for searches on encrypted data[C]// Proceedings of the 2000 IEEE Symposium on Security and Privacy. Los Alamitos: IEEE, 2000: 44-55.
    [2] STEFANOV E, PAPAMANTHOU C, SHI E. Practical dynamic searchable encryption with small leakage[C]//Proceedings of the 21th Annual Network and Distributed System Security Symposium. Reston: The Internet Society, 2014: 72-75.
    [3] WANG Q, HE M, DU M, et al. Searchable encryption over feature-rich data[J]. IEEE Transactions on Dependable and Secure Computing, 2016, 15(3):496-510. http://cn.bing.com/academic/profile?id=f9744245bfe0ab3f51e63272d1e48856&encoded=0&v=paper_preview&mkt=zh-cn
    [4] CHAMANI J G, PAPADOPOULOS D, PAPAMANTHOU C, et al. New constructions for forward and backward private symmetric searchable encryption[C]//Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2018: 1038-1055.
    [5] GOLLE P, STADDON J, WATERS B. Secure conjunctive keyword search over encrypted data[C]//JAKOBSSON M, YUNG M, ZHOU J. Proceedings of the Second International Conference on Applied Cryptography and Network Security. Berlin: Springer, 2004: 31-45.
    [6] BALLARD L, KAMARA S, MONROSE F. Achieving efficient conjunctive keyword searches over encrypted data[C]//QING S, MAO W, LÓPEZ J. Proceedings of the 7th International Conference on Information and Communications Security. Berlin: Springer, 2005: 414-426.
    [7] BYUN J W, LEE D H, LIM J. Efficient conjunctive keyword search on encrypted data storage system[C]//FRANKLIN A S, LIOY A. Proceedings of the Third European Conference on Public Key Infrastructure: Theory and Practice. Berlin: Springer, 2006: 184-196.
    [8] RYU E K, TAKAGI T. Efficient conjunctive keyword-searchable encryption[C]//Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops. Washington: IEEE, 2007: 409-414.
    [9] WANG P, WANG H, PIEPRZYK J. Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups[C]//FRANKLIN M K, HUI L C, WONG D C. Proceedings of the 7th International Conference on Cryptology and Network Security. Berlin: Springer, 2008: 178-195.
    [10] CASH D, JARECKI S, JUTLAC, et al. Highly-scalable searchable symmetric encryption with support for boolean queries[C]//CANETTI R, GARAY J A. Proceedings of the 33rd Annual International Cryptology Conference. Berlin: Springer, 2013: 353-373.
    [11] MAROUF I, ASAD M M, AL-HAIJA Q A. Comparative study of efficient modular exponentiation algorithms[J]. Compusoft, 2017, 6(8):2381-2389. http://www.researchgate.net/publication/320084242_Comparative_Study_of_Efficient_Modular_Exponentiation_Algorithms
    [12] CURTMOLA R, GARAY J, KAMARA S, et al. Searchable symmetric encryption: improved definitions and efficient constructions[C]//Proceedings of the 13th ACM Confe-rence on Computer and Communications Security. New York: ACM, 2006: 79-88.
    [13] CHASE M, KAMARA S. Structured encryption and controlled disclosure[C]//Advances in Cryptology-ASIACRYPT 2010. Berlin: Springer, 2010: 577-594.
    [14] CASH D, JAEGER J, JARECKI S, et al. Dynamic searchable encryption in very-large databases: data structures and implementation[C]//Proceedings of the 21th Annual Network and Distributed System Security Symposium. Reston: The Internet Society, 2014: 1-16.
    [15] BELLARE M, CANETTI R, KRAWCZYK H. Pseudorandom functions revisited: the cascade construction and its concrete security[C]//Proceedings of 37th Conference on Foundations of Computer Science. Los Alamitos: IEEE, 1996: 514-523.
    [16] BELLARE M, DESAI A, JOKIPII E, et al. A concrete security treatment of symmetric encryption[C]//Procee-dings 38th Annual Symposium on Foundations of Compu-ter Science. Los Alamitos: IEEE, 1997: 394-403.
    [17] LAI S, PATRANABIS S, SAKZAD A, et al. Result pattern hiding searchable encryption for conjunctive queries[C]//Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2018: 745-762.
    [18] LI J, HUANG Y, WEI Y, et al. Searchable symmetric encryption with forward search privacy[J/OL]. IEEE Tran-sactions on Dependable and Secure Computing, (2019-01-22)[2020-05-02]. https://ieeexplore.ieee.org/abstract/document/8621026.
  • 加载中
图(1) / 表(1)
计量
  • 文章访问数:  955
  • HTML全文浏览量:  563
  • PDF下载量:  41
  • 被引次数: 0
出版历程
  • 收稿日期:  2019-12-23
  • 刊出日期:  2020-06-25

目录

    /

    返回文章
    返回