Research Article
Blockchain Based Multi-keyword Similarity Search Scheme over Encrypted Data
@INPROCEEDINGS{10.1007/978-3-030-63095-9_23, author={Mingyue Li and Chunfu Jia and Wei Shao}, title={Blockchain Based Multi-keyword Similarity Search Scheme over Encrypted Data}, proceedings={Security and Privacy in Communication Networks. 16th EAI International Conference, SecureComm 2020, Washington, DC, USA, October 21-23, 2020, Proceedings, Part II}, proceedings_a={SECURECOMM PART 2}, year={2020}, month={12}, keywords={Searchable encryption Blockchain Ethereum Smart contract Access control.}, doi={10.1007/978-3-030-63095-9_23} }- Mingyue Li
Chunfu Jia
Wei Shao
Year: 2020
Blockchain Based Multi-keyword Similarity Search Scheme over Encrypted Data
SECURECOMM PART 2
Springer
DOI: 10.1007/978-3-030-63095-9_23
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 thegasLimitproblem, 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.
