Improved Indistinguishability for Searchable Symmetric Encryption


Chin, Ji Jian and Mohamad, Moesfa Soeheila (2020) Improved Indistinguishability for Searchable Symmetric Encryption. In: Provable and Practical Security. Lecture Notes in Computer Science, 12505 . Springer Science and Business Media Deutschland GmbH, International Conference on Provable Security, pp. 190-212. ISBN 9783030625757

[img] Text
129.pdf - Published Version
Restricted to Repository staff only

Download (12MB)


This work presents a new experiment defining indistinguishability for searchable symmetric encryption to include security against published practical attacks. The proposed experiment allows the adversaries to use their prior knowledge about the stored documents to win. We solve the problem of modelling the adversaries with prior knowledge using the interacting split adversary technique. This new indistinguishability definition is aligned with the security goals and adversary capabilities listed in [4]. The correctness of the indistinguishability experiment is demonstrated by presenting proofs of strength and vulnerabilities of Σoϕoς -B and one of its variant. We write the security proofs based on the indistinguishability experiment with an adversary without any prior knowledge and adversary with full knowledge of the document set. We show how to win the indistinguishability experiment using the count attack by an adversary who knows the document distribution, and the file injection attack by an adversary without prior knowledge.

Item Type: Book Section
Uncontrolled Keywords: Symmetric functions, Searchable symmetric encryption, Indistinguishability, Adversary model
Subjects: Q Science > QA Mathematics > QA150-272.5 Algebra
Divisions: Faculty of Engineering (FOE)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 19 Aug 2021 15:56
Last Modified: 19 Aug 2021 15:56


Downloads per month over past year

View ItemEdit (login required)