Skip to main content
SpringerLink
Log in

Multi-user Verifiable Database with Efficient Keyword Search

  • Conference paper
  • First Online:
Cyberspace Safety and Security (CSS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13547))

Included in the following conference series:

  • 793 Accesses

Abstract

The notion of Verifiable database (VDB) allows data owners with limited resources to outsource large databases to powerful but untrusted cloud servers, ensuring the integrity of the database when performing index-based query operations. In recent years, researchers have extended the index-based query method to propose VDB scheme supporting keyword search. However, the existing VDB schemes supporting keyword search only allow the data owner to generate the search token based on the private key to perform search. In order to extend this single-user setting to the multi-user setting, we first propose a new multi-user VDB scheme which allows the data owner to authorize keyword search ability to other users. Specifically, different users have different search permissions, that is, they can only perform search operations under the keywords authorized by the data owner. In addition, we also give a new construction which supports conjunctive keyword search. Finally, efficiency analysis and security proof ensure the feasibility and security of our VDB scheme.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Atallah, M.J., Frikken, K.B.: Securely outsourcing linear algebra computations. In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2010), pp. 48–59. ACM (2010)

    Google Scholar 

  2. Atallah, M.J., Pantazopoulos, K.N., Rice, J.R., Spafford, E.H.: Secure outsourcing of scientific computations. Adv. Comput. 54, 215–272 (2001)

    Article  Google Scholar 

  3. Atallah, M.J., Li, J.: Secure outsourcing of sequence comparisons. Int. J. Inf. Secur. 4(4), 277–287 (2005). https://doi.org/10.1007/s10207-005-0070-3

    Article  Google Scholar 

  4. Chen, X., Li, J., Susilo, W.: Efficient fair conditional payments for outsourcing computations. IEEE Trans. Inf. Forensics Secur. 7(6), 1687–1694 (2012)

    Article  Google Scholar 

  5. Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 863–874. ACM (2013)

    Google Scholar 

  6. Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55–72. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36362-7_5

    Chapter  Google Scholar 

  7. Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distrib. Syst. 25(9), 2386–2396 (2014)

    Article  Google Scholar 

  8. Chen, X., Li, J., Huang, X., Ma, J., Lou, W.: New publicly verifiable databases with efficient updates. IEEE Trans. Dependable Secur. Comput. 12(5), 546–556 (2015)

    Article  Google Scholar 

  9. Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111–131. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22792-9_7

    Chapter  Google Scholar 

  10. Chen, X., Li, J., Weng, J., Ma, J., Lou, W.: Verifiable computation over large database with incremental updates. IEEE Trans. Comput. 65(10), 3184–3195 (2016)

    Article  MathSciNet  Google Scholar 

  11. Miao, M., Ma, J., Huang, X., Wang, Q.: Efficient verifiable databases with insertion/deletion operations from delegating polynomial functions. IEEE Trans. Inf. Forensics Secur. 13(2), 511–520 (2018)

    Article  Google Scholar 

  12. Miao, M., Wang, J., Ma, J., Susilo, W.: Publicly verifiable databases with efficient insertion/deletion operations. J. Comput. Syst. Sci. 86, 49–58 (2017)

    Article  MathSciNet  Google Scholar 

  13. Zhang, Z., Chen, X., Li, J., Tao, X., Ma, J.: HVDB: a hierarchical verifiable database scheme with scalable updates. J. Ambient. Intell. Humaniz. Comput. 10(8), 3045–3057 (2018). https://doi.org/10.1007/s12652-018-0757-8

    Article  Google Scholar 

  14. Miao, M., Wang, J., Wen, S., Ma, J.: Publicly verifiable database scheme with efficient keyword search. Inf. Sci. 475, 18–28 (2019)

    Article  Google Scholar 

  15. Sun, S.-F., Liu, J.K., Sakzad, A., Steinfeld, R., Yuen, T.H.: An efficient non-interactive multi-client searchable encryption with support for Boolean queries. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 154–172. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45744-4_8

    Chapter  Google Scholar 

  16. Wang, Q., Zhou, F., Zhou, B., Xu, J., Wang, Q.: Privacy-preserving publicly verifiable databases. IEEE Trans. Dependable Secure Comput. 19(3), 1639–1654 (2022)

    Article  Google Scholar 

  17. Miao, M., Wang, Y., Wang, J., Huang, X.: Verifiable database supporting keyword searches with forward security. Comput. Stand. Interfaces 77, 103491 (2021)

    Article  Google Scholar 

  18. Pitigalaarachchi, P., Gamage, C.: Efficiency enhancements for practical techniques for searches on encrypted data. In: ICCSP 2020, pp. 13–18. ACM (2020)

    Google Scholar 

  19. 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 

  20. 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 

  21. Wang, Y., Sun, S.-F., Wang, J., Liu, J.K., Chen, X.: Achieving searchable encryption scheme with search pattern hidden. IEEE Trans. Serv. Comput. 15(2), 1012–1025 (2022)

    Article  Google Scholar 

  22. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 2006 ACM SIGSAC Conference on Computer & Communications Security (CCS 2006), pp. 79–88. ACM (2006)

    Google Scholar 

  23. Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M.-C., Steiner, M.: Outsourced symmetric private information retrieval. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security (CCS 2013), pp. 875–888. ACM (2013)

    Google Scholar 

  24. Wang, Y., Wang, J., Sun, S.-F., Liu, J.K., Susilo, W., Chen, X.: Towards multi-user searchable encryption supporting Boolean query and fast decryption. In: Okamoto, T., Yu, Y., Au, M.H., Li, Y. (eds.) ProvSec 2017. LNCS, vol. 10592, pp. 24–38. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68637-0_2

    Chapter  Google Scholar 

  25. Wang, Y., et al.: Towards multi-user searchable encryption supporting Boolean query and fast decryption. J. Univers. Comput. Sci. 25(3), 222–244 (2019)

    MathSciNet  Google Scholar 

  26. Wang, J., Chen, X., Sun, S.-F., Liu, J.K., Au, M.H., Zhan, Z.-H.: Towards efficient verifiable conjunctive keyword search for large encrypted database. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 83–100. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98989-1_5

    Chapter  Google Scholar 

Download references

Acknowledgments

This work is supported by National Natural Science Foundation of China (Nos. 61902315 and 62102313).

Author information

Authors and Affiliations

  1. School of Cyberspace Security, Xi’an University of Posts and Telecommunications, Xi’an, 710121, China

    Meixia Miao, Panru Wu & Yunling Wang

Authors
  1. Meixia Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panru Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yunling Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meixia Miao .

Editor information

Editors and Affiliations

  1. Xidian University, Xi'an, China

    Xiaofeng Chen

  2. Nanjing University of Information Science, Nanjing, China

    Jian Shen

  3. University of Wollongong, Wollongong, NSW, Australia

    Willy Susilo

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Miao, M., Wu, P., Wang, Y. (2022). Multi-user Verifiable Database with Efficient Keyword Search. In: Chen, X., Shen, J., Susilo, W. (eds) Cyberspace Safety and Security. CSS 2022. Lecture Notes in Computer Science, vol 13547. Springer, Cham. https://doi.org/10.1007/978-3-031-18067-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-18067-5_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-18066-8

  • Online ISBN: 978-3-031-18067-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation