Abstract
Traditional searchable encryption schemes focus on preventing an honest-but-curious server. In practice, cloud servers may delete user data, perform partial queries and even falsify search results to save computing and storage resources. Although there is some previous work to verify the correctness of search results, these verification mechanisms are highly dependent on the specially appointed index structures.
In this paper, we propose a blockchain based multi-keyword similarity search scheme over encrypted data (BMSSED), which is a general scheme that keeps users from worrying about potential misbehaviors of a malicious server. To solve the problem that the size of transactions is limited, we use an index partition method to divide the traditional binary tree index into a plurality of sub-indexes. The new structure of sub-indexes not only circumvents the gasLimit problem, but also reduces the dimension of file vectors and improves the search efficiency using smart contracts. In addition, we propose an access control mechanism for transaction data, which is implemented by a new smart contract. It can reduce the computation burden of data owners and prevent the leakage of confidential information. We then define the security model and conduct repeated experiments on real data sets to test the efficiency. Experimental results and theoretical analysis show the practicability and security of our scheme.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Shangqi Lai, Sikhar Patranabis, Amin Sakzad. Result pattern hiding searchable encryption for conjunctive queries, in: the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15–19, 2018, pp. 745–762
Kermanshahi, S.K., Liu, J.K., Steinfeld, R.: Generic multi keyword ranked search on encrypted cloud data, In: Proceedings of ESORICS 2019–24th European Symposium on Research in Computer Security, Luxembourg, 23–27 September 2019, Part II, pp. 322–343 (2019)
Xu, L., Yuan, X., Wang, C.: Hardening database padding for searchable encryption. In: 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, pp. 2503–2511 (2019)
Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, pp. 44–55. 14–17 May 2000
Chen, C., Zhu, X., Shen, P.: An efficient privacy-preserving ranked keyword search method. IEEE Trans. Parallel Distrib. Syst. 27, 951–963 (2015)
Liu, Q., Nie, X., Liu, X.: Verifiable ranked search over dynamic encrypted data in cloud computing. In: 25th IEEE/ACM International Symposium on Quality of Service, IWQoS 2017, Vilanovaila Geltrú, Spain, pp. 1–6. 14–16 June 2017
Homann, D., Wiese, L.: Inference attacks on fuzzy searchable encryption schemes. Trans. Data Priv. 12(2), 91–115 (2019)
Wan, Z., Deng, R.H.: Vpsearch: achieving verifiability for privacy-preserving multi-keyword search over encrypted cloud data. IEEE Trans. Dependable Secure Comput. 15, 1083–1095 (2016)
Wang, Q., He, M., Minxin, D.: Searchable encryption over feature rich data. IEEE Trans. Dependable Sec. Comput. 15, 496–510 (2018)
Xia, Z., Wang, X., Sun, X.: A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 27(2), 340–352 (2016)
Hu, S., Cai, C., Wang, Q.: Searching an encrypted cloud meets blockchain: a decentralized, reliable and fair realization. In: 2018 IEEE Conference on Computer Communications, INFOCOM 2018, Honolulu, HI, USA, pp. 792–800 (2018)
Jiang, S., Liu, J., Wang, L.: Verifiable search meets blockchain: a privacy-preserving framework for outsourced encrypted data. In: 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, China, pp. 1–6. 20–24 May 2019
Lai, S., Patranabis, S., Sakzad, A.: Result pattern hiding searchable encryption for conjunctive queries. In: Proceedings of the ACM Conference on Computer and Communications Security, pp. 745–762 (2018)
Kerschbaum, F., Tueno, A.: An efficiently searchable encrypted data structure for range queries. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 344–364. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-29962-0_17
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
Asharov, G., Segev, G., Shahaf, I.: Tight tradeoffs in searchable symmetric encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 407–436. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96884-1_14
Zhang, W., Lin, Y., Qi, G.: Catch you if you misbehave: Ranked keyword search results verification in cloud computing. IEEE Trans. Cloud Comput. 6, 74–86 (2018)
Ron, D., Shamir, A.: Quantitative analysis of the full bitcoin transaction graph. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 6–24. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39884-1_2
Lavery, K.: Smart Contracting for Local Government Services: Processes and Experience. Praeger Publishers Inc, Westport (1999)
Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on Bitcoin. Commun. ACM 59(4), 76–84 (2016)
Bentov, I., Kumaresan, R.: How to use Bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 421–439. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44381-1_24
Portmann, E.: Rezension blockchain: blueprint for a new economy. HMD Prax. der Wirtschaftsinformatik 55(6), 1362–1364 (2018). https://doi.org/10.1365/s40702-018-00468-4
Li, H., Zhang, F., He, J.: A searchable symmetric encryption scheme using blockchain. CoRR abs/1711.01030 (2017)
Tahir, S., Rajarajan, M.: Privacy-preserving searchable encryption framework for permissioned blockchain networks. In: IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData, Halifax, NS, Canada, pp. 1628–1633 (2018)
Chen, L., Lee, W.-K., Chang, C.-C.: Blockchain based searchable encryption for electronic health record sharing. Future Gener. Comput. Syst. 95, 420–429 (2019)
Torres, C.F.: Mathis steichen, radu state: the art of the scam: demystifying honeypots in ethereum smart contracts. In: USENIX Security Symposium, pp. 1591–1607 (2019)
Zhang, Q., Fu, S., Jia, N., Xu, M.: A verifiable and dynamic multi-keyword ranked search scheme over encrypted cloud data with accuracy improvement. In: Beyah, R., Chang, B., Li, Y., Zhu, S. (eds.) SecureComm 2018. LNICST, vol. 254, pp. 588–604. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01701-9_32
Yao, B., Li, F., Xiao, X.: Secure nearest neighbor revisited. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, pp. 733–744 (2013)
Acknowledgments
We would like to thank anonymous reviewers for their helpful comments. This work is supported by National Key R&D Program of China(2018YFA0704703); National Natural Science Foundation of China(61972215, 61702399, 61972073); Natural Science Foundation of TianJin(17JCZDJC30500)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Li, M., Jia, C., Shao, W. (2020). Blockchain Based Multi-keyword Similarity Search Scheme over Encrypted Data. In: Park, N., Sun, K., Foresti, S., Butler, K., Saxena, N. (eds) Security and Privacy in Communication Networks. SecureComm 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 336. Springer, Cham. https://doi.org/10.1007/978-3-030-63095-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-63095-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63094-2
Online ISBN: 978-3-030-63095-9
eBook Packages: Computer ScienceComputer Science (R0)