• Overview of Chinese core journals
  • Chinese Science Citation Database(CSCD)
  • Chinese Scientific and Technological Paper and Citation Database (CSTPCD)
  • China National Knowledge Infrastructure(CNKI)
  • Chinese Science Abstracts Database(CSAD)
  • JST China
  • SCOPUS
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

Efficient Searchable Symmetric Encryption for Conjunctive Queries

More Information
  • Received Date: December 22, 2019
  • Available Online: March 21, 2021
  • OXT, which uses the Diffie-Hellman-type-operation-based secure two-party computation, is the state-of-the-art searchable symmetric encryption (SSE) scheme supporting conjunctive queries. However, the Diffie-Hellman-type operation is computationally expensive and may lead to a performance bottleneck. In order to improve the computational performance, an efficient searchable symmetric encryption scheme EXT which supports conjunctive queries is proposed. EXT uses a framework different from OXT to support conjunctive queries, where the client computes relations between keywords and documents independently, and the server only checks all these relations. Hence, no Diffie-Hellman operations are required for EXT. Furthermore, EXT is analyzed in terms of correctness, security, and performance. Compared with OXT, EXT reduces the setup computational cost, the client's computational cost, the server's computational cost, and the storage size by 95.05%, 97.67%, 98.48% and 55.05%, respectively.
  • [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.

Catalog

    Article views (1320) PDF downloads (105) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return