期刊
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
卷 18, 期 1, 页码 460-474出版社
IEEE COMPUTER SOC
DOI: 10.1109/TDSC.2019.2894411
关键词
Privacy; Encryption; Probabilistic logic; Data privacy; Indexes; Searchable encryption; forward search privacy; forward privacy; data privacy
类别
资金
- National Natural Science Foundation [61472091, 61672300]
- Guangzhou scholars project for universities of Guangzhou [1201561613]
- National Natural Science Foundation of Tianjin [16JCYBJC15500]
- [61722203]
- EPSRC [EP/M013561/2, EP/M013561/1] Funding Source: UKRI
SSE is widely used in encrypted databases, but faces challenges with information leaks. To enhance security, the notion of forward search privacy has been introduced, posing new challenges for SSE design. Khons is a new SSE scheme that is efficient and meets security requirements.
Searchable symmetric encryption (SSE) has been widely applied in the encrypted database for queries in practice. Although SSE is powerful and feature-rich, it is always plagued by information leaks. Some recent attacks point out that forward privacy which disallows leakage from update operations, now becomes a basic requirement for any newly designed SSE schemes. However, the subsequent search operations can still leak a significant amount of information. To further strengthen security, we extend the definition of forward privacy and propose the notion of forward search privacy. Intuitively, it requires search operations over newly added documents do not leak any information about past queries. The enhanced security notion poses new challenges to the design of SSE. We address the challenges by developing the hidden pointer technique (HPT) and propose a new SSE scheme called Khons, which satisfies our security notion (with the original forward privacy notion) and is also efficient. We implemented Khons and our experiment results on large dataset (wikipedia) show that it is more efficient than existing SSE schemes with forward privacy.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据