Cryptology ePrint Archive: Report 2017/1068

Frequency-smoothing encryption: preventing snapshot attacks on deterministically encrypted data

Marie-Sarah Lacharit and Kenneth G. Paterson

Abstract: Statistical analysis of ciphertexts has been recently used to carry out devastating inference attacks on deterministic encryption (Naveed, Kamara, and Wright, CCS 2015), order-preserving/revealing encryption (Grubbs et al., S&P 2017), and searchable encryption (Pouliot and Wright, CCS 2016). At the heart of these inference attacks is classical frequency analysis. In this paper, we propose and evaluate another classical technique, homophonic encoding, as a means to combat these attacks. We introduce and develop the concept of frequency-smoothing encryption (FSE) which provably prevents inference attacks in the snapshot attack model, wherein the adversary obtains a static snapshot of the encrypted data, while preserving the ability to efficiently and privately make point queries. We provide provably secure constructions for FSE schemes, and we empirically assess their security for concrete parameters by evaluating them against real data. We show that frequency analysis attacks (and optimal generalisations of them for the FSE setting) no longer succeed.

Category / Keywords: encrypted database, snapshot attack, inference attack, frequency analysis, deterministic encryption, homophonic encoding, frequency-smoothing encryption

Original Publication (with minor differences): IACR-FSE-2018

Date: received 2 Nov 2017, last revised 23 Feb 2018

Contact author: marie-sarah lacharite 2015 at rhul ac uk

Available format(s): PDF | BibTeX Citation

Version: 20180223:182004 (All versions of this report)

Short URL: ia.cr/2017/1068

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]