107
v1v2 (latest)

VeriFuzzy: A Dynamic Verifiable Fuzzy Search Service for Encrypted Cloud Data

Main:13 Pages
5 Figures
Bibliography:2 Pages
Abstract

Enabling search over encrypted cloud data is essential for privacy-preserving data outsourcing. While searchable encryption has evolved to support individual requirements like fuzzy matching, dynamic updates, and result verification, designing a service that supports dynamic, verifiable fuzzy search (DVFS) over encrypted cloud data remains a fundamental challenge due to inherent conflicts between underlying technologies. Existing approaches struggle with simultaneously achieving efficiency, functionality, and security, often forcing impractical trade-offs.This paper presents \textbf{VeriFuzzy}, a novel DVFS service framework that cohesively integrates three innovations: an \textit{Enhanced Virtual Binary Tree (EVBTree)} that decouples fuzzy semantics from index logic to support O(logn)O(\log n) search/updates; a \textit{blockchain-reconstructed verification} mechanism that ensures result integrity with logarithmic complexity; and a \textit{dual-repository state management} scheme that achieves IND-CKA2 security by neutralizing branch leakage.Extensive evaluation on 3,500+ documents shows VeriFuzzy achieves 41\% faster search, 5×5\times more efficient verification, and constant-time index updates compared to state-of-the-art alternatives. Our code and dataset are now open source, hoping to inspire future DVFS research.

View on arXiv
Comments on this paper