.png){kind=icon}
.png){kind=icon}
Return
Enabling efficient and verifiable secure search on cloud-based encrypted big data
.png){kind=icon}
PRE
AI
DOI：10.1007/s12083-023-01546-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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%.
Keywords:
Searchable encryption
Verifiability
Substitution attack
PPFST
Journal
IF:
2.6
Papers:
2.2K
Citations:
2.9K