BPMS: Blockchain-Based Privacy-Preserving Multi-Keyword Search in Multi-Owner Setting
- 5 August 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 11 (3) , 2260-2272
Abstract
Searchable encryption (SE) has emerged as a cryptographic primitive that allows data users to search on encrypted data. Most existing SE schemes usually delegate search operations to an intermediary such as a cloud server, which would inevitably result in single-point failure, privacy leakage, and even untrustworthy results. Several blockchain-based SE schemes have been proposed to alleviate these issues; however, they suffer from some issues, such as the support for multi-keyword multi-owner model, query privacy and data storage availability. In this paper, we propose BPMS, blockchain-based privacy-preserving multi-keyword search in multi-owner setting, which supports searching over encrypted data in trustworthy, private and efficient manners. The attribute Bloom filter has been introduced into our BPMS to build indexes, which protects query privacy and improves index generation performance. To guarantee data storage availability, our BPMS leverages the advantages of IPFS (InterPlanetary File System) to store large scale of encrypted data. Security proof and comparative analysis in theory indicate that our BPMS is more secure and efficient. A series of experiments conducted on a real-world dataset further demonstrate that our BPMS is feasible in practice.Keywords
Funding Information
- National Natural Science Foundation of China (62072487, 61902290)
- Beijing Natural Science Foundation (M21036)
- National Statistical Science Foundation of China (2020LD01)
- Key Research and Development Projects of Shaanxi Province (2020ZDLGY09-06)
- Natural Science Foundation of Zhejiang Province (LD22F020002)
- Guangxi Key Laboratory of Trusted Software (kx202004)
This publication has 47 references indexed in Scilit:
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries2013
- Achieving Efficient Conjunctive Keyword Searches over Encrypted Data2005
- The Enron Corpus: A New Dataset for Email Classification Research2004
- Public Key Encryption with Keyword Search2004
- Secure Conjunctive Keyword Search over Encrypted Data2004
- Kademlia: A Peer-to-Peer Information System Based on the XOR Metric2002
- Identity-Based Encryption from the Weil Pairing2001
- The Decision Diffie-Hellman problem1998
- The discrete logarithm problem1991
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970