Abstract
As people become more privacy conscious, the security requirements of databases are increasing, and thus the technology of encrypted databases is developing rapidly. Although many theoretical results have been produced in the academic community, only a few examples have been operated in the enterprise community, mainly due to the imbalance in the trade-off between the efficiency and security of encrypted databases.
In this paper, we focus on an example of the encrypted database, the multi-version key encrypted database, which loses the unique indexing function and has excessive exact query time overhead in achieving security. In order to solve this problem and fully optimize the database, we systematically analyze the implementation principle of the exact query algorithm of this database to reduce the redundant operations in the original query process, and draw on Blind Seer’s idea of index design, use Bloom filters to construct unique indexes for this encrypted database, optimize the exact query process, and finally achieve high efficiency and security at the cost of tolerable space overhead and false alarm rate. Theoretical analysis shows that the new scheme is not less secure than the original scheme, the time complexity is reduced, and it is compatible with other operations; experimental results show that the efficiency of the exact query has been effectively improved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Naveed, M., Kamara, S., Wright, C.V.: Inference attacks on property-preserving encrypted databases. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 644–655 (2015)
Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends® Theor. Comput. Sci. 9(3–4), 211–407 (2014)
Zhang, Z., Yan, J., Liu, S., et al.: A face antispoofing database with diverse attacks. In: 2012 5th IAPR International Conference on Biometrics (ICB), pp. 26–31. IEEE (2012)
Cui, S., Song, X., Asghar, M.R., et al.: Privacy-preserving dynamic symmetric searchable encryption with controllable leakage. ACM Trans. Priv. Secur. (TOPS) 24(3), 1–35 (2021)
Kadykov, V., Levina, A., Voznesensky, A.: Homomorphic encryption within lattice-based encryption system. Procedia Comput. Sci. 186, 309–315 (2021)
Stefanov, E., Dijk, M., Shi, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. J. ACM (JACM) 65(4), 1–26 (2018)
Chai, Q., Gong, G.: Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In: 2012 IEEE International Conference on Communications (ICC), pp. 917–922. IEEE (2012)
Popa, R.A, Li, F.H., Zeldovich, N.: An ideal-security protocol for order-preserving encoding. In: 2013 IEEE Symposium on Security and Privacy, pp. 463–477. IEEE (2013)
Pinto, S., Santos, N.: Demystifying arm TrustZone: a comprehensive survey. ACM Comput. Surv. (CSUR) 51(6), 1–36 (2019)
Costan, V., Devadas, S.: Intel SGX explained. Cryptology ePrint Archive (2016)
He, X., Wei, H., Han, S., Shen, D.: Multi-party privacy-preserving record linkage method based on trusted execution environment. In: Zhao, X., Yang, S., Wang, X., Li, J. (eds.) WISA 2022. Lecture Notes in Computer Science, vol. 13579, pp. 591–602. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-20309-1_52
Popa, R.A., Zeldovich, N., Balakrishnan, H.: CryptDB: a practical encrypted relational DBMS (2011)
Pappas, V., Krell, F., Vo, B., et al.: Blind seer: a scalable private DBMS. In: 2014 IEEE Symposium on Security and Privacy, pp. 359–374. IEEE (2014)
Fisch, B.A., Vo, B., Krell, F., et al.: Malicious-client security in blind seer: a scalable private DBMS. In: 2015 IEEE Symposium on Security and Privacy, pp. 395–410. IEEE (2015)
Vinayagamurthy, D., Gribov, A., Gorbunov, S.: StealthDB: a scalable encrypted database with full SQL query support. Proc. Priv. Enhancing Techno1 2019(3), 370–388 (2019)
Antonopoulos, P., et al.: Azure SOL database always encrypted. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 1511–1525 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Duan, G., Ma, S., Wen, Y. (2023). Exact Query in Multi-version Key Encrypted Database via Bloom Filters. In: Yuan, L., Yang, S., Li, R., Kanoulas, E., Zhao, X. (eds) Web Information Systems and Applications. WISA 2023. Lecture Notes in Computer Science, vol 14094. Springer, Singapore. https://doi.org/10.1007/978-981-99-6222-8_35
Download citation
DOI: https://doi.org/10.1007/978-981-99-6222-8_35
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-6221-1
Online ISBN: 978-981-99-6222-8
eBook Packages: Computer ScienceComputer Science (R0)
