Paper 2025/1672
All Paths Lead to the Root
Abstract
In an attempt to fix the defects of the definition of forward security for Symmetric Searchable Encryption (SSE) schemes, Amjad et al. [2] proposed injection security. This new security property is strictly stronger than most security properties known to date, which makes it particularly challenging to design schemes meeting its requirements. In this work, we show how it is possible to use trees to decorrelate the modification of an index from its effects, hence achieving injection security. In addition to being conceptually simple, our scheme features non-interactive, stateless and mutation-free search operations that allow supporting concurrent readers easily. Finally, the proposed reference implementation is efficient: both Insert and Search operations execute in milliseconds even when operating on an index with up to a million entries and volumes up to a thousand.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- SSE STE EMM
- Contact author(s)
-
theophile brezot @ cosmian com
chloe hebant @ cosmian com - History
- 2025-09-18: approved
- 2025-09-16: received
- See all versions
- Short URL
- https://ia.cr/2025/1672
- License
-
CC BY-SA
BibTeX
@misc{cryptoeprint:2025/1672,
author = {Théophile Brézot and Chloé Hébant},
title = {All Paths Lead to the Root},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1672},
year = {2025},
url = {https://eprint.iacr.org/2025/1672}
}