返回
Enabling efficient and verifiable secure search on cloud-based encrypted big data
DOI:10.1007/s12083-023-01546-1.png)
摘要
En 中文
Verifiable symmetric searchable encryption schemes have received a lot of attention as they can guarantee the correctness of query results in case of attack or misconfiguration of cloud servers. However, these schemes either suffer from the problem of using memory space in exchange for search speed, or need to perform a large amount of computation at some stage. To address these problems, we propose an Efficient and Verifiable Secure Search scheme (EVSS). In particular, the scheme designs a new index structure Privacy Protection - Finite State Transducers (PPFST), to verify the correctness of search results by storing path information, node states and their proofs on each PPFST arc. Besides, the structure can reuse common prefixes and suffixes to reduce storage space. In addition, the EVSS scheme uses the Key Derivation Function to act on file identifiers to resist substitution attacks and reduce the computational overhead in the index generation and verification phases. Compared with the state-of-the-art technology, our proposed solution accelerates the result validation time by a thousand times, with an index construction cost of one-tenth and a storage cost of 1%.
Keyword:
Searchable encryption
Verifiability
Substitution attack
PPFST
期刊
IF:
2.6
论文数:
2.2K
被引数:
2.9K
机构
引用论文
Verifiable and Dynamic Multi-Keyword Search Over Encrypted Cloud Data Using Bitmap使用位图对加密的云数据进行可验证的动态多关键字搜索
Efficient and dynamic verifiable multi-keyword searchable symmetric encryption with full security具有完全安全性的高效动态可验证多关键字可搜索对称加密

