TENSOR EU Project

Part of EU Open Research Repository
Published August 21, 2023 | Version v1
Journal article Open

Keyword Search Shareable Encryption for Fast and Secure Data Replication

Authors/Creators

  • 1. School of Computer Science and Technology, Huazhong University of Science and Technology
  • 2. School of Cyber Science and Engineering, Huazhong University of Science and Technology
  • 3. Department of Intelligent Systems, Delft University of Technology

Description

It has become a trend for clients to outsource their encrypted databases to remote servers and then leverage the Searchable Encryption technique to perform secure data retrieval. However, the method has yet to be considered a crucial need for replication on searchable encrypted data. It calls for challenging works on Dynamic Searchable Symmetric Encryption (DSSE) since clients must share the search capability of the encrypted data replicas and guarantee forward and backward privacy. We define a new notion called “Keyword Search Shareable Encryption” (KS2E2E) and the corresponding security model capturing forward and backward privacy. In our notion, data owners are allowed to share search indexes of the encrypted data with users. A search index will be updated with a new search key before sharing to guarantee the data privacy of the source database. The target database also inherits data search efficiency along with the shared data. We further construct an instance of KS2E called Branch, prove its security, and use real-world datasets to evaluate Branch. The evaluation results show that Branch’s performance is comparable to classical DSSE schemes on search efficiency and demonstrate the effectiveness of searching encrypted data replicas from multiple owners.

Files

Keyword_Search_Shareable_Encryption_for_Fast_and_Secure_Data_Replication_2.pdf

Files (9.3 MB)

Additional details

Identifiers

ISSN
1556-6013

Funding

Ministry of Science and Technology of the People's Republic of China
National Key Research and Development Program of China No. 2021YFB3101304
National Natural Science Foundation of China
National Natural Science Foundation China No. 62372201
National Natural Science Foundation of China
National Natural Science Foundation China No. 62272186
European Commission
TENSOR - Reliable biomeTric tEhNologies to asSist Police authorities in cOmbating terrorism and oRganized crime 101073920
European Commission
TANGO - Digital Technologies ActiNg as a Gatekeeper to information and data flOws 101070052
European Commission
REWIRE - REWiring the ComposItional Security VeRification and AssurancE of Systems of Systems Lifecycle 101070627

