Skip to main content
SpringerLink
Log in
Book cover

International Conference on Frontiers in Cyber Security

FCS 2020: Frontiers in Cyber Security pp 373–387Cite as

Efficient Boolean SSE: A Novel Encrypted Database (EDB)

  • Conference paper
  • First Online:

  • 1137 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1286))

Abstract

Searchable symmetric encryption (SSE) with increasing expressiveness was proposed to acquire optimal communication complexity, but it has poor efficiency compared to the single-word query. Many of the existing expressive SSE mechanisms use the inverted index to build the encrypted database (EDB) for the sub-linear search complexity. However, this inevitably brings about the problems of repeated storage and low efficiency of set operations. To this end, we introduced a new approach, using the boolean vectors (BV) instead of the inverted indexes to build EDB, which dramatically improves the search efficiency and reduces the storage space. While boolean operation must run on the closed space, we divided the full queried space into several disjoint closed sub-spaces and proved its correctness theoretically. Our construction supports arbitrary conjunctive, disjunctive, and boolean queries. The experiments prove that our system is more efficient in storage and search complexity than existing methods.

Supported by the National Natural Science Foundation of China under grant No. 61572513.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ballard, L., Kamara, S., Monrose, F.: Achieving efficient conjunctive keyword searches over encrypted data. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 414–426. Springer, Heidelberg (2005). https://doi.org/10.1007/11602897_35

    Chapter  Google Scholar 

  2. Byun, J.W., Lee, D.H., Lim, J.: Efficient conjunctive keyword search on encrypted data storage system. In: Atzeni, A.S., Lioy, A. (eds.) EuroPKI 2006. LNCS, vol. 4043, pp. 184–196. Springer, Heidelberg (2006). https://doi.org/10.1007/11774716_15

    Chapter  Google Scholar 

  3. Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: 21st Annual Network and Distributed System Security Symposium, NDSS 2014, San Diego, California, USA, 23–26 February 2014. The Internet Society (2014). https://www.ndss-symposium.org/ndss2014/dynamic-searchable-encryption-very-large-databases-data-structures-and-implementation

  4. Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353–373. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40041-4_20

    Chapter  Google Scholar 

  5. Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_30

    Chapter  Google Scholar 

  6. Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577–594. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17373-8_33

    Chapter  Google Scholar 

  7. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (Abstract). In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 462–462. Springer, Heidelberg (1988). https://doi.org/10.1007/3-540-48184-2_43

    Chapter  Google Scholar 

  8. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Juels, A., Wright, R.N., di Vimercati, S.D.C. (eds.) Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, 30 October–3 November 2006, pp. 79–88. ACM (2006). https://doi.org/10.1145/1180405.1180417

  9. Du, L., Li, K., Liu, Q., Wu, Z., Zhang, S.: Dynamic multi-client searchable symmetric encryption with support for boolean queries. Inf. Sci. 506, 234–257 (2020). https://doi.org/10.1016/j.ins.2019.08.014

    Article  Google Scholar 

  10. Ferreira, B., Portela, B., Oliveira, T., Borges, G., Domingos, H., Leitão, J.: BISEN: efficient boolean searchable symmetric encryption with verifiability and minimal leakage. In: 38th Symposium on Reliable Distributed Systems, SRDS 2019, Lyon, France, 1–4 October 2019, pp. 103–112. IEEE (2019). https://doi.org/10.1109/SRDS47363.2019.00021

  11. Fisch, B.A., et al.: Malicious-client security in blind seer: a scalable private DBMS. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, 17–21 May 2015, pp. 395–410. IEEE Computer Society (2015). https://doi.org/10.1109/SP.2015.31

  12. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May–2 June 200, pp. 169–178. ACM (2009). https://doi.org/10.1145/1536414.1536440

  13. Goh, E.: Secure indexes. IACR Cryptol. ePrint Arch. 2003, 216 (2003). http://eprint.iacr.org/2003/216

  14. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, USA, pp. 218–229. ACM (1987). https://doi.org/10.1145/28395.28420

  15. Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 31–45. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24852-1_3

    Chapter  Google Scholar 

  16. Kamara, S., Moataz, T.: Boolean searchable symmetric encryption with worst-case sub-linear complexity. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 94–124. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-56617-7_4

    Chapter  Google Scholar 

  17. Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258–274. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39884-1_22

    Chapter  Google Scholar 

  18. Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) the ACM Conference on Computer and Communications Security, CCS 2012, Raleigh, NC, USA, 16–18 October 2012, pp. 965–976. ACM (2012). https://doi.org/10.1145/2382196.2382298

  19. Pappas, V., et al.: Blind seer: a scalable private DBMS. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, 18–21 May 2014, pp. 359–374. IEEE Computer Society (2014). https://doi.org/10.1109/SP.2014.30

  20. Sun, L., Xu, C., Zhang, Y.: A dynamic and non-interactive boolean searchable symmetric encryption in multi-client setting. J. Inf. Secur. Appl. 40, 145–155 (2018). https://doi.org/10.1016/j.jisa.2018.03.002, https://doi.org/10.1016/j.jisa.2018.03.002

  21. Wang, Y., et al.: Towards multi-user searchable encryption supporting boolean query and fast decryption. J. UCS 25(3), 222–244 (2019). http://www.jucs.org/jucs_25_3/towards_multi_user_searchable

  22. Xiaodong, D., Song, D., Perrig, W.A.: Practical techniques for searches on encrypted data (2002)

    Google Scholar 

  23. Yao, A.C.: Protocols for secure computations. In: Proceedings of IEEE Symposium on Foundations of Computer Science (1982)

    Google Scholar 

  24. Zeng, M., Zhang, K., Qian, H., Chen, X., Chen, J.: A searchable asymmetric encryption scheme with support for boolean queries for cloud applications. Comput. J. 62(4), 563–578 (2019). https://doi.org/10.1093/comjnl/bxy134

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer, National University of Defense Technology, Changsha, China

    Xueling Zhu, Huaping Hu, Shaojing Fu, Qing Wu & Bo Liu

Authors
  1. Xueling Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huaping Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shaojing Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qing Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bo Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Liu .

Editor information

Editors and Affiliations

  1. Tianjin University, Tianjin, China

    Guangquan Xu

  2. Delft University of Technology, Delft, The Netherlands

    Kaitai Liang

  3. University of Aizu, Aizuwakamatsu, Japan

    Chunhua Su

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhu, X., Hu, H., Fu, S., Wu, Q., Liu, B. (2020). Efficient Boolean SSE: A Novel Encrypted Database (EDB). In: Xu, G., Liang, K., Su, C. (eds) Frontiers in Cyber Security. FCS 2020. Communications in Computer and Information Science, vol 1286. Springer, Singapore. https://doi.org/10.1007/978-981-15-9739-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-9739-8_29

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-9738-1

  • Online ISBN: 978-981-15-9739-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation