FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE scheme
Laltu Sardar, Sushmita Ruj

TL;DR
This paper introduces a new publicly verifiable dynamic symmetric searchable encryption scheme that ensures forward privacy, minimizes owner-side storage and computation, and is practical for real-world use.
Contribution
It proposes a generic scheme that makes any forward private DSSE verifiable without additional owner storage or significant computational overhead.
Findings
The scheme is practically efficient and secure.
It does not require extra owner storage.
It maintains forward privacy while enabling verification.
Abstract
A symmetric searchable encryption (SSE) scheme allows a client (data owner) to search on encrypted data outsourced to an untrusted cloud server. The search may either be a single keyword search or a complex query search like conjunctive or Boolean keyword search. Information leakage is quite high for dynamic SSE, where data might be updated. It has been proven that to avoid this information leakage an SSE scheme with dynamic data must be forward private. A dynamic SSE scheme is said to be forward private, if adding a keyword-document pair does not reveal any information about the previous search result with that keyword. In SSE setting, the data owner has very low computation and storage power. In this setting, though some schemes achieve forward privacy with honest-but-curious cloud, it becomes difficult to achieve forward privacy when the server is malicious, meaning that it can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Cloud Data Security Solutions
