Abstract
Fuzzy keyword search is a necessary and important feature of information retrieval in modern cloud storage services since users with insufficient knowledge may input typos or keywords with inconsistent formats. However, most of the existing fuzzy search schemes adopt bloom filter and locality sensitive hashing which cannot resist Sparse Non-negative Matrix Factorization based attack (SNMF attack). To this end, we propose a new secure multi-keyword fuzzy search scheme for encrypted cloud data, our scheme leverages random redundancy method to handle the deterministic of bloom filter to resist SNMF attack. Besides the privacy, our scheme uses tree-based index construction to improve search efficiency and allows users to conduct complicated fuzzy search with logic operations “AND”, “OR” and “NOT”, which can meet more flexible and fine-grained query demands. The theoretical analysis and experiments on real-world data show the security and high performance of our scheme.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Indyk P, Motwani R (1998) Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC ’98. ACM, New York, pp 604–613. https://doi.org/10.1145/276698.276876
Lin W, Wang K, Zhang Z, Chen H (2017) Revisiting Security Risks of Asymmetric Scalar Product Preserving Encryption and Its Variants. In: IEEE International Conference on Distributed Computing Systems, pp 1116–1125
Wang B, Yu S, Lou W, Hou YT (2014) Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: IEEE INFOCOM, pp 2112–2120
Chen C, Zhu X, Shen P, Hu J, Guo S, Tari Z, Zomaya AY (2016) An Efficient Privacy-Preserving Ranked Keyword Search Method. IEEE Trans Parall Distr Syst 27(4):951. https://doi.org/10.1109/TPDS.2015.2425407
Wang D, Jia X, Wang C, Yang K, Fu S, Xu M (2015) Generalized pattern matching string search on encrypted data in cloud systems. In: IEEE INFOCOM, pp 2101–2109
Pasupuleti SK, Ramalingam S, Buyya R (2016) An efficient and secure privacy-preserving approach for outsourced data of resource constrained mobile devices in cloud computing. J Netw Comput Appl 64:12
Fu Z, Wu X, Guan C, Sun X, Ren K (2017) Towards Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement. IEEE Trans Inf Foren Sec 11(12):2706
Luo Y, Jia X, Fu S, Xu M (2018) pRide: Privacy-preserving Ride-matching over Road Networks for Online Ride Hailing Service. IEEE Transactions On Information Forensics & Security, p 1. https://doi.org/10.1109/TIFS.2018.2885282
Liu Z, Li B, Huang Y, Li J, Xiang Y (2019) NewMCOS: Towards a Practical Multi-cloud Oblivious Storage Scheme. WitoldPedrycz, IEEE Transactions on Knowledge and Data Engineering, p 1. https://doi.org/10.1109/TKDE.2019.2891581
Li J, Wang Q, Wang C, Cao N, Ren K, Lou W (2010) Fuzzy keyword search over encrypted data in cloud computing. In: Conference on Information Communications, pp 441–445
Zheng M, Zhou H (2014) An Efficient Attack on a Fuzzy Keyword Search Scheme over Encrypted Data. In: IEEE International Conference on High PERFORMANCE Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, pp 1647–1651
Wang C, Ren K, Yu S, Urs KMR (2012) Achieving usable and privacy-assured similarity search over outsourced cloud data. In: IEEE INFOCOM, pp 451–459
Kuzu M, Islam MS, Kantarcioglu M (2012) Efficient Similarity Search over Encrypted Data. In: IEEE International Conference on Data Engineering, pp 1156–1167
Bloom BH (1970) Space/time trade-offs in hash coding with allowable error. Commun ACM 13(7):422. https://ci.nii.ac.jp/naid/20001345133/en/
Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: Twentieth Symposium on Computational Geometry, pp 253–262
Kim H, Park H (2007) Sparse non-negative matrix factorizations via alternating nonnegativity- constrained least squares for microarray data analysis. Bioinformatics 23(12):1495
Wong WK, Cheung DW, Kao B, Mamoulis N (2009) Secure kNN computation on encrypted databases. In: ACM SIGMOD International Conference on Management of Data, pp 139–152
Li H, Yang Y, Luan T, Liang X, Zhou L, Shen X (2016) Privacy-Preserving and Regular Language Search Over Encrypted Cloud Data. IEEE Trans Depend Secure Comput 13(3):312
Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption:improved definitions and efficient constructions. In: ACM Conference on Computer and Communications Security, pp 79–88
Acknowledgments
This work is supported by the National Nature Science Foundation of China (NSFC) under grant 61572026 and 61672195, Open Foundation of State Key Laboratory of Cryptology (No:MMKFKT201617).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fu, S., Zhang, Q., Jia, N. et al. A Privacy-preserving Fuzzy Search Scheme Supporting Logic Query over Encrypted Cloud Data. Mobile Netw Appl 26, 1574–1585 (2021). https://doi.org/10.1007/s11036-019-01493-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-019-01493-3