题名 | Blockchain-Based Verifiable Multi-Keyword Ciphertext Retrieval Scheme |
作者 | |
发表日期 | 2025 |
会议名称 | 8th International Conference on Information Science, Communication and Computing, ISCC 2024 |
会议录名称 | Smart Innovation, Systems and Technologies
![]() |
ISSN | 2190-3018 |
卷号 | 434 SIST |
页码 | 40-50 |
会议日期 | 2024-08-23——2024-08-23 |
会议地点 | chn,Zhengzhou |
摘要 | Searchable encryption is a technique that enables searching operations without decryption, thereby facilitating secure search functionality while protecting privacy. We propose a blockchain-based verifiable multi-keyword ciphertext retrieval scheme to address the challenges of complex and inefficient result verification and the unreliability of third-party verification, which have long been obstacles to ranking searchable encryption schemes. This scheme constructs both index vectors and query vectors using the vector space model and the TF-IDF algorithm. It leverages the depth-first search algorithm combined with a pruning strategy, utilizing binary tree index structure to implement ranked keyword retrieval. To validate the integrity of the returned data, our scheme generates a root hash value for the collection of ciphertext based on a Merkle tree. Furthermore, the immutability characteristic of blockchain enhances the trustworthiness of the retrieval results. Finally, the security analysis and simulation experiments demonstrate the security and efficiency of our scheme. |
关键词 | Blockchain Merkle tree Searchable Encryption Verifiable Search |
DOI | 10.1007/978-981-96-1781-4_4 |
URL | 查看来源 |
语种 | 英语English |
Scopus入藏号 | 2-s2.0-85218927912 |
引用统计 | |
文献类型 | 会议论文 |
条目标识符 | https://repository.uic.edu.cn/handle/39GCC9TT/13439 |
专题 | 个人在本单位外知识产出 |
通讯作者 | Chen,Zhong |
作者单位 | 1.Zhengzhou Normal University,Zhengzhou,Henan,450044,China 2.Peking University,Beijing,100871,China |
推荐引用方式 GB/T 7714 | Sun,Qianhui,Cheng,Zhuofei,Wang,Lipenget al. Blockchain-Based Verifiable Multi-Keyword Ciphertext Retrieval Scheme[C], 2025: 40-50. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论