References

  • S. Kamara, C. Papamanthou, and T. Roeder, "Dynamic searchable symmetric encryption," in Proc. ACM Conf. Comput. Commun. Secur., Oct. 2012, pp. 965–976
  • E. Stefanov, C. Papamanthou, and E. Shi, "Practical dynamic searchable encryption with small leakage," in Proc. Netw. Distrib. Syst. Secur. Symp., 2014, pp. 72–75.
  • R. Bost, B. Minaud, and O. Ohrimenko, "Forward and backward private searchable encryption from constrained cryptographic primitives," in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., Oct. 2017, pp. 1465–1482.
  • D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, "Public key encryption with keyword search," in Advances in Cryptology— EUROCRYPT. Berlin, Germany: Springer, May 2004, pp. 506–522.
  • ] R. A. Popa and N. Zeldovich, "Multi-key searchable encryption," IACR Cryptol. ePrint Arch., vol. 2013, p. 508, Aug. 2013
  • A. Hamlin, A. Shelat, M. Weiss, and D. Wichs, "Multi-key searchable encryption, revisited," in Public-Key Cryptography—PKC. Cham, Switzerland: Springer, Mar. 2018, pp. 95–124
  • D. G. Amalarathinam and J. M. Priya, "Survey on data security in multi-cloud environment," Int. J. Pure Appl. Math., vol. 118, no. 6, pp. 323–334, 2018
  • T. Shi, H. Ma, G. Chen, and S. Hartmann, "Cost-effective web application replication and deployment in multi-cloud environment," IEEE Trans. Parallel Distrib. Syst., vol. 33, no. 8, pp. 1982–1995, Aug. 2022.
  • R. Potharaju et al., "Hyperspace: The indexing subsystem of Azure synapse," Proc. VLDB Endowment, vol. 14, no. 12, pp. 3043–3055, Jul. 2021.
  • L. Chen, W.-K. Lee, C.-C. Chang, K.-K.-R. Choo, and N. Zhang, "Blockchain based searchable encryption for electronic health record sharing," Future Gener. Comput. Syst., vol. 95, pp. 420–429, Jun. 2019
  • J. G. Chamani, Y. Wang, D. Papadopoulos, M. Zhang, and R. Jalili, "Multi-user dynamic searchable symmetric encryption with corrupted participants," IEEE Trans. Dependable Secure Comput., vol. 20, no. 1, pp. 114–130, Jan. 2023
  • R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, "Searchable symmetric encryption: Improved definitions and efficient constructions," in Proc. 13th ACM Conf. Comput. Commun. Secur., Oct. 2006, pp. 79–88
  • S. Patel, G. Persiano, and K. Yeo, "Symmetric searchable encryption with sharing and unsharing," in Proc. Eur. Symp. Res. Comput. Secur., 2018, pp. 207–227
  • B. Cui, Z. Liu, and L. Wang, "Key-aggregate searchable encryption (KASE) for group data sharing via cloud storage," IEEE Trans. Comput., vol. 65, no. 8, pp. 2374–2385, Aug. 2016
  • J. Wang and S. S. M. Chow, "Omnes pro uno: Practical multiwriter encrypted database," in Proc. USENIX Secur. Symp., 2022, pp. 2371–2388.
  • D. Xiaoding Song, D. Wagner, and A. Perrig, "Practical techniques for searches on encrypted data," in Proc. IEEE Symp. Secur. Privacy, May 2000, pp. 44–55.
  • G. Chen, T.-H. Lai, M. K. Reiter, and Y. Zhang, "Differentially private access patterns for searchable symmetric encryption," in Proc. IEEE INFOCOM Conf. Comput. Commun., Apr. 2018, pp. 810–818.
  • L. Xu, X. Yuan, C. Wang, Q. Wang, and C. Xu, "Hardening database padding for searchable encryption," in Proc. IEEE INFOCOM Conf. Comput. Commun., Apr. 2019, pp. 2503–2511.
  • C. Bösch, P. Hartel, W. Jonker, and A. Peter, "A survey of provably secure searchable encryption," ACM Comput. Surv., vol. 47, no. 2, pp. 1–51, Jan. 2015.
  • B. Fuller et al., "Sok: Cryptographically protected database search," in Proc. IEEE Symp. Security Privacy, May 2017, pp. 172–191.
  • R. Bost, "Σoϕoς: Forward secure searchable encryption," in Proc. ACM CCS, 2016, pp. 1143–1154.
  • J. G. Chamani, D. Papadopoulos, C. Papamanthou, and R. Jalili, "New constructions for forward and backward private symmetric searchable encryption," in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., Oct. 2018, pp. 1038–1055
  • S.-F. Sun et al., "Practical backward-secure searchable encryption from symmetric puncturable encryption," in Proc. ACM SIGSAC Conf. Comput. Commun. Secur., Oct. 2018, pp. 763–780.
  • S.-F. Sun et al., "Practical non-interactive searchable encryption with forward and backward privacy," in Proc. Netw. Distrib. Syst. Secur. Symp., 2021, pp. 1–18
  • I. Demertzis, J. G. Chamani, D. Papadopoulos, and C. Papamanthou, "Dynamic searchable encryption with small client storage," in Proc. Netw. Distrib. Syst. Secur. Symp., 2020, pp. 1–18
  • T. Chen, P. Xu, W. Wang, Y. Zheng, W. Susilo, and H. Jin, "Bestie: Very practical searchable encryption with forward and backward security," in Computer Security—ESORICS. Cham, Switzerland: Springer, Oct. 2021, pp. 3–23.
  • P. Xu et al., "ROSE: Robust searchable encryption with forward and backward security," IEEE Trans. Inf. Forensics Security, vol. 17, pp. 1115–1130, 2022
  • K. He, J. Chen, Q. Zhou, R. Du, and Y. Xiang, "Secure dynamic searchable symmetric encryption with constant client storage cost," IEEE Trans. Inf. Forensics Security, vol. 16, pp. 1538–1549, 2021
  • J. Alderman, K. M. Martin, and S. L. Renwick, "Multi-level access in searchable symmetric encryption," in Proc. Int. Conf. Financial Cryptogr. Data Secur., 2017, pp. 35–52
  • Y. Wang and D. Papadopoulos, "Multi-user collusion-resistant searchable encryption with optimal search time," in Proc. ACM Asia Conf. Comput. Commun. Secur., May 2021, pp. 252–264
  • A. Kiayias, O. Oksuz, A. Russell, Q. Tang, and B. Wang, "Efficient encrypted keyword search for multi-user data sharing," in Computer Security—ESORICS. Cham, Switzerland: Springer, Sep. 2016, pp. 173–195.
  • S.-F. Sun, J. K. Liu, A. Sakzad, R. Steinfeld, and T. H. Yuen, "An efficient non-interactive multi-client searchable encryption with support for Boolean queries," in Computer Security—ESORICS. Cham, Switzerland: Springer, Sep. 2016, pp. 154–172.
  • R. A. Popa et al., "Building web applications on top of encrypted data using mylar," in Proc. NSDI, 2014, pp. 157–172.
  • P. Grubbs, R. McPherson, M. Naveed, T. Ristenpart, and V. Shmatikov, "Breaking web applications built on top of encrypted data," in Proc. ACM CCS, 2016, pp. 1353–1364
  • Y. Su, J. Wang, Y. Wang, and M. Miao, "Efficient verifiable multikey searchable encryption in cloud computing," IEEE Access, vol. 7, pp. 141352–141362, 2019.
  • C. Hahn, H. Yoon, and J. Hur, "Multi-key similar data search on encrypted storage with secure pay-per-query," IEEE Trans. Inf. Forensics Security, vol. 18, pp. 1169–1181, 2023