Practical Non-Interactive Searchable Encryption with Forward and Backward Privacy

Abstract

In Dynamic Symmetric Searchable Encryption (DSSE), forward privacy ensures that previous search queries cannot be associated with future updates, while backward privacy guarantees that subsequent search queries cannot be associated with deleted documents in the past. In this work, we propose a generic forward and backward-private DSSE scheme, which is, to the best of our knowledge, the first practical and non-interactive Type-II backward-private DSSE scheme not relying on trusted execution environments. To this end, we first introduce a new cryptographic primitive, named Symmetric Revocable Encryption (SRE), and propose a modular construction from some succinct cryptographic primitives. Then we present our DSSE scheme based on the proposed SRE, and instantiate it with lightweight symmetric primitives. At last, we implement our scheme and compare it with the most efficient Type-II backward-private scheme to date (Demertzis et al., NDSS 2020). In a typical network environment, our result shows that the search in our scheme outperforms it by 2 − 11× under the same security notion.

Forward privacy multikeyword ranked search over encrypted database

“…Li et al 57 proposed the concept of forward search privacy and designed a SSE scheme. Sun et al 58 designed a FPSE scheme using the Symmetric Revokable Encryption technique. Zhang et al 59 proposed a FPSE scheme based on lattice assumptions to realize postquantum secure.…”

IoT-REX: A Secure Remote-Control System for IoT Devices from Centralized Multi-Designated Verifier Signatures

“…Most of cryptographic research related to AMQ structures (e.g., [15,32,46]) focus on the Bloom filter [8] since unlike recent experimentally-efficient AMQ structures, it has been well analyzed in a theoretical sense. The previous works have completely different goals from ours: Derler et al [15] introduced Bloom filter encryption to efficiently realize puncturable encryption, which is a special type of public-key encryption; Naor and Yogev [32] considered the Bloom filter in adversarial environments to make the Bloom filter robust; and Sun et al [46] employed the Bloom filter to maintain encrypted database for searchable encryption. To the best of our knowledge, there is no research on cryptographic protocols based on AMQ structures in the context of secure remote control.…”

A Lightweight Blockchain-based Public-Key Authenticated Encryption with Multi-Keyword Search for Cloud Computing

“…e bloom filter (BF) is a probabilistic data structure. It is very useful for performing collection membership tests quickly and in a space-saving manner, but it has the drawback that false positives do occur [34][35][36]. False positives are rare enough that many applications outweigh this disadvantage.…”