Security-Efficiency Tradeoffs in Searchable Encryption
Author:
Bost Raphael1, Fouque Pierre-Alain2
Affiliation:
1. Direction Générale de l’Armement - Maîtrise de l’Information. The views and conclusions contained herein are those of the author and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the DGA or the French Government. 2. Université de Rennes 1, France .
Abstract
Abstract
Besides their security, the efficiency of searchable encryption schemes is a major criteria when it comes to their adoption: in order to replace an unencrypted database by a more secure construction, it must scale to the systems which rely on it. Unfortunately, the relationship between the efficiency and the security of searchable encryption has not been widely studied, and the minimum cost of some crucial security properties is still unclear.
In this paper, we present new lower bounds on the trade-offs between the size of the client state, the efficiency and the security for searchable encryption schemes. These lower bounds target two kinds of schemes: schemes hiding the repetition of search queries, and forward-private dynamic schemes, for which updates are oblivious.
We also show that these lower bounds are tight, by either constructing schemes matching them, or by showing that even a small increase in the amount of leaked information allows for constructing schemes breaking the lower bounds.
Publisher
Walter de Gruyter GmbH
Reference46 articles.
1. [AKL+18] Asharov, G., Komargodski, I., Lin, W.K., Nayak, K., Peserico, E., and Shi, E. OptORAMa: Optimal oblivious ram. Cryptology ePrint Archive, Report 2018/892 (2018). https://eprint.iacr.org/2018/892. 2. [ANSS16] Asharov, G., Naor, M., Segev, G., and Shahaf, I. Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. In: D. Wichs and Y. Mansour (eds.), 48th ACM STOC, pp. 1101–1114. ACM Press (Jun. 2016).10.1145/2897518.2897562 3. [ASS18] Asharov, G., Segev, G., and Shahaf, I. Tight tradeoffs in searchable symmetric encryption. In: H. Shacham and A. Boldyreva (eds.), CRYPTO 2018, Part I, LNCS, vol. 10991, pp. 407–436. Springer, Heidelberg (Aug. 2018).10.1007/978-3-319-96884-1_14 4. [BBO07] Bellare, M., Boldyreva, A., and O’Neill, A. Deterministic and efficiently searchable encryption. In: A. Menezes (ed.), CRYPTO 2007, LNCS, vol. 4622, pp. 535–552. Springer, Heidelberg (Aug. 2007).10.1007/978-3-540-74143-5_30 5. [BCLO09] Boldyreva, A., Chenette, N., Lee, Y., and O’Neill, A. Order-preserving symmetric encryption. In: A. Joux (ed.), EUROCRYPT 2009, LNCS, vol. 5479, pp. 224–241. Springer, Heidelberg (Apr. 2009).10.1007/978-3-642-01001-9_13
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weighted Oblivious RAM, with Applications to Searchable Symmetric Encryption;Advances in Cryptology – EUROCRYPT 2023;2023 2. Hermes: I/O-Efficient Forward-Secure Searchable Symmetric Encryption;Advances in Cryptology – ASIACRYPT 2023;2023 3. Limits of Breach-Resistant and Snapshot-Oblivious RAMs;Advances in Cryptology – CRYPTO 2023;2023 4. Leakage Inversion;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07 5. Geometric Range Search on Encrypted Data With Forward/Backward Security;IEEE Transactions on Dependable and Secure Computing;2022-01-01
|
|